A bottom-up pointer analysis using the update history

Information and Software Technology

Volumn 51, Issue 4, 2009, Pages 691-707

  Kang, Hyun Goo ^a   Han, Taisook ^a  

^a Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

Author keywords

Flow and context sensitive pointer analysis; Modular analysis; Strong update; Type system

Indexed keywords

C PROGRAMS; FLOW- AND CONTEXT-SENSITIVE POINTER ANALYSIS; MEMORY LOCATIONS; MEMORY STATES; MODULAR ANALYSIS; PILOT IMPLEMENTATION; SIDE EFFECTS; SOURCE CODE ANALYSIS; STRONG UPDATE; TYPE SYSTEM;

EID: 58549099452     PISSN: 09505849     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.infsof.2008.11.003     Document Type: Article

References (37)

1. M. Fähndrich, J. Rehof, M. Das, Scalable context-sensitive flow analysis using instantiation constraints, in: Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, 2000, pp. 253-263.
2. B.-C. Cheng, W. Mei, W. Hwu, Modular interprocedural pointer analysis using access paths: design, implementation, and evaluation, in: Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, 2000, pp. 57-69.
3. J.S. Foster, M. Fähndrich, A. Aiken, Polymorphic versus monomorphic flow-insensitive points-to analysis for C, in: Proceedings of the Annual International Static Analysis Symposium, 2000, pp. 175-198.
4. E. Ruf, Effective synchronization removal for Java, in: Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, 2000, pp. 208-218.
5. N. Heintze, O. Tardieu, Ultra-fast aliasing analysis using CLA: a million lines of C code in a second, in: Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, 2001, pp. 254-263.
6. A. Rountev, B.G. Ryder, Points-to and side-effect analyses for programs built with precompiled libraries, in: Proceedings of the International Conference on Compiler Construction, 2002, pp. 20-36.
7. Harrold M.J., and Rothermel G. Separate computation of alias information for reuse. IEEE Transactions on Software Engineering (1996) 442-460
8. A. Rountev, B.G. Ryder, W. Landi, Data-flow analysis of program fragments, in: ACM SIGPLAN-SIGSOFT Symposium on the Foundations of Software Engineering, 1999, pp. 235-252.
9. R. Chatterjee, B.G. Ryder, W.A. Landi, Relevant context inference, in: Proceedings of the ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1999, pp. 133-146.
10. J. Whaley, M.C. Rinard, Compositional pointer and escape analysis for Java programs, in: OOPSLA, 1999, pp. 187-206.
11. D.R. Chase, M. Wegman, F.K. Zadeck, Analysis of pointers and structures, in: Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, 1990, pp. 296-310.
12. A. Deutsch, Interprocedural may-alias analysis for pointers: beyond k-limiting, in: Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, 1994, pp. 230-241.
13. R.P. Wilson, M.S. Lam, Efficient context-sensitive pointer analysis for C programs, in: Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, 1995, pp. 1-12.
14. R.P. Wilson, Efficient, Context-Sensitive Pointer Analysis for C Programs, Ph.D. thesis, Stanford University, December 1997.
15. Pierce B.C. Types and Programming Languages (2002), Kluwer Academic Publisher, The MIT Press
16. Wright A.K., and Felleisen M. A syntactic approach to type soundness. Information and Computation 115 1 (1994) 38-94
17. H.-G. Kang, T. Han, A bottom-up pointer analysis using the update history, Technical Report of the Department of Computer Science at KAIST. .
18. Cousot P., and Cousot R. Abstract interpretation frameworks. Journal of Logic and Computation 2 4 (1992) 511-547
19. Nielson F., Nielson H.R., and Hankin C. Principles of Program Analysis (1999), Springer-Verlag
20. G.C. Necula, S. McPeak, S.P. Rahul, W. Weimer, CIL: intermediate languages and tools for analysis and transformation of C programs, in: Proceedings of the International Conference on Compiler Construction, 2002, pp. 213-228.
21. S.H. Yong, S. Horwitz, T.W. Reps, Pointer analysis for programs with structures and casting, in: PLDI, 1999, pp. 91-103.
22. D.J. Pearce, P.H.J. Kelly, C. Hankin, Efficient field-sensitive pointer analysis of C, ACM Transactions on Programming Language and Systems 30 (1) (2007).
23. W. Landi, B.G. Ryder, A safe approximate algorithm for interprocedural pointer aliasing, in: Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, 1992, pp. 235-248.
24. Sharir M., and Pnueli A. Two approaches to interprocedural data flow analysis. Program Flow Analysis: Theory and Application (1981), Kluwer Academic Publisher, Prentice-Hall 189-234
25. P. Cousot, R. Cousot, Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints, in: Proceedings of the ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1977, pp. 238-252.
26. P. Cousot, R. Cousot, Modular static program analysis, in: Proceedings of the International Conference on Compiler Construction, 2002, pp. 159-178.
27. M. Hind, Pointer analysis: haven't we solved this problem yet?, in: ACM SIGPLAN-SIGSOFT Workshop on Program Analysis for Software Tools and Engineering, ACM, 2001, pp. 54-61.
28. Hind M., Burke M., Carini P., and Choi J.-D. Interprocedural pointer alias analysis. ACM Transactions on Programming Language and Systems (1999) 848-894
29. M. Emami, R. Ghiya, L.J. Hendren, Context-sensitive interprocedural points-to analysis in the presence of function pointers, in: Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, 1994, pp. 242-256.
30. Sagiv M., Reps T., and Wilhelm R. Parametric shape analysis via 3-valued logic. ACM Transactions on Programming Language and Systems (2002) 217-298
31. J. Zhu, Towards scalable flow and context sensitive pointer analysis, in: W.H.J. Jr., G. Martin, A.B. Kahng (Eds.), DAC, ACM, 2005, pp. 831-836.
32. S.H. Yong, S. Horwitz, Pointer-range analysis, in: Proceedings of the Annual International Static Analysis Symposium, 2004, pp. 133-148.
33. Rinetzky N., Sagiv M., and Yahav E. Interprocedural shape analysis for cutpoint-free programs. In: Hankin C., and Siveroni I. (Eds). SAS. Lecture Notes in Computer Science vol. 3672 (2005), Springer 284-302
34. N. Rinetzky, J. Bauer, T.W. Reps, S. Sagiv, R. Wilhelm, A semantics for procedure local heaps and its abstractions, in: J. Palsberg, M. Abadi (Eds.), POPL, ACM, 2005, pp. 296-309.
35. Gotsman A., Berdine J., and Cook B. Interprocedural shape analysis with separated heap abstractions. In: Yi K. (Ed). SAS. Lecture Notes in Computer Science vol. 4134 (2006), Springer 240-260
36. Distefano D., O'Hearn P.W., and Yang H. A local shape analysis based on separation logic. In: Hermanns H., and Palsberg J. (Eds). TACAS. Lecture Notes in Computer Science vol. 3920 (2006), Springer 287-302
37. Kang H.-G., Kim Y., Han T., and Han H. A path sensitive type system for resource usage verification of C like languages. In: Yi K. (Ed). APLAS. Lecture Notes in Computer Science vol. 3780 (2005), Springer 264-280