Using static single assignment form to improve flow-insensitive pointer analysis
- 1 May 1998
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGPLAN Notices
- Vol. 33 (5) , 97-105
- https://doi.org/10.1145/277652.277668
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Precise flow-insensitive may-alias analysis is NP-hardACM Transactions on Programming Languages and Systems, 1997
- Fast and accurate flow-insensitive points-to analysisPublished by Association for Computing Machinery (ACM) ,1997
- Points-to analysis in almost linear timePublished by Association for Computing Machinery (ACM) ,1996
- Combining analyses, combining optimizationsACM Transactions on Programming Languages and Systems, 1995
- A linear time algorithm for placing φ-nodesPublished by Association for Computing Machinery (ACM) ,1995
- Efficient accommodation of may-alias information in SSA formACM SIGPLAN Notices, 1993
- Efficiently computing static single assignment form and the control dependence graphACM Transactions on Programming Languages and Systems, 1991
- Pointer-induced aliasing: a problem taxonomyPublished by Association for Computing Machinery (ACM) ,1991
- A precise inter-procedural data flow algorithmPublished by Association for Computing Machinery (ACM) ,1981
- A unified approach to global program optimizationPublished by Association for Computing Machinery (ACM) ,1973