Steensgaard's algorithm


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.