Abstractions for recursive pointer data structures
Laurie Jane Hendren, Joseph Hummel, Alexandru Eugen Nicolau · Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation · 1992
Even though impressive progress has been made in the area of optimizing and parallelizing programs with arrays, the application of similar techniques to programs with pointer data structures has remained difficult. In this paper we introduce a new approach that leads to improved analysis and transformation of programs with recursively-defined pointer data structures.We discuss how an abstract data structure description can improve program analysis by presenting an analysis approach that combines an alias analysis technique, path matrix, with information available from an ADDS declaration. Given this improved alias analysis technique, we provide a concrete example of applying a software pipelining transformation to loops involving pointer data structures.
Cited by 102 works. doi:10.1145/143095.143138
Authors
References
- Compilers: Principles, Techniques, and Tools
- The design and analysis of spatial data structures
- A hierarchical O(N log N) force-calculation algorithm
- An Efficient Program for Many-Body Simulation
- The Structure of Computers and Computations
- Automatic translation of FORTRAN programs to vector form
- Advanced compiler optimizations for supercomputers
- Software pipelining
- Analysis of pointers and structures
- Program Improvement by Source-to-Source Transformation