Searching for points-to analysis

@inproceedings{Bruns2002SearchingFP,
  title={Searching for points-to analysis},
  author={Glenn Bruns and Satish Chandra},
  booktitle={SIGSOFT FSE},
  year={2002}
}
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… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-3 of 3 references

Interprocedural pointer alias analysis

ACM Trans. Program. Lang. Syst. • 1999
View 5 Excerpts
Highly Influenced