Jump to content

Steensgaard's algorithm

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Hsinghc (talk | contribs) at 17:10, 5 October 2015 (Created page with ' == Points-to analysis in almost linear time == Points to-analysis Pointer_analysis is a very important technique used in code optimizations. Bjarne Steensg...'). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

== Points-to analysis in almost linear time == 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. Bjarne Steensgaard (1996). "Points-to Analysis in Almost Linear Time". {{cite journal}}: Cite journal requires |journal= (help); Text "Company -Microsoft Research, One Microsoft Way, Redmond" ignored (help), using evolutionary computing to generate and evaluate possible candidates for fixes. The former method is deterministic, while the latter is randomized.