Back to Search
Start Over
Newly-single and loving it: improving higher-order must-alias analysis with heap fragments
- Source :
- Proceedings of the ACM on Programming Languages. 5:1-28
- Publication Year :
- 2021
- Publisher :
- Association for Computing Machinery (ACM), 2021.
-
Abstract
- 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.
- Subjects :
- Recursion
Computer science
Programming language
Thread (computing)
Conflation
computer.software_genre
Alias analysis
Sketch
Control flow analysis
Resource (project management)
TheoryofComputation_LOGICSANDMEANINGSOFPROGRAMS
Safety, Risk, Reliability and Quality
computer
Software
Heap (data structure)
Subjects
Details
- ISSN :
- 24751421
- Volume :
- 5
- Database :
- OpenAIRE
- Journal :
- Proceedings of the ACM on Programming Languages
- Accession number :
- edsair.doi...........76c01c7facc58a51bda57ba73e8317cc