Jump to content

Steensgaard's algorithm

Add links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by David Eppstein (talk | contribs) at 05:47, 16 October 2015 (Unprod. There really are a couple of thousand cites for the source paper on google scholar. See https://scholar.google.com/scholar?cluster=12915004325115148081). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Points to-analysis Pointer analysis is a very important technique used in code optimizations. Bjarne Steensgaard presented an idea of reducing points-to analysis to type inference and type checking, thereby modeling a linear space and almost linear time algorithm for points-to set computation.

Steensgaard proposed the points-to analysis for a small imperative but generic pointer language which captures the essential properties of other common pointer languages like C. He has proposed language semantics and typing rules which he use for the analysis.

References

  • Steensgaard, Bjarne (1996), "Points-to analysis in almost linear time", Proceedings of the 23rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL '96), New York, NY, USA: ACM, pp. 32–41, doi:10.1145/237721.237727, ISBN 0-89791-769-3.
Retrieved from "https://en.wikipedia.org/w/index.php?title=Steensgaard%27s_algorithm&oldid=685979441"