[TYPES] type-sensitive CFA?

[Nadia Tawbi]

Hi John,

  we have presented a work on this subject in IFL 1996.
Here is the reference in bibtex.


@InProceedings{DFT96,
  author =       "M. Debbabi and A. Faour and N. Tawbi",
  title =        "Efficient Type-Based Control-Flow Analysis of
                     Higher-Order Concurrent Programs",
  booktitle =    "Proceedings of the International Workshop on
		  Functional and Logic Programming, IFL'96",
  publisher =    "Spriger-Verlag LNCS 1268",
  pages = {247--266},
 month = sep,
  year =         "1996"
}


Regards,

Nadia

Quoting John Reppy <jhr at cs.uchicago.edu>:

> [The Types Forum, http://lists.seas.upenn.edu/mailman/listinfo/types-list]
>
> I'm looking at a program analysis problem for ML-like languages where
> I want to exploit type abstraction to improve the precision of a
> standard 0-CFA type analysis.  I was wondering if such analyses have
> been previously studied and/or implemented?  Any pointers would
> appreciated.  Thanks.
>
>      - John
>
>