Semi-sparse flow-sensitive pointer analysis

ACM SIGPLAN Notices

Volumn 44, Issue 1, 2009, Pages 226-238

  Hardekopf, Ben ^a   Lin, Calvin ^a  

^a UNIVERSITY OF TEXAS AT AUSTIN   (United States)

Author keywords

Alias analysis; Pointer analysis

Indexed keywords

COMPUTER PROGRAMMING; COMPUTER SCIENCE;

ALIAS ANALYSIS; CONTEXT SENSITIVE; CONTEXT SENSITIVITY; FLOW SENSITIVITY; INTER-PROCEDURAL; POINTER ANALYSIS; PROGRAM ANALYSIS; STATE OF THE ART;

C (PROGRAMMING LANGUAGE);

EID: 70350337977     PISSN: 15232867     EISSN: None     Source Type: Journal    
DOI: 10.1145/1594834.1480911     Document Type: Conference Paper

References (52)

1. J. Aycock and R. N. Horspool. Simple generation of static singleassignment form. In 9th International Conference on Compiler Construction (CC), pages 110-124, London, UK, 2000. Springer-Verlag.
2. T. Ball, R. Majumdar, T. D. Millstein, and S. K. Rajamani. Automatic predicate abstraction of c programs. In Programming Language Design and Implementation (PLDI), pages 203-213, 2001.
3. R. Barua, W. Lee, S. Amarasinghe, and A. Agarawal. Compiler support for scalable and efficient memory systems. IEEE Trans. Comput., 50(11):1234-1247, 2001.
4. M. Berndl, O. Lhotak, F. Qian, L. Hendren, and N. Umanee. Pointsto analysis using BDDs. In Programming Language Design and Implementation (PLDI), 2003, pages 103-114.
5. G. Bilardi and K. Pingali. Algorithms for computing the static single assignment form. Journal of the ACM, 50(3):375-425, 2003.
6. R. E. Bryant. Graph-based algorithms for Boolean function manipulation. IEEETC, C-35(8):677-691, Aug 1986.
7. W. Chang, B. Streiff, and C. Lin. Efficient and extensible security enforcement using dynamic data flow analysis. In Computer and Communications Security (CCS), 2008, pages 39-50.
8. D. R. Chase, M.Wegman, and F. K. Zadeck. Analysis of pointers and structures. In Programming Language Design and Implementation (PLDI), pages 296-310, 1990.
9. P.-S. Chen, M.-Y. Hung, Y.-S. Hwang, R. D.-C. Ju, and J. K. Lee. Compiler support for speculative multithreading architecture with probabilistic points-to analysis. SIGPLAN Not., 38(10):25-36, 2003.
10. B.-C. Cheng and W.-M. W. Hwu. Modular interprocedural pointer analysis using access paths: Design, implementation, and evaluation. ACM SIG-PLAN Notices, 35(5):57-69, 2000.
11. J.-D. Choi, R. Cytron, and J. Ferrante. Automatic construction of sparse data flow evaluation graphs. In Symposium on Principles of Programming Languages (POPL), pages 55-66, New York, NY, USA, 1991. ACM Press.
12. F. Chow, S. Chan, S.-M. Liu, R. Lo, and M. Streich. Effective representation of aliases and indirect memory operations in SSA form. In Compiler Construction, 1996, pages 253-267.
13. R. Cytron, J. Ferrante, B. K. Rosen, M. N.Wegman, and F. K. Zadeck. Efficiently computing static single assignment form and the control dependence graph. ACM Transactions on Programming Languages and Systems, 13(4):451-490, 1991.
14. R. Cytron and R. Gershbein. Efficient accommodation of may-alias information in SSA form. In Programming Language Design and Implementation (PLDI), June 1993, pages 36-45.
15. R. K. Cytron and J. Ferrante. Efficiently computing φ-nodes on-thefly. ACM Trans. Program. Lang. Syst, 17(3):487-506, 1995.
16. E. Duesterwald, R. Gupta, and M. L. Soffa. Reducing the cost of data flow analysis by congruence partitioning. In Compiler Construction, 1994, pages 357-373.
17. S. Fink, E. Yahav, N. Dor, G. Ramalingam, and E. Geay. Effective typestate verification in the presence of aliasing. In International Symposium on Software Testing and Analysis, pages 133-144, 2006.
18. R. Ghiya. Putting pointer analysis to work. In Principles of Programming Languages (POPL), 1998, pages 121-133.
19. D. Goyal. An improved intra-procedural may-alias analysis algorithm. Technical report TR1999-777, New York University, 1999.
20. S. Z. Guyer and C. Lin. Error checking with client-driven pointer analysis. Science of Computer Programming, 58(1-2):83-114, 2005.
21. B. Hackett and R. Rugina. Region-based shape analysis with tracked locations. In Symposium on Principles of Programming Languages, pages 310-323, 2005.
22. B. Hardekopf and C. Lin. The Ant and the Grasshopper: Fast and accurate pointer analysis for millions of lines of code. In Programming Language Design and Implementation (PLDI), pages 290-299, San Diego, CA, USA, 2007.
23. B. Hardekopf and C. Lin. Exploiting pointer and location equivalence to optimize pointer analysis. In International Static Analysis Symposium (SAS), pages 265-280, 2007.
24. R. Hasti and S. Horwitz. Using static single assignment form to improve flow-insensitive pointer analysis. In Programming Language Design and Implementation (PLDI), 1998, pages 97-105.
25. N. Heintze and O. Tardieu. Ultra-fast aliasing analysis using CLA: A million lines of C code in a second. In Programming Language Design and Implementation (PLDI), pages 23-34, 2001.
26. M. Hind. Pointer analysis: haven't we solved this problem yet? In Workshop on Program Analysis for Software Tools and Engineering (PASTE), pages 54-61, New York, NY, USA, 2001. ACM Press.
27. M. Hind, M. Burke, P. Carini, and J.-D. Choi. Interprocedural pointer alias analysis. ACM Transactions on Programming Languages and Systems, 21(4):848-894, 1999.
28. M. Hind and A. Pioli. Assessing the effects of flow-sensitivity on pointer alias analyses. In Static Analysis Symposium, pages 57-81, 1998.
29. V. Kahlon. Bootstrapping: a technique for scalable flow and contextsensitive pointer alias analysis. In Programming language design and implementation, pages 249-259, 2008.
30. H.-S. Kim, E. M. Nystrom, R. D. Barnes, and W.-M. W. Hwu. Compaction algorithm for precise modular context-sensitive pointsto analysis. Technical report IMPACT-03-03, Center for Reliable and High Performance Computing, University of Illinois, Urbana-Champaign, 2003.
31. C. Lapkowski and L. J. Hendren. Extended SSA numbering: introducing SSA properties to languages with multi-level pointers. In CASCON '96: Proceedings of the 1996 conference of the Centre for Advanced Studies on Collaborative research, page 23, 1996.
32. C. Lattner. LLVM: An infrastructure for multi-stage optimization. Master's thesis, Computer Science Dept., University of Illinois at Urbana-Champaign, Dec 2002.
33. C. Lattner and V. Adve. Data structure analysis: An efficient contextsensitive heap analysis. Technical Report UIUCDCS-R-2003-2340, Computer Science Dept, University of Illinois at Urbana-Champaign, 2003.
34. O. Lhotak, S. Curial, and J. Amaral. Using ZBDDs in points-to analysis. In Workshops on Languages and Compilers for Parallel Computing (LCPC), 2007.
35. J. Lind-Nielson. BuDDy, a binary decision package.
36. A. Milanova and B. G. Ryder. Annotated inclusion constraints for precise flow analysis. In ICSM '05: Proceedings of the 21st IEEE International Conference on Software Maintenance (ICSM'05), pages 187-196, 2005.
37. M. Mock, D. Atkinson, C. Chambers, and S. Eggers. Improving program slicing with dynamic points-to data. In Foundations of Software Engineering, pages 71-80, 2002.
38. D. Novillo. Design and implementation of Tree SSA, 2004.
39. E. M. Nystrom, H.-S. Kim, and W. mei W. Hwu. Bottom-up and top-down context-sensitive summary-based pointer analysis. In International Symposium on Static Analysis, pages 165-180, 2004.
40. D. Pearce, P. Kelly, and C. Hankin. Efficient field-sensitive pointer analysis for C. In ACM Workshop on Program Analysis for Software Tools and Engineering (PASTE), pages 37-42, 2004.
41. D. J. Pearce, P. H. J. Kelly, and C. Hankin. Online cycle detection and difference propagation for pointer analysis. In 3rd International IEEE Workshop on Source Code Analysis and Manipulation (SCAM), pages 3-12, 2003.
42. G. Ramalingam. On sparse evaluation representations. Theoretical Computer Science, 277(1-2):119-147, 2002.
43. J. H. Reif and H. R. Lewis. Symbolic evaluation and the global value graph. In Principles of programming languages (POPL), pages 104-118, 1977.
44. A. Rountev and S. Chandra. Off-line variable substitution for scaling points-to analysis. ACM SIGPLAN Notices, 35(5):47-56, 2000.
45. A. Salcianu and M. Rinard. Pointer and escape analysis for multithreaded programs. In PPoPP '01: Proceedings of the Eighth ACM SIGPLAN Symposium on Principles and Practices of Parallel Programming, pages 12-23, 2001. (Pubitemid 33720374)
46. M. Shapiro and S. Horwitz. The effects of the precision of pointer analysis. Lecture Notes in Computer Science, 1302:16-34, 1997.
47. T. B. Tok, S. Z. Guyer, and C. Lin. Efficient flow-sensitive interprocedural data-flow analysis in the presence of pointers. In 15th International Conference on Compiler Construction (CC), pages 17-31, 2006.
48. J. Whaley and M. S. Lam. Cloning-based context-sensitive pointer alias analysis. In Programming Language Design and Implementation (PLDI), pages 131-144, 2004.
49. R. P. Wilson and M. S. Lam. Efficient context-sensitive pointer analysis for C programs. In Programming Language Design and Implementation (PLDI), pages 1-12, 1995.
50. J. Zhu. Symbolic pointer analysis. In International Conference on Computer-Aided Design (ICCAD), pages 150-157, New York, NY, USA, 2002. ACM Press.
51. J. Zhu. Towards scalable flow and context sensitive pointer analysis. In DAC '05: Proceedings of the 42nd Annual Conference on Design Automation, pages 831-836, 2005.
52. J. Zhu and S. Calman. Symbolic pointer analysis revisited. In Programming Language Design and Implementation (PLDI), pages 145-157, New York, NY, USA, 2004. ACM Press.