Computer Science – Programming Languages
Scientific paper
2010-07-24
Computer Science
Programming Languages
The 2010 Workshop on Scheme and Functional Programming
Scientific paper
Context-free approaches to static analysis gain precision over classical approaches by perfectly matching returns to call sites---a property that eliminates spurious interprocedural paths. Vardoulakis and Shivers's recent formulation of CFA2 showed that it is possible (if expensive) to apply context-free methods to higher-order languages and gain the same boost in precision achieved over first-order programs. To this young body of work on context-free analysis of higher-order programs, we contribute a pushdown control-flow analysis framework, which we derive as an abstract interpretation of a CESK machine with an unbounded stack. One instantiation of this framework marks the first polyvariant pushdown analysis of higher-order programs; another marks the first polynomial-time analysis. In the end, we arrive at a framework for control-flow analysis that can efficiently compute pushdown generalizations of classical control-flow analyses.
Earl Christopher
Horn David Van
Might Matthew
No associations
LandOfFree
Pushdown Control-Flow Analysis of Higher-Order Programs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Pushdown Control-Flow Analysis of Higher-Order Programs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Pushdown Control-Flow Analysis of Higher-Order Programs will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-369204