Interprocedural pointer alias analysis
Michael Hind, Michael Burke, Paul R. Carini et al. · ACM Transactions on Programming Languages and Systems · 1999
We present practical approximation methods for computing and representing interprocedural aliases for a program written in a language that includes pointers, reference parameters, and recursion. We present the following contributions: (1) a framework for interprocedural pointer alias analysis that handles function pointers by constructing the program call graph while alias analysis is being performed; (2) a flow-sensitive interprocedural pointer alias analysis algorithm; (3) a flow-insensitive interprocedural pointer alias analysis algorithm; (4) a flow-insensitive interprocedural pointer alias analysis algorithm that incorporates kill information to improve precision; (5) empirical measurements of the efficiency and precision of the three interprocedural alias analysis algorithms.
Cited by 225 works. doi:10.1145/325478.325519 Open-access PDF
Authors
References
- Lecture Notes in Computer Science 1205
- Compilers: Principles, Techniques, and Tools
- Efficiently computing static single assignment form and the control dependence graph
- A Fast and Usually Linear Algorithm for Global Flow Analysis
- Global Data Flow Analysis and Iterative Algorithms
- Points-to analysis in almost linear time
- Constant propagation with conditional branches
- An efficient way to find the side effects of procedure calls and the aliases of variables
- The Transitive Reduction of a Directed Graph
- Analysis of pointers and structures