Interprocedural slicing using dependence graphs

ACM SIGPLAN Notices

Volumn 39, Issue 4, 2004, Pages 229-231

  Horwitz, Susan ^a   Reps, Thomas ^a   Binkley, David ^b  

^a University of Wisconsin Madison   (United States)

^b LOYOLA UNIVERSITY MARYLAND   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONTEXT-FREE LANGUAGE; CONTEXT-SENSITIVE PROGRAM ANALYSIS; INTERPROCEDURAL PROGRAMS; SYSTEM DEPENDENCE GRAPHS (SDGS);

ALGORITHMS; COMPUTATIONAL METHODS; COMPUTER SOFTWARE; CONTEXT FREE LANGUAGES; CONTEXT SENSITIVE LANGUAGES; DATA FLOW ANALYSIS; DATA STRUCTURES; GRAPH THEORY; MATHEMATICAL MODELS; PROCEDURE ORIENTED LANGUAGES;

COMPUTER SCIENCE;

EID: 3142703014     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/989393.989419     Document Type: Conference Paper

References (51)

1. H. Agrawal. On slicing programs with jump statements. In Conf. on Prog. Lang. Design and Impl., pages 302-312, 1994.
2. T. Ball and S. Horwitz. Slicing programs with arbitrary control-flow. In Int. Workshop on Automated and Algorithmic Debugging, pages 206-222, 1993.
3. T. Ball and S.K. Rajamani. Bebop: A path-sensitive interprocedural dataflow engine. In Workshop on Prog. Analysis for Softw. Tools and Eng., New York, NY, June 2001, ACM Press.
4. U. Bannerjee. Speedup of Ordinary Programs. PhD thesis, Dept. of Comp. Sci., Univ. of Illinois, Urbana, IL, October 1979.
5. M. Benedikt, P. Godefroid, and T. Reps. Model checking of unrestricted hierarchical state machines. In ICALP í01, 2001.
6. D. Binkley. Multi-Procedure Program Integration. PhD thesis, Comp. Sci. Dept., Univ. of Wisconsin, Madison, WI, August 1991. Tech. Rep. TR-1038.
7. D. Binkley. Precise executable interprocedural slices. Let. on Prog. Lang, and Syst., 2:31-45, 1993.
8. D. Callahan, The program summary graph and flow-sensitive interprocedural data flow analysis. In Conf. on Prog. Lang. Design and Impl., pages 47-56, New York, NY, 1988. ACM Press.
9. D. Callahan, K.D. Cooper, K. Kennedy, and L. Torczon. Interprocedural constant propagation. In Symp. on Comp. Construct., pages 152-161, 1986.
10. D.R. Chase, M. Wegman, and F. Zadeck. Analysis of pointers and structures. In Conf. on Prog. Lang. Design and Impl., pages 296-310, New York, NY, 1990. ACM Press.
11. J.-D. Choi and J. Ferrante. Static slicing in the presence of goto statements. Trans. on Prog. Lang. and Syst., 16(4):1096-1113, 1994.
12. K.D. Cooper and K. Kennedy. Interprocedural side-effect analysis in linear time. In Conf. on Prog. Lang. Design and Impl., pages 57-66, New York, NY, 1988. ACM Press.
13. P. Cousot and R. Cousot. Static determination of dynamic properties of recursive procedures. In E.J. Neuhold, editor, Formal Descriptions of Programming Concepts, (IFIP WG 2.2, St. Andrews, Canada, August 1977), pages 237-277. North-Holland, 1978.
14. M. Das, S. Lerner, and M. Seigle. ESP: Path-sensitive program verification in polynomial time. In Conf. on Prog. Lang. Design and Impl., pages 57-68, New York, NY, 2002. ACM Press.
15. M.B. Dwyer, J.C. Corbett, J. Hatcliff, S. Sokolowski, and H. Zheng. Slicing multi-threaded Java programs: A case study. Tech. Rep. 99-7, Dept. of Comp. and Inf. Sci., Kansas State Univ., Manhattan, KS, February 1999.
16. M. Emami, R. Ghiya, and L. Hendren. Context-sensitive interprocedural points-to analysis in the presence of function pointers. In Conf. on Prog. Lang. Design and Impl., New York, NY, 1994. ACM Press.
17. J. Ferrante, K. Ottenstein, and J. Warren. The program dependence graph and its use in optimization. Trans. On Prog. Lang. and Syst., 3(9):319-349, 1987.
18. G. Goff, K. Kennedy, and C.-W. Tseng. Practical dependence testing. In Conf. on Prog. Lang. Design and Impl., pages 15-29, New York, NY, 1991. ACM Press.
19. S. Horwitz, P. Pfeiffer, and T. Reps. Dependence analysis for pointer variables. In Conf. on Prog. Lang. Design and Impl., pages 28-40, New York, NY, 1989. ACM Press.
20. S. Horwitz, T. Reps, and D. Binkley. Interprocedural slicing using dependence graphs. Trans. on Prog. Lang. and Syst., 12(1):26-60, January 1990.
21. S. Horwitz, T. Reps, and M. Sagiv. Demand interprocedural dataflow analysis. In Symp. on the Found. of Softw. Eng., pages 104-115, New York, NY, October 1995. ACM Press.
22. S. Horwitz, T. Reps, and M. Sagiv. Demand interprocedural dataflow analysis. report TR-1283, Comp. Sci. Dept., Univ. of Wisconsin, August 1995. Available at "http://www.cs.wisc.edu/wpis/papers/tr1283r.ps".
23. S. Horwitz, T. Reps, M. Sagiv, and G. Rosay. Speeding up slicing. In Symp. on the Found. of Softw. Eng., pages 11-20, New York, NY, December 1994. ACM Press.
24. U. Kastens. Ordered attribute grammars. Acta Inf., 13(3):229-256, 1980.
25. D.E. Knuth. Semantics of context-free languages. Math. Syst. Theory, 2:127-145, 1968.
26. J. Krinke, Static slicing of threaded programs. In Workshop on Prog. Analysis for Softw. Tools and Eng., June 1998.
27. S. Kumar and S. Horwitz. Better slicing of programs with jumps and switches. In Colloq on Formal Approaches in Softw. Eng., pages 96-112, 2002.
28. J.R. Larus and P.N. Hilfinger. Detecting conflicts between structure accesses. In Conf. on Prog. Lang. Design and Impl., pages 21-34, New York, NY, 1988. ACM Press.
29. D.E. Maydan, J.L. Hennessy, and M.S. Lam. Efficient and exact data dependence analysis. In Conf. on Prog. Lang. Design and Impl., pages 1-14, New York, NY, 1991. ACM Press.
30. M. Nanda and S. Ramesh. Slicing concurrent programs. In Symp. on Softw. Testing and Analysis, August 2000.
31. K.J. Ottenstein and L.M. Ottenstein. The program dependence graph in a software development environment. In Softw. Eng. Symp. on Practical Softw. Dev. Environments, pages 177-184, New York, NY, 1984. ACM Press.
32. W. Pugh and D. Wonnacott. Eliminating false data dependences using the Omega test. In Conf. on Prog. Lang. Design and Impl., pages 140-151, New York, NY, 1992. ACM Press.
33. G. Ramalingam. Context-sensitive synchronization-sensitive analysis is undecidable. Trans. on Prog. Lang. and Syst., 22(2):416-430, 2000.
34. J. Rehof and M. Fähndrich. Type-base flow analysis: From polymorphic subtyping to CFL-reachability. In Symp. on Princ. of Prog. Lang., pages 54-66, New York, NY, 2001. ACM Press.
35. T. Reps. Demand interprocedural program analysis using logic databases. In R. Ramakrishnan, editor, Applications of Logic Databases. Kluwer Academic Publishers, 1994.
36. T. Reps. Shape analysis as a generalized path problem. In Symp. on Part. Eval. and Semantics-Based Prog. Manip., pages 1-11, New York, NY, June 1995. ACM Press.
37. T. Reps. On the sequential nature of interprocedural program-analysis problems. Acta Inf., 33:739-757, 1996.
38. T. Reps. Program analysis via graph reachability. Inf. and Softw. Tech., 40(11-12):701-726, November 1998.
39. T. Reps. Undecidability of context-sensitive data-dependence analysis. Trans. on Prog. Lang. and Syst., 22(1):162-186, January 2000.
40. T. Reps, S. Horwitz, and D. Binkley. U.S. Patent Number 5,161,216, Interprocedural slicing of computer programs using dependence graphs, November 1992.
41. T. Reps, S. Horwitz, and M. Sagiv. Precise interprocedural dataflow analysis via graph reachability. In Symp. on Princ. of Prog. Lang., pages 49-61, New York, NY, 1995. ACM Press.
42. T. Reps and G. Rosay. Precise interprocedural chopping. In Symp. on the Found, of Softw. Eng., New York, NY, October 1995. ACM Press.
43. T. Reps, M. Sagiv, and S. Horwitz. Interprocedural dataflow analysis via graph reachability. Tech. Rep. TR 94-14, Datalogisk Institut, Univ. of Copenhagen, 1994. Available at "http://www.cs.wisc.edu/wpis/papers/diku- tr94-14.ps".
44. M. Sagiv, T. Reps, and S. Horwitz. Precise interprocedural dataflow analysis with applications to constant propagation. Theor. Comp. Sci., 167:131-170, 1996.
45. M. Sharir and A. Pnueli. Two approaches to interprocedural data flow analysis. In S.S. Muchnick and N.D. Jones, editors, Program Flow Analysis: Theory and Applications, chapter 7, pages 189-234. Prentice-Hall, Englewood Cliffs, NJ, 1981.
46. S. Sinha, M. Harrold, and G. Rothermel. System-dependence-graph-based slicing of programs with arbitrary control flow. In Int. Conf. on Softw. Eng., pages 432-441, Wash., DC, 1999. IEEE Comp. Soc.
47. M. Weiser. Program slicing. In Int. Conf. on Softw. Eng., pages 439-449, Wash., DC, 1981. IEEE Comp. Soc.
48. M. Weiser. Program slicing. Trans. on Softw. Eng., SE-10(4):352-357, July 1984.
49. R.P. Wilson and M.S. Lam. Efficient context-sensitive pointer analysis for C programs. In Conf on Prog. Lang. Design and Impl., pages 1-12, New York, NY, 1995. ACM Press.
50. M.J. Wolfs. Optimizing Supercompilers for Supercomputers. PhD thesis, Dept. of Comp. Sci., Univ. of Illinois, Urbana, IL, October 1982.
51. M. Yannakakis. Graph-theoretic methods in database theory. In Symp. on Princ. of Database Syst., pages 230-242, 1990.