Scalable context-sensitive flow analysis using instantiation constraints

SIGPLAN Notices (ACM Special Interest Group on Programming Languages)

Volumn 35, Issue 5, 2000, Pages 253-263

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

^a MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 17144404606     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/358438.349332     Document Type: Article

References (22)

1. A. V. Aho, R. Sethi, and J. D. Ullman. Compilers Principles, Techniques, and Tools. Addison Wesley, 1988.
2. Jong-Deok Choi, Manish Gupta, Mauricio Serrano, Vugranam C. Sreedhar, and Sam Midkiff. Escape analysis for java. In OOPSLA'99 [OOP99], pages 1-19.
3. Ramkrishna Chatterjee, Barbara G. Ryder, and William A. Landi. Relevant context inference. In Conference Record of the 26th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, January 1999.
4. L. Damas and R. Milner. Principle type-schemes for functional programs. In Conference Record of the 9th Annual ACM Symposium on Principles of Programming Languages, pages 207-212, January 1982.
5. Jeffrey S. Foster, Manuel Fahndrich, and Alexander Aiken. Polymorphic versus monomorphic points-to analysis. In Proceedings of the 7th International Static Analysis Symposium, Lecture Notes in Computer Science. Springer Verlag, June 2000.
6. Manuel Fähndrich, Jakob Rehof, and Manuvir Das. From polymorphic subtyping to CFL reachability: Context-sensitive flow analysis using instantiation constraints. Technical Report MSRTR-99-84, Microsoft Research, March 2000.
7. Fritz Henglein. Type inference with polymorphic recursion. ACM Transactions on Programming Languages and Systems, 15(2):253-289, 1993.
8. 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.
9. Suresh Jagannathan and Andrew Wright. Effective flow analysis for avoiding run-time checks. In Proceedings of the 2nd International Static Analysis Symposium, volume 983 of Lecture Notes in Computer Science, pages 207-224. Springer Verlag, September 1995.
10. A. J. Kfoury, J. Tiuryn, and P. Urzyczyn. The undecidability of the semi-unification problem. Information and Computation, 102(1):83-101, January 1993.
11. A. J. Kfoury, J. Tiuryn, and P. Urzyczyn. An analysis of ML typability. Journal of the ACM, 41(2):368-398, March 1994.
12. Donglin Liang and Mary Jean Harrold. Efficient points-to analysis for whole-program analysis. In Proceedings of the 7th European Software Engineering Conference and the 7th ACM SIGSOFT Symposium on the Foundations of Software Engineering, September 1999.
13. R. Milner. A theory of type polymorphism in programming. Journal of Computer and System Sciences, 17:348-375, 1978.
14. David Melski and Thomas Reps. Interconvertibility of set constraints and context-free language reachability. In Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation (PEPM-97), volume 32, 12 of ACM SIGPLAN Notices, pages 74-89. ACM Press, June 1997.
15. A. Mycroft. Polymorphic type schemes and recursive definitions. In Proceedings of the 6th International Symposium on Programming, pages 217-228, 1984.
16. Flemming Nielson and Hanne Riis Nielson. Infinitary control flow analysis: a collecting semantics for closure analysis. In Conference Record of the 24th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 332-345. ACM Press, January 1997.
17. Robert O'Callahan and Daniel Jackson. Lackwit: A program understanding tool based on type inference. In International Conference on Software Engineering, May 1997.
18. Proceedings of 14th Annual Conference on Object-Oriented Programming, Systems, Languages, and Applications, volume 34, 10 of ACM SIGPLAN Notices. ACM Press, November 1999.
19. Thomas Reps, Susan Horwitz, and Mooly Sagiv. Precise interprocedural dataflow analysis via graph reachability. In Conference record of POPL '95, 22nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages: papers presented at the Symposium: San Francisco, California, January 22-25, 1995, pages 49-61, 1995.
20. Bjarne Steensgaard. Points-to analysis in almost linear time. In Conference Record of the 23rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 32-41, January 1996.
21. Robert P. Wilson and Monica S. Lam. Efficient context-sensitive pointer analysis for c programs. In Proceedings of the 1995 ACM SIGPLAN Conference on Programming Language Design and Implementation, number 30:6 in SIGPLAN notices, June 1995.
22. John Whaley and Martin Rinard. Compositional pointer and escape analysis for java programs. In OOPSLA'99 [OOP99], pages 187-206.