Deriving Escape Analysis by Abstract Interpretation

Title
Publication TypeJournal Article
Year of Publication2006
AuthorsHill PM, Spoto F
JournalHigher-Order and Symbolic Computation
Volume19
Pagination415–463
ISSN1388-3690
Keywordsabstract interpretation, escape analysis, Java, object-oriented languages, software verification, static analysis
Abstract

Escape analysis of object-oriented languages determines, for every program point, the creation points of the objects reachable from the variables. This information allows us to stack allocate dynamically created objects and to reduce the overhead of synchronisation in Java-like languages. In this paper, we formalise the escape property E, computed by an escape analysis, as an abstract interpretation of concrete states. We show that it interacts with the static type information and with the late-binding mechanism. A static analysis based on the domain E can only be very imprecise. Therefore, we define a refinement ER of E, in the sense that ER is more concrete than E and, hence, leads to a more precise escape analysis than E. Our implementation of ER is a formally correct escape analyser, able to detect the stack allocatable creation points of middle-size Java (bytecode) applications.

DOI10.1007/s10990-006-0481-5
We are a passionate team of experts. Do not hesitate to let us have your feedback:
You may be surprised to discover just how much your suggestions matter to us.