Heap reference analysis using access graphs
Authors:
Open Access
- 1 November 2007
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Programming Languages and Systems
- Vol. 30 (1) , 1
Abstract
Despite significant progress in the theory and practice of program analysis, analyzing properties of heap data has not reached the same level of maturity as the analysis of static and stack data. The spatial and temporal structure of stack and static data is well understood while that of heap data seems arbitrary and is unbounded. We devise bounded representations that summarize properties of the heap data. This summarization is based on the structure of the program that manipulates the heap. The resulting summary representations are certain kinds of graphs called access graphs . The boundedness of these representations and the monotonicity of the operations to manipulate them make it possible to compute them through data flow analysis. An important application that benefits from heap reference analysis is garbage collection, where currently liveness is conservatively approximated by reachability from program variables. As a consequence, current garbage collectors leave a lot of garbage uncollected, a fact that has been confirmed by several empirical studies. We propose the first ever end-to-end static analysis to distinguish live objects from reachable objects. We use this information to make dead objects unreachable by modifying the program. This application is interesting because it requires discovering data flow information representing complex semantics. In particular, we formulate the following new analyses for heap data: liveness, availability, and anticipability and propose solution methods for them. Together, they cover various combinations of directions of analysis (i.e., forward and backward) and confluence of information (i.e. union and intersection). Our analysis can also be used for plugging memory leaks in C/C++ languages.Keywords
All Related Versions
This publication has 28 references indexed in Scilit:
- Escape analysis for Java TMACM Transactions on Programming Languages and Systems, 2003
- Establishing Local Temporal Heap Safety Properties with Applications to Compile-Time Memory Management2003
- Bidirectional data flow analysis for type inferencingComputer Languages, Systems & Structures, 2003
- On the usefulness of type and liveness accuracy for garbage collection and leak detectionACM Transactions on Programming Languages and Systems, 2002
- Estimating the impact of heap liveness information on space consumption in Java2002
- Understanding the connectivity of heap objects2002
- Combining region inference and garbage collection2002
- Interprocedural pointer alias analysisACM Transactions on Programming Languages and Systems, 1999
- Reducing garbage in JavaACM SIGPLAN Notices, 1998
- A region inference algorithmACM Transactions on Programming Languages and Systems, 1998