Which pointer analysis should I use?
Michael Hind, Anthony Pioli · ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA) · 2000
During the past two decades many different pointer analysis algorithms have been published. Although some descriptions include measurements of the effectiveness of the algorithm, qualitative comparisons among algorithms are difficult because of varying infrastructure, benchmarks, and performance metrics. Without such comparisons it is not only difficult for an implementor to determine which pointer analysis is appropriate for their application, but also for a researcher to know which algorithms should be used as a basis for future advances.
Cited by 190 works. doi:10.1145/347324.348916
Authors
References
- Lecture Notes in Computer Science 1205
- Advanced Compiler Design and Implementation
- Points-to analysis in almost linear time
- Constant propagation with conditional branches
- A Survey of Program Slicing Techniques.
- Efficient context-sensitive pointer analysis for C programs
- Context-sensitive interprocedural points-to analysis in the presence of function pointers
- Efficient context-sensitive pointer analysis for C programs
- A safe approximate algorithm for interprocedural aliasing
- Efficient flow-sensitive interprocedural computation of pointer-induced aliases and side effects