Points-to Analysis for Java Using Annotated Constraints (2001)
Cached
Download Links
- [www.cs.rutgers.edu]
- [www.prolangs.rutgers.edu]
- [www.cs.rpi.edu]
- [prolangs.rutgers.edu]
- DBLP
Other Repositories/Bibliography
| Citations: | 84 - 23 self |
BibTeX
@INPROCEEDINGS{Rountev01points-toanalysis,
author = {Atanas Rountev and Ana Milanova and Barbara G. Ryder},
title = {Points-to Analysis for Java Using Annotated Constraints},
booktitle = {},
year = {2001},
pages = {43--55},
publisher = {ACM Press}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
The goal of points-to analysis for Java is to determine the set of objects pointed to by a reference variable or a reference object field. This information has a wide variety of client applications in optimizing compilers and software engineering tools. In this paper we present a points-to analysis for Java based on Andersen's points-to analysis for C [5]. We implement the analysis by using a constraint-based approach which employs annotated inclusion constraints. Constraint annotations allow us to model precisely and efficiently the semantics of virtual calls and the flow of values through object fields. By solving systems of annotated inclusion constraints, we have been able to perform practical and precise points-to analysis for Java.
