Dependence analysis for pointer variables
Susan Horwitz, Phil Pfeiffer, Thomas Reps · Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation · 1989
Our concern is how to determine data dependencies between program constructs in programming languages with pointer variables. We are particularly interested in computing data dependencies for languages that manipulate heap-allocated storage, such as Lisp and Pascal. We have defined a family of algorithms that compute safe approximations to the flow, output, and anti-dependencies of a program written in such a language. Our algorithms account for destructive updates to fields of a structure and thus are not limited to the cases where all structures are trees or acyclic graphs; they are applicable to programs that build cyclic structures.
Cited by 233 works. doi:10.1145/73141.74821
Authors
References
- Compilers: Principles, Techniques, and Tools
- Abstract interpretation
- Program Slicing
- The program dependence graph and its use in optimization
- Dependence graphs and compiler optimizations
- The Computer Science Department.
- The program dependence graph in a software development environment
- Dependence analysis for subscripted variables and its application to program transformations
- Flow analysis and optimization of LISP-like structures
- Detecting conflicts between structure accesses