The set constraint/CFL reachability connection in practice

Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)

Volumn 1, Issue , 2004, Pages 207-218

  Kodumal, John ^a   Aiken, Alex ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b Stanford University   (United States)

Author keywords

Context free language reachability; Flow analysis; Set constraints; Type qualifiers

Indexed keywords

COMPUTABILITY AND DECIDABILITY; COMPUTER AIDED ANALYSIS; COMPUTER PROGRAMMING; COMPUTER PROGRAMMING LANGUAGES; CONSTRAINT THEORY; GRAPH THEORY; OPTIMIZATION; SOFTWARE ENGINEERING;

CONTEXT-FREE LANGUAGE REACHABILITY; FLOW ANALYSIS; SET CONSTRAINTS; TYPE QUALIFIERS;

PROBLEM SOLVING;

EID: 8344270203     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/996841.996867     Document Type: Conference Paper

References (21)

1. A. Aiken and E. L. Wimmers. Solving Systems of Set Constraints. In Proceedings, Seventh Annual IEEE Symposium on Logic in Computer Science, pages 329-340, Santa Cruz, California, June 1992.
2. V. Choppella and C. T. Haynes. Source-tracking Unification. In F. Baader, editor, Automated Deduction - CADE-19, 19th International Conference on Automated Deduction Miami Beach, FL, USA, July 28 - August 2, 2003, Proceedings, volume 2741 of Lecture Notes in Computer Science, pages 458-472. Springer, 2003.
3. M. Das, B. Liblit, M. Fähndrich, and J. Rehof. Estimating the Impact of Scalable Pointer Analysis on Optimization. In SAS '01: The 8th International Static Analysis Symposium, Lecture Notes in Computer Science, Paris, France, July 16-18 2001. Springer-Verlag.
4. M. Fähndrich, J. S. Foster, Z. Su, and A. Aiken. Partial Online Cycle Elimination in Inclusion Constraint Graphs. In Proceedings of the 1998 ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 85-96, Montreal, Canada, June 1998.
5. J. S. Foster, M. Fähndrich, and A. Aiken. A Theory of Type Qualifiers. In Proceedings of the 1999 ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 192-203, Atlanta, Georgia, May 1999.
6. N. Heintze. Set Based Program Analysis. PhD dissertation, Carnegie Mellon University, Department of Computer Science, Oct. 1992.
7. N. Heintze and O. Tardieu. Demand-driven Pointer Analysis. In SIGPLAN Conference on Programming Language Design and Implementation, pages 24-34, 2001.
8. N. Heintze and O. Tardieu. Ultra-fast Aliasing Analysis Using CLA: A Million Lines of C Code in a Second. In SIGPLAN Conference on Programming Language Design and Implementation, pages 254-263, 2001.
9. S. Horwitz, T. Reps, and D. Binkley. Interprocedural Slicing Using Dependence Graphs. ACM Transactions on Programming Languages and Systems, 12(1):26-60, 1990.
10. S. Horwitz, T. Reps, and M. Sagiv. Demand Interprocedural Dataflow Analysis. In Proceedings of the 3rd ACM SIGSOFT Symposium on Foundations of Software Engineering, pages 104-115. ACM Press, 1995.
11. J. Kodumal. BANSHEE: A Toolkit for Building Constraint-Based Analyses. http://bane.cs.berkeley.edu/banshee.
12. D. Melski and T. Reps. Interconvertbility of Set Constraints and Context-Free Language Reachability. In Proceedings of the 1997 ACM SIGPLAN Symposium on Partial Evaluation and Semantics-based Program Manipulation, pages 74-89. ACM Press, 1997.
13. D. Melski and T. Reps. Interconvertibility of a Class of Set Constraints and Context-Free-Language Reachability. Theoretical Computer Science, 248:29-98, 2000.
14. C. Mossin. Flow Analysis of Typed Higher-Order Programs. PhD thesis, DIKU, Department of Computer Science, University of Copenhagen, 1996.
15. J. Rehof and M. Fähndrich. Type-Based Flow Analysis: From Polymorphic Subtyping to CFL-Reachability. In Proceedings of the 28th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 54-66, London, United Kingdom, Jan. 2001.
16. T. Reps. Shape Analysis as a Generalized Path Problem. In Proceedings of the 1995 ACM SIGPLAN Symposium on Partial Evaluation and Semantics-based Program manipulation, pages 1-11. ACM Press, 1995.
17. T. Reps. Program Analysis Via Graph Reachability. In Information and Software Technology, pages 701-726, 1998.
18. T. Reps, S. Horwitz, and M. Sagiv. Precise Interprocedural Dataflow Analysis via Graph Reachability. In Proceedings of the 22nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 49-61, San Francisco, California, Jan. 1995.
19. A. Rountev and S. Chandra. Off-line Variable Substitution for Scaling Points-to Analysis. In Proceedings of the ACM SIGPLAN 2000 conference on Programming language design and implementation, pages 47-56. ACM Press, 2000.
20. U. Shankar, K. Talwar, J. S. Foster, and D. Wagner. Detecting Format String Vulnerabilities with Type Qualifiers. In Proceedings of the 10th Usenix Security Symposium, Washington, D.C., Aug. 2001.
21. Z. Su, M. Fähndrich, and A. Aiken. Projection Merging: Reducing Redundancies in Inclusion Constraint Graphs. In Proceedings of the 27th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 81-95. ACM Press, 2000.