DMCA
Compositional Pointer and Escape Analysis for Java Programs (1999)
Cached
Download Links
- [www.stanford.edu]
- [www.cs.drexel.edu]
- [rw4.cs.uni-saarland.de]
- [people.cs.clemson.edu]
- [people.cs.clemson.edu]
- [www.cag.lcs.mit.edu]
- [catfish.csail.mit.edu]
- [www.cag.csail.mit.edu]
- [cag.csail.mit.edu]
- [people.csail.mit.edu]
- [www.cag.lcs.mit.edu]
- [www.cag.lcs.mit.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | In Proceedings of the 14th Annual Conference on Object-Oriented Programming Systems, Languages and Applications |
| Citations: | 266 - 29 self |
BibTeX
@INPROCEEDINGS{Whaley99compositionalpointer,
author = {John Whaley and Martin Rinard},
title = {Compositional Pointer and Escape Analysis for Java Programs},
booktitle = {In Proceedings of the 14th Annual Conference on Object-Oriented Programming Systems, Languages and Applications},
year = {1999},
pages = {187--206},
publisher = {ACM Press}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
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.
