Evaluating the effectiveness of pointer alias analyses

Science of Computer Programming

Volumn 39, Issue 1, 2001, Pages 31-55

  Hind, Michael ^a   Pioli, Anthony ^b  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b Registercom   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; C (PROGRAMMING LANGUAGE); DATA STRUCTURES; PRECISION ENGINEERING; RESPONSE TIME (COMPUTER SYSTEMS); SENSITIVITY ANALYSIS;

POINTER ANALYSIS ALGORITHMS;

COMPUTER SYSTEMS PROGRAMMING;

EID: 0035153588     PISSN: 01676423     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6423(00)00014-9     Document Type: Article

References (57)

1. L.O. Andersen, Program analysis and specialization for the C programming language, Ph.D. Thesis, DIKU, University of Copenhagen, May 1994. Available at ftp.diku.dk/pub/diku/semantics/papers/D-203.dvi.Z.
2. T. Austin, Pointer-intensive benchmark suite, version 1.1. http://www.cs.wisc.edu/austin/ptr-dist.html, 1995.
3. S. Balan, W. Bays, Spec announces new benchmark suites cint92 and cfp92, Tech. Rep. Systems Performance Evaluation Cooperative, March 1992, SPEC Newsletter 4(1).
4. M. Burke, P. Carini, J.-D. Choi, M. Hind, Flow-insensitive interprocedural alias analysis in the presence of pointers, in: Proc. 7th Workshop on Languages and Compilers for Parallel Computing, K. Pingali, U. Banerjee, D. Gelernter, A. Nicolau, D. Padua (Eds.), Lecture Notes in Computer Science, Vol. 892, Springer, Berlin, 1995, pp. 234-250. Extended version published as Research Report RC 19546, IBM T.J. Watson Research Center, September 1994.
5. M. Burke, P. Carini, J.-D. Choi, M. Hind, Interprocedural pointer alias analysis, Research Report RC 21055, IBM T.J. Watson Research Center, December 1997.
6. P. Carini, M. Hind, H. Srinivasan, Flow-sensitive interprocedural type analysis for C++, Research Report RC 20267, IBM T.J. Watson Research Center, November 1995.
7. D.R. Chase, M. Wegman, F. Kenneth Zadeck, Analysis of pointers and structures, SIGPLAN '90 Conf. on Programming Language Design and Implementation, June 1990, pp. 296-310; SIGPLAN Notices 25(6).
8. R. Chatterjee, B.G. Ryder, W.A. Landi, Relevant context inference, 26th Annu. ACM SIGACT-SIGPLAN Symp. on the Principles of Programming Languages, January 1999.
9. J.-D. Choi, M. Burke, P. Carini, Efficient flow-sensitive interprocedural computation of pointer-induced aliases and side effects, 20th Annu. ACM SIGACT-SIGPLAN Symp. on the Principles of Programming Languages, January 1993, pp. 232-245.
10. J.-D. Choi, R. Cytron, J. Ferrante, Automatic construction of sparse data flow evaluation graphs, 18th Annu. ACM Symp. on the Principles of Programming Languages, January 1991, pp. 55-66.
11. A. Deutsch, Interprocedural may-alias analysis for pointers: beyond k-limiting, SIGPLAN '94 Conf. on Programming Language Design and Implementation, June 1994, pp. 230-241; SIGPLAN Notices 29(6).
12. A. Diwan, K.S. McKinley, J.E.B. Moss, Type-based alias analysis, SIGPLAN '98 Conf. on Programming Language Design and Implementation, June 1998, pp. 106-117; SIGPLAN Notices 33(5).
13. M. Emami, R. Ghiya, L.J. Hendren, Context-sensitive interprocedural points-to analysis in the presence of function pointers, SIGPLAN '94 Conf. on Programming Language Design and Implementation, June 1994, pp. 242-256; SIGPLAN Notices 29(6).
14. Ghiya R., Hendren L.J. Connection analysis: a practical interprocedural heap analysis for C. Internat. J. Parallel Programming. 24(6):1996;547-578.
15. R. Ghiya, L.J. Hendren, Is it a tree, a dag or a cyclic graph? A shape analysis for heap-directed pointers in C, 23rd Annu. ACM SIGACT-SIGPLAN Symp. on the Principles of Programming Languages, January 1996, pp. 1-15.
16. R. Ghiya, L.J. Hendren, Putting pointer analysis to work, 25th Annu. ACM SIGACT-SIGPLAN Symp. on the Principles of Programming Languages, January 1998, pp. 121-133.
17. Hendren L.J., Nicolau A. Parallelizing programs with recursive data structures. IEEE Trans. Parallel Distributed Systems. 1(1):1990;35-47.
18. Hind M., Burke M., Carini P., Choi J.-D. Interprocedural pointer alias analysis. ACM Trans. Programming Languages Systems. 21(4):1999;848-894.
19. M. Hind, A. Pioli, An empirical comparison of interprocedural pointer alias analyses, Research Report RC 21058, IBM T.J. Watson Research Center, December 1997. Also available as SUNY at New Paltz Technical Report #98-104.
20. Hind M., Pioli A. Assessing the effects of flow-sensitivity on pointer alias analyses. Levi G. Proc. 5th Internat. Static Analysis Symposium. Lecture Notes in Computer Science. Vol. 1503:1998;57-81 Springer, Berlin.
21. M. Hind, A. Pioli, Traveling through Dakota: Experiences with an object-oriented program analysis system, in: TOOLS USA 2000-34th Internat. Conf. on Component and Object Technology, July 2000. Also available as Research Report 21674, IBM T.J. Watson Research Center, February 2000.
22. M. Hind, A. Pioli, Which pointer analysis should I use?, in: ACM SIGSOFT Internat. Symp. on Software Testing and Analysis, August 2000.
23. S. Horwitz, P. Pfeiffer, T. Reps, Dependence analysis for pointer variables, SIGPLAN '89 Conf. on Programming Language Design and Implementation, June 1989, pp. 28-40; SIGPLAN Notices 24(6).
24. P. Hudak, A semantic model of reference counting and its abstraction, Conf. Record of the 1986 ACM Symp. of LISP and Functional Programming, August 1986, pp. 351-363.
25. Jones N.D., Muchnick S.S. Flow analysis and optimization of LISP-like structures. Muchnick S.S., Jones N.D. Program Flow Analysis. Theory and Applications:1981;102-131 Prentice-Hall, Englewood Cliffs, NJ. Chapter 4.
26. M. Karasick, The architecture of Montana: An open and extensible programming environment with an incremental C++ compiler, in: ACM SIGSOFT Symp. on the Foundations of Software Engineering, November 1998, pp. 131-142.
27. Landi W. Undecidability of static analysis. ACM Lett. Programming Languages Systems. 1(4):1992;323-337.
28. W. Landi, personal communication, October 1997.
29. W. Landi, B. Ryder, A safe approximate algorithm for interprocedural pointer aliasing, SIGPLAN '92 Conf. on Programming Language Design and Implementation, June 1992, pp. 235-248; SIGPLAN Notices 27(6).
30. W. Landi, B. Ryder, S. Zhang, Interprocedural modification side effect analysis with pointer aliasing, SIGPLAN'93 Conf. on Programming Language Design and Implementation, June 1993, pp. 56-67; SIGPLAN Notices 28(6).
31. W.A. Landi, B.G. Ryder, P.A. Stocks, S. Zhang, R. Altucher, A schema for interprocedural modification side-effect analysis with pointer aliasing, Tech. Rep. DCS-TR-336, Department of Computer Science, Rutgers University, May 1998.
32. J.R. Larus, P.N. Hilfinger, Detecting conflicts between structure accesses, SIGPLAN'88 Conf. on Programming Language Design and Implementation, 1988, pp. 21-34; SIGPLAN Notices 23(7).
33. D. Liang, M.J. Harrold, Efficient points-to analysis for wholeprogram analysis, in: Proc. 7th European Software Engineering Conf. and ACM SIGSOFT Foundations of Software Engineering, O. Nierstrasz, M. Lemoine (Eds.), Lecture Notes in Computer Science, vol. 1687, Springer, Berlin, September 1999, pp. 199-215.
34. Marlowe T., Landi W., Ryder B., Choi J.-D., Burke M., Carini P. Pointer-induced aliasing: a clarification. SIGPLAN Notices. 28(9):1993;67-70.
35. T.J. Marlowe, B.G. Ryder, M.G. Burke, Defining flow sensitivity in data flow problems, Tech. Rep. RC 20138, IBM T.J. Watson Research Center, July 1995.
36. A. Pioli, Conditional pointer aliasing and constant propagation, Master's Thesis, SUNY at New Paltz, 1999. Available at http://www.mcs.newpaltz.edu/tr as Tech. Rep. # 99-102.
37. A. Pioli, M. Hind, Combining interprocedural pointer analysis and conditional constant propagation, Research Report 21532, IBM T.J. Watson Research Center, March 1999. Also available as SUNY at New Paltz Technical Report # 99-103.
38. Ramalingam G. The undecidability of aliasing. ACM Trans. Programming Languages Systems. 16(5):1994;1467-1471.
39. E. Ruf, Context-insensitive alias analysis reconsidered. SIGPLAN'95 Conference on Programming Language Design and Implementation, June 1995, pp. 13-22; SIGPLAN Notices, 30(6).
40. E. Ruf, Partitioning dataflow analyses using types, 24th Annu. ACM SIGACT-SIGPLAN Symp. on the Principles of Programming Languages, January 1997, pp. 15-26.
41. E. Ruf, personal communication, October 1997.
42. C. Ruggieri, T.P. Murtagh, Lifetime analysis of dynamically allocated objects, 15th Annu. ACM Symp. on the Principles of Programming Languages, January 1988, pp. 285-293.
43. Rutgers PROLANGS. http://www.prolangs.rutgers.edu/public.html, 1999.
44. M. Sagiv, T. Reps, R. Wilhelm, Solving shape-analysis problems in languages with destructive updating, 23rd Annu. ACM SIGACT-SIGPLAN Symp. on the Principles of Programming Languages, January 1996, pp. 16-31.
45. Sagiv M., Reps T., Wilhelm R. Solving shape-analysis problems in languages with destructive updating. ACM Trans. on Programming Languages Systems. 20(1):1998;1-50.
46. M. Shapiro, S. Horwitz, The effects of the precision of pointer analysis, in: Proc. Internat. Static Analysis Symp., P.V. Hentenryck (Ed.), Lecture Notes in Computer Science, Vol. 1302, Springer, Berlin, 1997, pp. 16-34.
47. M. Shapiro, S. Horwitz, Fast and accurate flow-insensitive point-to analysis, 24th Annu. ACM SIGACT-SIGPLAN Symp. on the Principles of Programming Languages, January 1997, pp. 1-14.
48. SPEC. SPEC CPU95, Version 1.0, Standard Performance Evaluation Corporation, http://www.specbench/org, August 1995.
49. B. Steensgaard, Points-to analysis in almost linear time, 23rd Annu. ACM SIGACT-SIGPLAN Symp. on the Principles of Programming Languages, January 1996, pp. 32-41.
50. P.A. Stocks, B.G. Ryder, W.A. Landi, S. Zhang, Comparing flow and context sensitivity on the modifications-side-effects problem, Internat. Symp. on Software Testing and Analysis, March 1998, pp. 21-31.
51. R. Tarjan, Data structures and network flow algorithms, Regional Conference Series in Applied Mathematics, CMBS, Vol. 44, SIAM, Philadelphia, PA, 1983.
52. Wegman M.N., Kenneth Zadeck F. Constant propagation with conditional branches. ACM Trans. on Programming Languages and Systems. 13(2):1991;181-210.
53. R.P. Wilson, Efficient context-sensitive pointer analysis for C programs, Ph.D. Thesis, Stanford University, December 1997.
54. R.P. Wilson, M.S. Lam, Efficient context-sensitive pointer analysis for C programs, SIGPLAN'95 Conf. on Programming Language Design and Implementation, June 1995, pp. 1-12; SIGPLAN Notices 30(6).
55. S.H. Yong, S. Horwitz, T. Reps, Pointer analysis for programs with structures and casting, SIGPLAN'99 Conf. on Programming Language Design and Implementation, 1999, pp. 91-103.
56. S. Zhang, B.G. Ryder, W. Landi, Program decomposition for pointer aliasing: A step toward practical analyses, 4th Symp. on the Foundations of Software Engineering, October 1996, pp. 81-92.
57. S. Zhang, B.G. Ryder, W. Landi, Experiments with combined analysis for pointer aliasing ACM SIGPLAN-SIGSOFT Workshop on Program Analysis for Software Tools and Engineering, June 1998, pp. 11-18.