Searching for points-to analysis

Abstract

The complexity of points-to analysis is well understood, but the approximations used to carry out points-to analysis efficiently are less well understood. In this paper we characterize points-to analysis as a reachability problem on a program's state space. Reachability analysis can be performed approximately but more efficiently for a program to which certain basic program transformations have been applied. We show the source of approximation and efficiency in several existing points-to analysis algorithms in terms of these generic program transformations.

BibTeX

@inproceedings{Bruns-Chandra:FSE02,
  author    = {Glenn Bruns and
               Satish Chandra},
  title     = {Searching for points-to analysis},
  booktitle = {FSE},
  pages     = {61--70},
  publisher = {{ACM}},
  year      = {2002},
}

Searching for points-to analysis

Abstract

Related papers