Symbolic pointer analysis revisited

Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)

Volumn 1, Issue , 2004, Pages 145-157

  Zhu, Jianwen ^a   Calman, Silvian ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

Binary decision diagrams; Call graph construction; Pointer analysis

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); OBJECT ORIENTED PROGRAMMING; PARALLEL PROCESSING SYSTEMS; PROGRAM PROCESSORS;

BINARY DECISION DIAGRAMS; CALL GRAPH CONSTRUCTION; POINTER ANALYSIS;

COMPUTER PROGRAMMING LANGUAGES;

EID: 8344229971     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/996841.996860     Document Type: Conference Paper

References (41)

1. SPEC CPU2000 benchmarks. http://www.specbench.org/cpu2000/.
2. S. B. Akers. Binary decision diagrams. IEEE Transactions on Computer, C-27(6):509-516, June 1978.
3. O. Andersen. Program Analysis and Specialization for the C Programming Language. PhD thesis, Computer Science Department, University of Copenhagen, 1994.
4. T. Ball and T. Millstein. Polymorphic predicate abstraction. Technical Report MSR-TR-2001-10, Microsoft Research, June 24, 2003.
5. M. Berndl, O. Lhoták, F. Qian, L. Hendren, and N. Umanee. Point-to analysis using BDD. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, San Diego, June 2003.
6. R. E. Bryant. Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computer, C-35(8):677-691, August 1986.
7. J. R. Burch, E. M. Clarke, and D. E. Long. Symbolic model checking with partitioned transition relations. In International Conference on Very Large Scale Integration, Edinburgh, Scotland, 1991.
8. J. R. Burch, E. M. Clarke, D. E. Long, K. L. McMillan, and D. L. Dill. Symbolic model checking for sequential circuit verification. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, (13), 1994.
9. 20 states and beyond. In Proceedings of the Fifth Annual IEEE Symposium on Logic in Computer Science, Washington, DC, 1990.
10. R. Chatterjee, B. G. Ryder, and W. A. Landi. Relevant context inference. In Proceedings of Symposium on Principles of Programming Languages, pages 133-146, 1999.
11. B.-C. Cheng and W.-M. W. Hwu. Modular interprocedural pointer analysis using access paths: Design implementation and evaluation. In Proceedings of SIGPLAN Conference on Programming Language Design and Implementation, pages 57-69, Vancouver, British Columbia, Canada, June 2000.
12. O. Coudert, C. Berthet, and J. C. Madre. A unified framework for the formal verification of sequential circuits. In Proceedings of the International Conference on Computer-Aided Design, pages 126-129, November 1990.
13. O. Coudert and J. C. Madre. Symbolic computation of the valid states of a sequential machine: Algorithms and discussion. In ACM Workshop on Formal Methods in VLSI Design, 1991.
14. M. Emami, R. Ghiya, and L. J. Hendren. Context-sensitive interprocedural points-to analysis in the presence of function pointers. In Proceedings of SIGPLAN Conference on Programming Language Design and Implementation, pages 242-256, 1994.
15. M. Fähndrich, J. S. Foster, Z. Su, and A. Aiken. Partial online cycle elimination in inclusion constraint graphs. ACM SIGPLAN Notices, 33(5):85-96, 1998.
16. M. Fähndrich, J. Rehof, and M. Das. Scalable context-sensitive flow analysis using instantiation constraints. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 253-263, Vancouver, British Columbia, Canada, June 2000.
17. J. S. Foster, M. Fähndrich, and A. Aiken. Polymorphic versus monomorphic flow-insensitive points-to analysis for C. In Proceedings of Static Analysis Symposium, pages 175-198, June 2000.
18. D. Gajski. Principles of Digital Design. Prentice Hall, 1997.
19. N. Heintze and O. Tardieu. Ultra-fast aliasing analysis using CLA: A million lines of C code in a second. In Proceedings of SIGPLAN Conference on Programming Language Design and Implementation, pages 254-263, 2001.
20. M. Hind. Pointer analysis: Haven't we solved this problem yet. In ACM SIGPLAN-SIGSOFT Workshop on Program Analysis for Software Tools and Engineering (PASTE), June 2001.
21. 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.
22. M. Hind and A. Pioli. Assessing the effects of flow-sensitivity on pointer alias analyses. In Proceedings of Static Analysis Symposium, pages 57-81, 1998.
23. M. Hind and A. Pioli. Which pointer analysis should I use? In International Symposium on Software Testing and Analysis, pages 113-123, 2000.
24. W. Landi and B. Ryder. A safe approximate algorithm for inter-procedural pointer aliasing. In Proceedings of SIGPLAN Conference on Programming Language Design and Implementation, pages 235-248, June 1992.
25. C. Lee, M. Potkonjak, and W. H. Mangione-Smith. Mediabench: A tool for evaluating and synthesizing multimedia and communications systems. In Micro 30, 1997.
26. O. Lhoták and L. Hendren. Jedd: A BDD-based relational extension of Java. In Proceedings of SIGPLAN Conference on Programming Language Design and Implementation, June 2004.
27. D. Liang and M. J. Harrold. Efficient computation of parameterized pointer information for interprocedural analyses. In Proceedings of Static Analysis Symposium, pages 279-298, 2001.
28. A. Milanova, A. Rountev, and B. Ryder. Parameterized object-sensitivity for points-to and side-effect analysis for Java. In Proceedings of International Symposium on Software Testing and Analysis, pages 1-12, 2000.
29. I.-H. Moon, J. H. Kukula, K. Ravi, and F. Somenzi. To split or to conjoin: the question in image computation. In Design Automation Conference, pages 23-28, 2000.
30. A. Rountev and S. Chandra. Off-line variable substitution for scaling points-to analysis. ACM SIGPLAN Notices, 35(5):47-56, 2000.
31. E. Ruf. Context-insensitive alias analysis reconsidered. In Proceedings of SIGPLAN Conference on Programming Language Design and Implementation, pages 13-22, La Jolla, California, June 1995.
32. B. Ryder. Prolangs analysis framework. http://www.prolangs.rutgers.edu.
33. M. Sagiv, T. Reps, and R. Wilhelm. Parametric shape analysis via 3-valued logic. ACM Transactions on Programming Languages and Systems, 24(3):217-298, 2002.
34. M. Sharir and A. Pnueli. Two approaches to interprocedural data flow analysis. In Program Flow Analysis.: Theory and Applications, pages 189-234. Prentice Hall, 1981.
35. F. Somenzi. CUDD: Binary decision diagram package release, http://vlsi.Colorado.EDU/~fabio/CUDD/cuddIntro.html, 1998.
36. B. Steensgaard. Points-to analysis in almost linear time. In Proceedings of Symposium on Principles of Programming Languages, pages 32-41, 1996.
37. R. Tarjan. Depth first search and linear graph algorithms. SIAM Journal of Computing, 1(2):146-160, 1972.
38. J. Whaley and M. Lam. Cloning-based context-sensitive pointer alias analysis using binary decision diagrams. In Proceedings of SIGPLAN Conference on Programming Language Design and Implementation, June 2004.
39. R. Wilson and M. Lam. Efficient context-sensitive pointer analysis for C programs. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 1-12, June 1995.
40. S. Zhang, B. G. Ryder, and W. Landi. Program decomposition for pointer aliasing: A step toward practical analyses. In Foundations of Software Engineering, pages 81-92, 1996.
41. J. Zhu. Symbolic pointer analysis. In Proceedings of the International Conference in Computer Aided Design, San Jose, November 2002.