Static analyses for eliminating unnecessary synchronization from java programs (1999)

by Denver Applications, November PI J Aldrich CO, C Chambers, E Sirer, S Eggers
Venue:In Proceedings of the 6th International Static Analysis Symposium
Add To MetaCart
Results 1 - 1 of 1

Compositional Pointer and Escape Analysis for Java Programs

by John Whaley, Martin Rinard - In Proceedings of the 14th Annual Conference on Object-Oriented Programming Systems, Languages and Applications , 1999
"... algorithm for Java programs. The algorithm is based on the abstraction of points-to escape graphs, which characterize how local variables and elds in objects refer to other objects. Each points-to escape graph also contains escape information, which characterizes how objects allocated in one region ..."
Abstract - Cited by 211 (27 self) - Add to MetaCart
algorithm for Java programs. The algorithm is based on the abstraction of points-to escape graphs, which characterize how local variables and elds 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.