Type-based flow analysis: From polymorphic subtyping to CFL-reachability

SIGPLAN Notices (ACM Special Interest Group on Programming Languages)

Volumn 36, Issue 3, 2001, Pages 54-65

  Rehof, Jakob ^a   Fähndrich, Manuel ^a  

^a MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 17644398246     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/373243.360208     Document Type: Article

References (35)

1. A. Aiken, E.L. Wimmers, and J. Palsberg. Optimal representations of polymorphic types with subtyping. In Proceedings Theoretical Aspects of Computer Software, pages 47-77. LNCS 1281, 1997.
2. P. Curtis. Constrained quantification in polymorphic type analysis. Technical Report CSL-90-1, Xerox Parc, 1990.
3. Dirk Dussart, Fritz Henglein, and Christian Mossin. Polymorphic recursion and subtype qualifications: Polymorphic binding-time analysis in polynomial time. In Proc. 2nd Int'l Static Analysis Symposium (SAS), LNCS 983, 1995.
4. Dirk Dussart, Fritz Henglein, and Christian Mossin. Polymorphic recursion and subtype qualifications: Polymorphic binding-time analysis in polynomial time. Unpublished draft, May 1995.
5. J. Eifrig, S. Smith, and V. Trifonov. Sound polymorphic type inference for objects. In Proceedings OOPSLA '95, 1995.
6. M. Fähndrich and A. Aiken. Making set-constraint program analyses scale. In Workshop on Set Constraints, Cambridge MA, 1996.
7. C. Flanagan and M. Felleisen. Componential set-based analysis. In Programming Language Design and Implementation, June 1997.
8. Jeffrey S. Foster, Manuel Fähndrich, and Alexander Aiken. Polymorphic versus monomorphic flow-insensitive points-to analysis for c. In Proceedings of the 7th International Static Analysis Symposium, June 2000.
9. Y. Fuh and P. Mishra. Polymorphic subtype inference: Closing the theory-practice gap. In Proc. Int'l J't Conf. on Theory and Practice of Software Development, pages 167-183, March 1989.
10. M. Fähndrich, J. Rehof, and M. Das. From polymorphic subtyping to CFL reachability: Context-sensitive flow analysis using instantiation constraints. Technical Report MSR-TR-99-84, Microsoft Research, 2000. Available at http://research.microsoft.com/~rehof/publications.html.
11. M. Fähndrich, J. Rehof, and M. Das. Scalable context-sensitive flow analysis using instantiation constraints. In Programming Language Design and Implementation, June 2000.
12. J. Gustavsson and J. Svenningsson. A usage analysis with bounded usage polymorphism and subtyping. In Proceedings of the 12th International Workshop on Implementation of Functional Languages, number AIB-00-7 in Aachener Informatik Berichte, pages 279-294. RWTH Aachen, 2000.
13. N. Heintze. Control-flow analysis and type systems. In Proceedings SAS '95, Second International Static Analysis Symposium, Glasgow, Scotland, pages 189-206. Springer Lecture Notes in Computer Science, vol. 983, September 1995.
14. Fritz Henglein. Type inference with polymorphic recursion. ACM Transactions on Programming Languages and Systems, 15(2):253-289, 1993.
15. Nevin Heintze and David McAllester. Linear-time subtransitive control flow analysis. In Proceedings of the 1997 ACM SIGPLAN Conference on Programming Language Design and Implementation, number 32:6 in SIGPLAN notices, pages 261-272, June 1997.
16. Susan Horwitz, Thomas Reps, and Mooly Sagiv. Demand interprocedural dataflow analysis. In ACM SIGSOFT Symposium on the Foundations of Software Engineering, ACM SIGSOFT Software Engineering Notes 20, 4, pages 104-115, 1995.
17. S. Kaes. Type inference in the presence of overloading, subtyping and recursive types. In Proc. Conf. on LISP and Functional Programming, 1992.
18. J.C. Mitchell. Foundations for Programming Languages. MIT Press, 1996.
19. Christian Mossin. Flow Analysis of Typed Higher-Order Programs. PhD thesis, DIKU, Department of Computer Science, University of Copenhagen, 1996.
20. Christian Mossin. Higher-order value flow graphs. Nordic Journal of Computing, 5:214-234, 1998.
21. David Melski and Thomas Reps. Interconvertibility of set constraints and context-free language reachability. In Proceedings PEPM, pages 74-89, 1997.
22. David Melski and Thomas Reps. Interconvertibility of set constraints and context-free language reachability. Theoretical Computer Science, 248, 2000. To appear.
23. A. Mycroft. Polymorphic type schemes and recursive definitions. In Proceedings of the 6th International Symposium on Programming, pages 217-228, 1984.
24. F. Nielson, H. Nielson, and C. Hankin. Principles of Program Analysis. Springer, 1999.
25. Robert O'Callahan and Daniel Jackson. Lackwit: A program understanding tool based on type inference. In International Conference on Software Engineering, May 1997.
26. Jens Palsberg and Patrick O'Keefe. A type system equivalent to flow analysis. Transactions on Programming Languages and Systems, 17(4):576-599, July 1995.
27. F. Pottier. Simplifying subtyping constraints. In International Conference on Functional Programming, 1996.
28. J. Rehof. Minimal typings in atomic subtyping. In Symposium on Principles of Programming Languages, 1997.
29. J. Rehof. The Complexity of Simple Subtyping Systems. PhD thesis, Dept. of Computer Science, University of Copenhagen, Denmark, April 1998.
30. Thomas Reps. Program analysis via graph reachability. Information and Software Technology, 40 (11-12):701-726, 1998.
31. Thomas Reps. Undecidability of context-sensitive data-dependence analysis. Transactions on Programming Languages and Systems, 2000. to appear.
32. Thomas Reps, Susan Horwitz, and Mooly Sagiv. Precise interprocedural dataflow analysis via graph reachability. In Symposium on Principles of Programming Languages (POPL), San Francisco, California, pages 49-61, 1995.
33. G. S. Smith. Principal type schemes for functional programs with overloading and subtyping. Science of Computer Programming, 23:197-226, 1994.
34. V. Trifonov and S. Smith. Subtyping constrained types. In Proceedings Static Analysis Symposium, Aachen, Germany, 1996. LNCS 1145.
35. Mihalis Yannakakis. Graph-theoretic methods in database theory. In Proceedings of the 9th ACM Symposium on Principles of Database Systems, pages 230-242, 1990.