Points-to Analysis in Almost Linear Time

Points-to Analysis in Almost Linear Time (1996)

by Bjarne Steensgaard

Citations:

477 - 2 self

User correction supplied by mph

Datum	Value	Source
TITLE	Points-to Analysis in Almost Linear Time	user correction - Legacy Corrections
AUTHOR NAME	Bjarne Steensgaard	user correction
AUTHOR AFFIL	Microsoft Research	user correction
AUTHOR ADDR	One Microsoft Way; Redmond, WA 98052, USA	user correction
ABSTRACT	We present an interprocedural flow-insensitive points-to analysis based on type inference methods with an almost linear time cost complexity. To our knowledge, this is the asymptotically fastest non-trivial interprocedural points-to analysis algorithm yet described. The algorithm is based on a non-standard type system. The type inferred for any variable represents a set of locations and includes a type which in turn represents a set of locations possibly pointed to by the variable. The type inferred for a function variable represents a set of functions it may point to and includes a type signature for these functions. The results are equivalent to those of a flow-insensitive alias analysis (and control flow analysis) that assumes alias relations are reflexive and transitive. This work makes	user correction
YEAR	1996	INFERENCE
PAGES	32--41	INFERENCE
CITATIONS	24 found	ParsCit 1.0