New results on the computability and complexity of points--to analysis
- 15 January 2003
- conference paper
- Published by Association for Computing Machinery (ACM)
- Vol. 38 (1) , 115-125
- https://doi.org/10.1145/604131.604142
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- On the complexity of flow-sensitive dataflow analysesPublished by Association for Computing Machinery (ACM) ,2000
- 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
- Program decomposition for pointer aliasingPublished by Association for Computing Machinery (ACM) ,1996
- Points-to analysis in almost linear timePublished by Association for Computing Machinery (ACM) ,1996
- The undecidability of aliasingACM Transactions on Programming Languages and Systems, 1994
- Efficient flow-sensitive interprocedural computation of pointer-induced aliases and side effectsPublished by Association for Computing Machinery (ACM) ,1993
- Undecidability of static analysisACM Letters on Programming Languages and Systems, 1992
- The directed subgraph homeomorphism problemTheoretical Computer Science, 1980