Efficient points-to analysis for whole-program analysis
- 1 October 1999
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGSOFT Software Engineering Notes
- Vol. 24 (6) , 199-215
- https://doi.org/10.1145/318774.318943
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Relevant context inferencePublished by Association for Computing Machinery (ACM) ,1999
- Effective whole-program analysis in the presence of pointersPublished by Association for Computing Machinery (ACM) ,1998
- Program decomposition for pointer aliasingPublished by Association for Computing Machinery (ACM) ,1996
- Separate computation of alias information for reuseIEEE Transactions on Software Engineering, 1996
- Points-to analysis in almost linear timePublished by Association for Computing Machinery (ACM) ,1996
- Efficient context-sensitive pointer analysis for C programsPublished by Association for Computing Machinery (ACM) ,1995
- Context-sensitive interprocedural points-to analysis in the presence of function pointersPublished by Association for Computing Machinery (ACM) ,1994
- Efficient computation of interprocedural definition-use chainsACM Transactions on Programming Languages and Systems, 1994
- A safe approximate algorithm for interprocedural aliasingPublished by Association for Computing Machinery (ACM) ,1992
- Interprocedural slicing using dependence graphsACM Transactions on Programming Languages and Systems, 1990