On the non-approximability of points-to analysis

Acta Informatica

Volumn 38, Issue 8, 2002, Pages 587-598

  Chakaravarthy, Venkatesan T ^a   Horwitz, Susan ^a  

^a University of Wisconsin Madison   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTANT FACTORS; DYNAMIC MEMORY ALLOCATION; FLOW SENSITIVE; NON-APPROXIMABILITY; POINTER ANALYSIS; POINTS-TO ANALYSIS; PRECISE SOLUTIONS; PROGRAMMING ENVIRONMENT;

STATIC ANALYSIS; STORAGE ALLOCATION (COMPUTER);

PROGRAM COMPILERS;

EID: 33745925348     PISSN: 00015903     EISSN: 14320525     Source Type: Journal    
DOI: 10.1007/s00236-002-0081-8     Document Type: Article

References (8)

1. [GJ79] M.R. Garey, D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, 1979
2. [Hor97] S. Horwitz. Precise flow-insensitive alias analysis is NP-hard. ACM Transactions on Programming Languages and Systems, 19(1), January 1997
3. [Lan92a] W. Landi. Interprocedural Aliasing in the Presence of Pointers. PhD thesis, Rutgers University, January 1992
4. [Lan92b] W. Landi. Undecidability of static analysis. ACM Letters on Programming Languages and Systems, 1(4):323-337, 1992
5. +98] W. Landi, B.Ryder, P. Stocks, S. Zhang, R. Altucher. A schema for interprocedural side effect analysis with pointer aliasing. Technical Report DCS-TR-336, Department of Computer Science, Rutgers University, May 1998
6. [LR91] W. Landi, B.G. Ryder. Pointer induced aliasing: A problem classification. In ACM Symposium on Principles of Programming Languages, pages 93-103, January 1991
7. [Pap94] C. Papadimitriou. Computational Complexity. Addison Wesley Publishing Company, 1994
8. [Ram94] G. Ramalingam. The Undecidability of aliasing. ACM Transactions on Programming Languages and Systems, 16(5):1467-1471, 1994