Computer Science – Programming Languages
Scientific paper
2010-09-08
Computer Science
Programming Languages
Scientific paper
Two sinks drain precision from higher-order flow analyses: (1) merging of argument values upon procedure call and (2) merging of return values upon procedure return. To combat the loss of precision, these two sinks have been addressed independently. In the case of procedure calls, abstract garbage collection reduces argument merging; while in the case of procedure returns, context-free approaches eliminate return value merging. It is natural to expect a combined analysis could enjoy the mutually beneficial interaction between the two approaches. The central contribution of this work is a direct product of abstract garbage collection with context-free analysis. The central challenge to overcome is the conflict between the core constraint of a pushdown system and the needs of garbage collection: a pushdown system can only see the top of the stack, yet garbage collection needs to see the entire stack during a collection. To make the direct product computable, we develop "stack summaries," a method for tracking stack properties at each control state in a pushdown analysis of higher-order programs.
Earl Christopher
Horn David Van
Might Matthew
No associations
LandOfFree
Stack-Summarizing 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 Stack-Summarizing 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 Stack-Summarizing Control-Flow Analysis of Higher-Order Programs will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-33037