m-CFA Exhibits Perfect Stack Precision
No abstract available.
DOI 10.1007/978-981-99-8311-7_14
Related papers
- Liberate Abstract Garbage Collection from the Stack by Decomposing the Heap ESOP 2020
- Pushdown control-flow analysis for free POPL 2016
- Trace-based control-flow analysis PLDI 2021
- A posteriori environment analysis with Pushdown Delta CFA POPL 2017
- Scalable propagation-based call graph construction algorithms OOPSLA 2000
- Return of CFA: call-site sensitivity can be superior to object sensitivity even for object-oriented programs POPL 2022
- Context-Sensitive Demand-Driven Control-Flow Analysis ESOP 2025
- From Polyvariant Flow Information to Intersection and Union Types POPL 1998