Compositional pointer and escape analysis for Java programs
John Whaley, Martin Rinard · ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA) · 1999
This paper presents a combined pointer and escape analysis algorithm for Java programs. The algorithm is based on the abstraction of points-to escape graphs, which characterize how local variables and fields in objects refer to other objects. Each points-to escape graph also contains escape information, which characterizes how objects allocated in one region of the program can escape to be accessed by another region. The algorithm is designed to analyze arbitrary regions of complete or incomplete programs, obtaining complete information for objects that do not escape the analyzed regions.
Cited by 442 works. doi:10.1145/320384.320400
Authors
References
- Points-to analysis in almost linear time
- Efficient context-sensitive pointer analysis for C programs
- Context-sensitive interprocedural points-to analysis in the presence of function pointers
- Efficient context-sensitive pointer analysis for C programs
- A safe approximate algorithm for interprocedural aliasing
- Optimization of Object-Oriented Programs Using Static Class Hierarchy Analysis
- Efficient flow-sensitive interprocedural computation of pointer-induced aliases and side effects
- A safe approximate algorithm for interprocedural pointer aliasing
- The Jalapeño dynamic optimizing compiler for Java
- Escape analysis for Java