Higher-Order and Symbolic Computation

, Volume 19, Issue 4, pp 415–463

Deriving escape analysis by abstract interpretation


DOI: 10.1007/s10990-006-0481-5

Cite this article as:
Hill, P.M. & Spoto, F. Higher-Order Symb Comput (2006) 19: 415. doi:10.1007/s10990-006-0481-5


Escape analysis of object-oriented languages approximates the set of objects which do not escape from a given context. If we take a method as context, the non-escaping objects can be allocated on its activation stack; if we take a thread, Java synchronisation locks on such objects are not needed. In this paper, we formalise a basic escape domain \({\mathcal{E}}\) as an abstract interpretation of concrete states, which we then refine into an abstract domain \({\cal ER}\) which is more concrete than \({\mathcal{E}}\) and, hence, leads to a more precise escape analysis than \({\mathcal{E}}\). We provide optimality results for both \({\mathcal{E}}\) and \({\cal ER}\), in the form of Galois insertions from the concrete to the abstract domains and of optimal abstract operations. The Galois insertion property is obtained by restricting the abstract domains to those elements which do not contain garbage, by using an abstract garbage collector. Our implementation of \({\cal ER}\) is hence an implementation of a formally correct escape analyser, able to detect the stack allocatable creation points of Java (bytecode) applications.


Abstract interpretationDenotational semanticsGarbage collection

Copyright information

© Springer Science + Business Media, LLC 2006

Authors and Affiliations

  1. 1.University of LeedsUnited Kingdom
  2. 2.Università di VeronaItaly