Liberate Abstract Garbage Collection from the Stack by Decomposing the Heap

DOI10.1007/978-3-030-44914-8_8OpenAlexW3016756923MaRDI QIDQ5041093

Kimball Germane, Michael D. Adams

Publication date: 13 October 2022

Published in: Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-44914-8_8

zbMATH Keywords

control-flow analysispushdown systemsabstract garbage collection

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cites Work

• Definitional interpreters for higher-order programming languages
• An iterative construction of irreducible polynomials reducible modulo every prime
• Pushdown control-flow analysis for free
• Pushdown flow analysis with abstract garbage collection
• CFA2: a Context-Free Approach to Control-Flow Analysis
• CFA2: A Context-Free Approach to Control-Flow Analysis
• Introspective pushdown analysis of higher-order programs
• Abstracting abstract machines
• Improving flow analyses via ΓCFA

This page was built for publication: Liberate Abstract Garbage Collection from the Stack by Decomposing the Heap