Pointer-induced aliasing: a problem taxonomy
William A. Landi, Barbara G. Ryder · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · 1991
A?iasing occurs at some program point during execution when two or more names exist for the same location. We have isolated various programming language mechanisms which create aliases. We have classified the complexity of the fllas problem induced by each mechanism alone and in combination, as AfP-hard, complement tip-hard, or polynomial (’P). We present our problem classification, give an overview of our proof that finding interprocedural aliases in the presence of single level pointers is in 7, and present a represent tive proof for the NP-hard problems.
Cited by 206 works. doi:10.1145/99583.99599
Authors
References
- Flow Analysis of Computer Programs
- An efficient way to find the side effects of procedure calls and the aliases of variables
- A precise inter-procedural data flow algorithm
- Analysis of pointers and structures
- Two approaches to interprocedural data flow analysis
- Detecting conflicts between structure accesses
- Dependence analysis for pointer variables
- Parallelizing programs with recursive data structures
- Interprocedural slicing using dependence graphs
- Data Flow Analysis in the Presence of Procedure Calls