CFA2: A context-free approach to control-flow analysis

Logical Methods in Computer Science

Volumn 7, Issue 2, 2011, Pages

  Vardoulakis, Dimitrios ^a   Shivers, Olin ^a  

^a Northeastern University

Author keywords

Control ow analysis; Higher order languages; Pushdown models; Summarization

Indexed keywords

ABSTRACTING; CONTEXT FREE LANGUAGES; DATA FLOW ANALYSIS; FLOW GRAPHS;

CONTEXT-FREE; CONTROL-FLOW; CONTROL-FLOW ANALYSIS; CONTROL-OW ANALYSE; FLOW ANALYSIS; FUNCTION CALLS; FUNCTIONAL LANGUAGES; HIGHER-ORDER LANGUAGES; PUSHDOWN MODELS; SUMMARIZATION;

SEMANTICS;

EID: 79960444942     PISSN: None     EISSN: 18605974     Source Type: Journal    
DOI: 10.2168/LMCS-7(2:3)2011     Document Type: Article

References (31)

1. Ole Agesen. The Cartesian Product Algorithm: Simple and Precise Type Inference of Parametric Polymorphism. In European Conference on Object-Oriented Programming, pages 2-26, 1995.
2. Rajeev Alur, Michael Benedikt, Kousha Etessami, Patrice Godefroid, Thomas W. Reps, and Mihalis Yannakakis. Analysis of Recursive State Machines. Transactions on Programming Languages and Sys-tems, 27(4):786-818, 2005.
3. Ahmed Bouajjani, Javier Esparza, and Oded Maler. Reachability Analysis of Pushdown Automata: Application to Model-Checking. In International Conference on Concurrency Theory, pages 135-150, 1997.
4. Satish Chandra, Stephen J. Fink, and Manu Sridharan. Snugglebug: a powerful approach to weakest preconditions. In Programming Language Design and Implementation, pages 363-374, 2009.
5. Swarat Chaudhuri. Subcubic Algorithms for Recursive State Machines. In Principles of Programming Languages, pages 159-169, 2008.
6. William D. Clinger and Lars Thomas Hansen. Lambda, the Ultimate Label or a Simple Optimizing Compiler for Scheme. In LISP and Functional Programming, pages 128-139, 1994.
7. Saumya K. Debray and Todd A. Proebsting. Interprocedural Control Flow Analysis of First-Order Programs with Tail-Call Optimization. Transactions on Programming Languages and Systems, 19(4):568-585, 1997.
8. Christopher Earl, Matthew Might, and David Van Horn. Pushdown Control-Flow Analysis of Higher- Order Programs. In Workshop on Scheme and Functional Programming, 2010.
9. Manuel Fähndrich and Jakob Rehof. Type-based ow analysis and context-free language reachability. Mathematical Structures in Computer Science, 18(5):823-894, 2008.
10. Alain Finkel, Bernard Willems, and Pierre Wolper. A direct symbolic approach to model checking pushdown systems. Electronic Notes in Theoretical Computer Science, 9, 1997.
11. Cormac Flanagan, Amr Sabry, Bruce F. Duba, and Matthias Felleisen. The Essence of Compiling with Continuations. In Programming Language Design and Implementation, pages 237-247, 1993.
12. Jöorgen Gustavsson and Josef Svenningsson. Constraint Abstractions. In Programs as Data Objects, pages 63-83, 2001.
13. Nevin Heintze. Set-based program analysis. PhD thesis, Carnegie-Mellon Univ., 1992.
14. Michael Hind. Pointer analysis: haven't we solved this problem yet? In Program Analysis For Software Tools and Engineering, pages 54-61, 2001.
15. Naoki Kobayashi. Types and higher-order recursion schemes for verification of higher-order programs. In Principles of Programming Languages, pages 416-428, 2009.
16. David Kranz. ORBIT: An Optimizing Compiler for Scheme. PhD thesis, Yale University, 1988.
17. David Melski and Thomas Reps. Interconvertibility of a Class of Set Constraints and Context-Free Language Reachability. Theoretical Comp. Sci., 248(1/2):29-98, 2000.
18. Jan Midtgaard and Thomas Jensen. Control-ow analysis of function calls and returns by abstract interpretation. In International Conference on Functional Programming, pages 287-298, 2009.
19. Matthew Might. Environment Analysis of Higher-Order Languages. PhD thesis, Georgia Institute of Technology, 2007.
20. Matthew Might and Olin Shivers. Improving Flow Analyses via ΓCFA: Abstract Garbage Collection and Counting. In International Conference on Functional Programming, pages 13-25, 2006.
21. Christian Mossin. Flow Analysis of Typed Higher-Order Programs. PhD thesis, DIKU, Department of Computer Science, University of Copenhagen, 1996.
22. Jakob Rehof and Manuel Fähndrich. Type-Based Flow Analysis: From Polymorphic Subtyping to CFL-Reachability. In Principles of Programming Languages, pages 54-66, 2001.
23. Thomas W. Reps, Susan Horwitz, and Shmuel Sagiv. Precise Interprocedural Dataow Analysis via Graph Reachability. In Principles of Programming Languages, pages 49-61, 1995.
24. Amr Sabry and Matthias Felleisen. Reasoning About Programs in Continuation-Passing Style. In LISP and Functional Programming, pages 288-298, 1992.
25. Micha Sharir and Amir Pnueli. Two Approaches to Interprocedural Data Flow Analysis. In Program Flow Analysis, Theory and Application. Prentice Hall, 1981.
26. Olin Shivers. Control-Flow Analysis of Higher-Order Languages. PhD thesis, Carnegie-Mellon University, 1991.
27. Olin Shivers. Higher-Order Control-Flow Analysis in Retrospect: Lessons Learned, Lessons Abandoned. In Best of PLDI, pages 257-269, 2004.
28. Manu Sridharan and Rastislav Bodfifik. Refinement-based context-sensitive points-to analysis for Java. In Programming Language Design and Implementation, pages 387-400, 2006.
29. Guy L. Steele. Rabbit: A Compiler for Scheme. Master's thesis, MIT, 1978.
30. David Van Horn and Harry G. Mairson. Deciding k-CFA is complete for EXPTIME. In International Conference on Functional Programming, pages 275-282, 2008.
31. Andrew Wright and Suresh Jagannathan. Polymorphic Splitting: An Efiective Polyvariant Flow Analysis. Transactions on Programming Languages and Systems, 20(1):166-207, 1998.