A posteriori environment analysis with Pushdown Delta CFA

We explore a novel approach to higher-order program analysis that brings ideas of on-demand lookup from first-order CFL-reachability program analyses to higher-order programs. The analysis needs to produce only a control-flow graph; it can derive all other information including values of variables directly from the graph. Several challenges had to be overcome, including how to build the control-flow graph on-the-fly and how to deal with non-local variables in functions. The resulting analysis is flow-and context-sensitive with a provable polynomial-time bound. The analysis is formalized and proved correct and terminating, and an initial implementation is described.

show abstract

Newly-single and loving it: improving higher-order must-alias analysis with heap fragments

Germane,

McCarthy

2021

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

Theories of higher-order must-alias analysis, often under the guise of environment analysis, provide deep behavioral insight. But these theories---in particular those that are most insightful otherwise---can reason about recursion only in limited cases. This weakness is not inherent to the theories but to the frameworks in which they're defined: machine models which thread the heap through evaluation. Since these frameworks allocate each abstract resource in the heap, the constituent theories of environment analysis conflate co-live resources identified in the abstract, such as recursively-created bindings. We present heap fragments as a general technique to allow these theories to reason about recursion in a general and robust way. We instantiate abstract counting in a heap-fragment framework and compare its performance to a precursor entire-heap framework. We also sketch an approach to realizing binding invariants, a more powerful environment analysis, in the heap-fragment framework.

show abstract

A posteriori environment analysis with Pushdown Delta CFA

Cited by 3 publications

References 13 publications

Relative Store Fragments for Singleton Abstraction

Relative Store Fragments for Singleton Abstraction

Higher-order Demand-driven Program Analysis

Newly-single and loving it: improving higher-order must-alias analysis with heap fragments

Contact Info

Product

Resources

About