Deriving escape analysis by abstract interpretation

DOI10.1007/s10990-006-0481-5zbMath1112.68020OpenAlexW1978776691MaRDI QIDQ857916

Patricia M. Hill, Fausto Spoto

Publication date: 5 January 2007

Published in: Higher-Order and Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10990-006-0481-5

zbMATH Keywords

Denotational semanticsGarbage collectionAbstract interpretation

Mathematics Subject Classification ID

Theory of programming languages (68N15) Semantics in the theory of computing (68Q55)

Cites Work

• The quotient of an abstract interpretation
• Constructive versions of Tarski's fixed point theorems
• Logic programs as compact denotations.
• Logical optimality of groundness analysis
• Coalgebras and monads in the semantics of Java
• A lattice-theoretical fixpoint theorem and its applications
• A Foundation of Escape Analysis*
• Graph-Based Algorithms for Boolean Function Manipulation
• Abstract interpretation and application to logic programs
• The s-semantics approach: Theory and applications
• Refining and compressing abstract domains
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Deriving escape analysis by abstract interpretation