Interprocedural Slicing Using Dependence Graphs

ACM Transactions on Programming Languages and Systems (TOPLAS)

Volumn 12, Issue 1, 1990, Pages 26-60

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

^a UNIVERSITY OF WISCONSIN MADISON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING - ALGORITHMS; MATHEMATICAL TECHNIQUES - GRAPH THEORY;

DEPENDENCE GRAPHS; INTERPROCEDURAL SLICING; PROCEDURE CALLS;

COMPUTER PROGRAMMING LANGUAGES;

EID: 0025228221     PISSN: 01640925     EISSN: 15584593     Source Type: Journal    
DOI: 10.1145/77606.77608     Document Type: Article

References (22)

1. AHO, A. V., SETHI, R., AND ULLMAN, J. D. Compilers: Principles, Techniques, and Tools, Addison-Wesley, Reading, Mass., 1986.
2. BABICH, W. A., AND JAZAYERI, M. The method of attributes for data flow analysis: Part II. Demand analysis. Acta Inf. 10, 3 (Oct. 1978), 265-272.
3. BADGER, L., AND WEISER, M. Minimizing communication for synchronizing parallel dataflow programs. In Proceedings of the 1988 International Conference on Parallel Processing (St. Charles, IL, Aug. 15-19, 1988). Pennsylvania State University Press, University Park, PA, 1988.
4. BANNING, J. P. An efficient way to find the side effects of procedure calls and the aliases of variables. In Conference Record of the Sixth ACM Symposium on Principles of Programming Languages (San Antonio, Tex., Jan. 29-31, 1979). ACM, New York, 1979, pp. 29-41.
5. CALLAHAN, D. The program summary graph and flow-sensitive interprocedural data flow analysis. In Proceedings of the ACM SIGPLAN 88 Conference on Programming Language Design and Implementation (Atlanta, Ga., June 22-24, 1988). ACM SIGPLAN Not. 23, 7 (July 1988), 47-56.
6. COOPER, K. D., AND KENNEDY, K. Interprocedural side-effect analysis in linear time. In Proceedings of the ACM SIGPLAN 88 Conference on Programming Language Design and Implementation (Atlanta, Ga., June 22-24, 1988). ACM SIGPLAN Not. 23, 7 (July 1988), 57-66.
7. FERRANTE, J., OTTENSTEIN, K., AND WARREN, J. The program dependence graph and its use in optimization. ACM Trans. Program. Lang. Syst. 9, 3 (July 1987), 319-349.
8. HORWITZ, S., PRINS, J., AND REPS, T. Integrating non-interfering versions of programs. TR-690, Computer Sciences Dept., Univ. of Wisconsin, Madison, March 1987.
9. HORWITZ, S., PRINS, J., AND REPS, T. On the adequacy of program dependence graphs for representing programs. In Conference Record of the Fifteenth ACM Symposium on Principles of Programming Languages (San Diego, Calif., Jan. 13-15, 1988). ACM, New York, 1988, pp. 146-157.
10. HORWITZ, S., REPS, T., AND BINKLEY, D. Interprocedural slicing using dependence graphs. In Proceedings of the ACM SIGPLAN 88 Conference on Programming Language Design and Implementation (Atlanta, Ga., June 22-24, 1988). ACM SIGPLAN Not. 23, 7 (July 1988), 35-46.
11. HORWITZ, S., PRINS, J., AND REPS, T. Integrating non-interfering versions of programs. ACM Trans. Program. Lang. Syst. 11, 3 (July 1989), 345-387.
12. HWANG, J. C., Du, M. W., AND CHOU, C. R. Finding program slices for recursive procedures. In Proceedings of the IEEE COMPSAC 88 (Chicago, Oct. 3-7, 1988). IEEE Computer Society, Washington, D.C., 1988.
13. KASTENS, U. Ordered attribute grammars. Acta Inf. 13, 3 (1980), 229-256.
14. KNUTH, D. E. Semantics of context-free languages. Math. Syst. Theor. 2, 2 (June 1968), 127-145.
15. Kou, L. T. On live-dead analysis for global data flow problems. J. ACM 24, 3 (July 1977), 473-483.
16. KUCK, D. J., MURAOKA, Y., AND CHEN, S. C. On the number of operations simultaneously executable in FORTRAN-like programs and their resulting speed-up. IEEE Trans. Comput. C-21, 12 (Dec. 1972), 1293-1310.
17. LYLE, J., AND WEISER, ?. Experiments on slicing-based debugging tools. In Proceedings of the First Conference on Empirical Studies of Programming (June 1986).
18. MYERS, E. A precise inter-procedural data flow algorithm. In Conference Record of the Eighth ACM Symposium on Principles of Programming Languages (Williamsburg, Va., Jan. 26-28, 1981). ACM, New York, 1981, pp. 219-230.
19. OTTENSTEIN, K. J., AND OTTENSTEIN, L. M. The program dependence graph in a software development environment. In Proceedings of the ACM SIGSOFT/SIGPLAN Software Engineering Symposium on Practical Software Development Environments (Pittsburgh, Pa., April 23-25, 1984). ACM SIGPLAN Not. 19, 5 (May 1984), 177-184.
20. REPS, T., AND YANG, W. The semantics of program slicing. TR-777, Computer Sciences Dept., Univ. of Wisconsin, Madison, June 1988.
21. WEISER, M. Reconstructing sequential behavior from parallel behavior projections. Inf. Process. Lett. 17 (Oct. 1983), 129-135.
22. WEISER, M. Program slicing. IEEE Trans. Softw. Eng. SE-10, 4 (July 1984), 352-357.