DMCA
Points-to Analysis in Almost Linear Time (1996)
Cached
Download Links
- [www.cs.trinity.edu]
- [www-acaps.cs.mcgill.ca]
- [www.cs.colorado.edu]
- [ftp.research.microsoft.com]
- [www.cs.cornell.edu]
- DBLP
Other Repositories/Bibliography
| Citations: | 594 - 3 self |
BibTeX
@MISC{Steensgaard96points-toanalysis,
author = {Bjarne Steensgaard},
title = {Points-to Analysis in Almost Linear Time},
year = {1996}
}
Share
 |
 |
 |
 |
||
OpenURL
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
Keyphrases
points-to analysis almost linear time interprocedural flow-insensitive points-to analysis flow-insensitive alias analysis type inference method linear time cost complexity flow analysis alias relation type signature non-trivial interprocedural points-to analysis algorithm non-standard type system
