Precise Flow-Insensitive May-Alias Analysis is NP-Hard

ACM Transactions on Programming Languages and Systems

Volumn 19, Issue 1, 1997, Pages 1-6

  Horwitz, Susan ^a,b  

^a UNIVERSITY OF WISCONSIN MADISON   (United States)

^b University of Wisconsin Madison   (United States)

Author keywords

D.3.4 Programming Languages : Processors compilers; optimization; F.4.1 Mathematical Logic and Formal Languages : Mathematical logic computability theory; F.4.3 Mathematical Logic and Formal Languages : Formal Languages decision problems

Indexed keywords

COMPUTATION THEORY; COMPUTER PROGRAMMING LANGUAGES; FORMAL LANGUAGES; FORMAL LOGIC; OPTIMIZATION; PROGRAM COMPILERS; PROGRAM PROCESSORS; PROGRAMMING THEORY;

AVAILABLE EXPRESSIONS; CONSTANT PROPAGATION; LIVE VARIABLES; PRECISE FLOW INSENSITIVE MAY ALIAS ANALYSIS; STATIC ANALYSIS;

COMPUTATIONAL COMPLEXITY;

EID: 0030777732     PISSN: 01640925     EISSN: None     Source Type: Journal    
DOI: 10.1145/239912.239913     Document Type: Article

References (7)

1. ANDERSEN, L. O. 1994. Program analysis and specialization for the C programming language. Ph.D. thesis, DIKU Rep. 94/19, DIKU, Univ. of Copenhagen, Denmark.
2. BURKE, M., CARINI, P., CHOI, J., AND HIND, M. 1994. Flow-insensitive interprocedural alias analysis in the presence of pointers. In Languages and Compilers for Parallel Computing: Proceedings of the 7th International Workshop, K. Pingali, U. Banerjee, D. Galernter, A. Nicolau, and D. Padua, Eds. Lecture Notes in Computer Science, vol. 892. Springer-Verlag, Berlin, 234-250.
3. GAREY, M. AND JOHNSON, D. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman.
4. LANDI, W. 1992. Undecidability of static analysis. ACM Lett. Program. Lang. Syst. 1, 4, 323-337.
5. LANDI, W. AND RYDER, B. 1991. Pointer induced aliasing: A problem classification. In the ACM Symposium on Principles of Programming Languages. ACM, New York, 93-103.
6. RAMALINGAM, G. 1994. The undecidability of aliasing. ACM Trans. Program. Lang. Syst. 16, 5, 1467-1471.
7. STEENSGAARD, B. 1996. Points-to analysis in almost linear time. In the ACM Symposium on Principles of Programming Languages. ACM, New York, 32-41.