Making context-sensitive points-to analysis with heap cloning practical for the real world

ACM SIGPLAN Notices

Volumn 42, Issue 6, 2007, Pages 278-289

  Lattner, Chris ^a   Lenharth, Andrew ^b   Adve, Vikram ^b  

^a APPLE INC   (United States)

^b UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

Context sensitive; Field sensitive; Interprocedural; Pointer analysis; Recursive data structure; Static analysis

Indexed keywords

CLONE CELLS; CODES (SYMBOLS); COMPUTER OPERATING SYSTEMS; FLOW GRAPHS; GENETIC ENGINEERING; PRECISION ENGINEERING; STATIC ANALYSIS;

CONTEXT SENSITIVE; FIELD SENSITIVES; INTER-PROCEDURAL; POINTER ANALYSIS; RECURSIVE DATA STRUCTURES;

C (PROGRAMMING LANGUAGE);

EID: 67650035439     PISSN: 15232867     EISSN: None     Source Type: Journal    
DOI: 10.1145/1273442.1250766     Document Type: Article

References (35)

1. LLVM Link Time Optimization: Design and Implementation. http://llvm.org/docs/LinkTimeOptimization.html.
2. L.O. Andersen. Program Analysis and Specialization for the C Programming Language. PhD thesis, DIKU, University of Copenhagen, May 1994.
3. B.-C. Cheng and W. mei Hwu. Modular interprocedural pointer analysis using access paths: Design, implementation, and evaluation. In PLDI, Vancouver, British Columbia, Canada, June 2000.
4. S. Chong and R. Rugina. Static analysis of accessed regions in recursive data structures. In SAS, 2003.
5. M. Das. Unification-based pointer analysis with directional assignments. In PLDI, pages 35-46, 2000.
6. M. Das, B. Liblit, M. Fähndrich, and J. Rehof. Estimating the impact of scalable pointer analysis on optimization. In SAS, 2001.
7. A. Deutsch. Interprocedural may-alias analysis for pointers: Beyond k-limiting. In PLDI, pages 230-241, June 1994.
8. D. Dhurjati, S. Kowshik, and V. Adve. SAFECode: Enforcing alias analysis for weakly typed languages. In PLDI, June 2006.
9. D. Dhurjati, S. Kowshik, V. Adve, and C. Lattner. Memory safety without garbage collection for embedded applications. ACM Trans. on Embedded Computing Systems, Feb. 2005.
10. M. Emami, R. Ghiya, and L. J. Hendren. Context-sensitive interprocedural points-to analysis in the presence of function pointers. In PLDI, pages 242-256, Orlando, FL, June 1994.
11. M. Fähndrich, J. Rehof, and M. Das. Scalable context-sensitive flow analysis using instantiation constraints. In PLDI, 2000.
12. J. S. Foster, M. Fähndrich, and A. Aiken. Polymorphic versus monomorphic flow-insensitive points-to analysis for c. In Proc. Int'l Symp. on Static Analysis (SAS), London, UK, 2000.
13. R. Ghiya and L. J. Hendren. Connection analysis: A practical interprocedural heap analysis for C. International Journal of Parallel Programming, 24(6):547-578, 1996.
14. R. Ghiya and L. J. Hendren. Is it a tree, a DAG, or a cyclic graph? A shape analysis for heap-directed pointers in C. In POPL, 1996.
15. R. Ghiya, D. Lavery, and D. Sehr. On the importance of points-to analysis and other memory disambiguation methods for C programs. In PLDI, 2001.
16. B. Hackett and R. Rugina. Region-based shape analysis with tracked locations. In POPL, pages 310-323, New York, NY, USA, 2005.
17. M. Hind. Pointer analysis: Haven't we solved this problem yet? In PASTE, 2001.
18. C. Lattner. Macroscopic Data Structure Analysis and Optimization. PhD thesis, Comp. Sci. Dept., Univ. of Illinois, Urbana, IL, May 2005.
19. C. Lattner and V. Adve. LLVM: A Compilation Framework for Lifelong Program Analysis and Transformation. In Int'l Symp. on Code Generation and Optimization, Mar 2004.
20. C. Lattner and V. Adve. Automatic pool allocation: Improving performance by controlling data structure layout in the heap. In PLDI, Chicago, IL, Jun 2005.
21. C. Lattner and V. Adve. Transparent Pointer Compression for Linked Data Structures. In MSP, Chicago, IL, Jun 2005.
22. D. Liang and M. J. Harrold. Efficient points-to analysis for whole-program analysis. In ESEC, 1999.
23. D. Liang and M. J. Harrold. Efficient computation of parameterized pointer information for interprocedural analysis. In SAS 2001, July 2001.
24. P. Meredith, B. Pankaj, S. Sahoo, C. Lattner, and V. Adve. How successful is data structure analysis in isolating and analyzing linked data structures? Tech. Report UIUCDCS-R-2005-2658, Computer Science Dept., Univ. of Illinois at Urbana-Champaign, Nov 2005.
25. E. M. Nystrom, H.-S. Kim, and W. mei W. Hwu. Bottom-up and top-down context-sensitive summary-based pointer analysis. In SAS 2004, 2004.
26. E. M. Nystrom, H.-S. Kim, and W. mei W. Hwu. Importance of heap specialization in pointer analysis. In Proc. ACM SIGPLAN-SIGSOFT Workshop on Program Analysis for Software Tools and Engineering (PASTE), pages 43-48, New York, NY, USA, 2004.
27. R. O'Callahan and D. Jackson. Lackwit: a program understanding tool based on type inference. In ICSE '97: Proceedings of the 19th international conference on Software engineering, pages 338-348, New York, NY, USA, 1997. ACM Press.
28. E. Ruf. Effective synchronization removal for java. In PLDI, pages 208-218, 2000.
29. M. Sagiv, T. Reps, and R. Wilhelm. Solving shape-analysis problems in languages with destructive updating. TOPLAS, 20(1), Jan. 1998.
30. B. Steensgaard. Points-to analysis by type inference of programs with structures and unions. In Compiler Construction, pages 136-150, London, UK, 1996.
31. B. Steensgaard. Points-to analysis in almost linear time. In POPL, 1996.
32. R. E. Tarjan. Efficiency of a good but not linear set union algorithm. J. ACM, 22(2):215-225, 1975.
33. F. Vivien and M. Rinard. Incrementalized pointer and escape analysis. In PLDI, pages 35-46, 2001.
34. J. Whaley and M. S. Lam. Cloning-based context-sensitive pointer alias analysis using binary decision diagrams. In PLDI, 2004.
35. R. P. Wilson and M. S. Lam. Effective context sensitive pointer analysis for C programs. In PLDI, pages 1-12, June 1995.