Steensgaard's algorithm

Points-to 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 uses for the analysis.

References

  • Steensgaard, Bjarne (1996). "Points-to analysis in almost linear time" (PDF). POPL '96: Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages. New York, NY, USA: ACM. pp. 32–41. doi:10.1145/237721.237727. ISBN 0-89791-769-3.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.