Exploiting pointer and location equivalence to optimize pointer analysis

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4634 LNCS, Issue , 2007, Pages 265-280

  Hardekopf, Ben ^a   Lin, Calvin ^a  

^a UNIVERSITY OF TEXAS AT AUSTIN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

C (PROGRAMMING LANGUAGE); CODES (SYMBOLS); OPTIMIZATION; STATIC ANALYSIS;

MEMORY CONSUMPTION; OPTIMIZE POINTER ANALYSIS; POINTER INFORMATION;

COMPUTER SOFTWARE;

EID: 38149084134     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74061-2_17     Document Type: Conference Paper

References (16)

1. Andersen, L.O.: Program Analysis and Specialization for the C Programming anguage. PhD thesis, DIKU, University of Copenhagen (May 1994)
2. Berndl, M., Lhotak, O., Qian, F., Hendren, L., Umanee, N.: Points-to analysis using BDDs. In: Programming Language Design and Implementation (PLDI), pp. 103-114 (2003)
3. Briggs, P., Cooper, K.D., Taylor Simpson, L.: Value numbering. Software Practice and Experience 27(6), 701-724 (1997)
4. Das, M.: Unification-based pointer analysis with directional assignments. In: Programming Language Design and Implementation (PLDI), pp. 35-46 (2000)
5. Faehndrich, M., Foster, J.S., Su, Z., Aiken, A.: Partial online cycle elimination in inclusion constraint graphs. In: Programming Language Design and Implementation (PLDI), pp. 85-96 (1998)
6. Hardekopf, B., Lin, C.: The Ant and the Grasshopper: Fast and accurate pointer analysis for millions of lines of code. In: Programming Language Design and Implementation (PLDI) (2007)
7. Heintze, N., Tardieu, O.: Ultra-fast aliasing analysis using CLA: A million lines of C code in a second. In: Programming Language Design and Implementation (PLDI), pp. 24-34 (2001)
8. Liang, D., Harrold, M.J.: Equivalence analysis and its application in improving the efficiency of program slicing. ACM Trans. Softw. Eng. Methodol. 11(3), 347-383 (2002)
9. Necula, G.C., McPeak, S., Rahul, S.P., Weimer, W.: CIL: Intermediate language and tools for analysis and transformation of C programs. In: Computational Complexity, pp. 213-228 (2002)
10. Pearce, D., Kelly, P., Hankin, C.: Efficient field-sensitive pointer analysis for C. In: ACM workshop on Program Analysis for Software Tools and Engineering (PASTE), pp. 37-42. ACM Press, New York (2004)
11. Pearce, D.J., Kelly, P.H.J., Hankin, C.: Online cycle detection and difference propagation for pointer analysis. In: 3rd International IEEE Workshop on Source Code Analysis and Manipulation (SCAM), pp. 3-12. IEEE Computer Society Press, Los Alamitos (2003)
12. Rountev, A., Chandra, S.: Off-line variable substitution for scaling points-to analysis. In: Programming Language Design and Implementation (PLDI), pp. 47-56 (2000)
13. Shapiro, M., Horwitz, S.: Fast and accurate flow-insensitive points-to analysis. In: ACM Symposium on Principles of Programming Languages (POPL), pp. 1-14. ACM Press, New York (1997)
14. Steensgaard, B.: Points-to analysis in almost linear time. In: ACM Symposium on Principles of Programming Languages (POPL), pp. 32-41. ACM Press, New York (1996)
15. Tarjan, R.: Depth-first search and linear graph algorithms. SIAM J. Comput. 1(2), 146-160 (June 1972)
16. Whaley, J., Lam, M.S.: Cloning-based context-sensitive pointer alias analysis. In: Programming Language Design and Implementation (PLDI), pp. 131-144 (2004)