Slicing programs with arbitrary control-flow

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 749 LNCS, Issue , 1993, Pages 206-222

  Ball, Thomas ^a   Horwitz, Susan ^a  

^a UNIVERSITY OF WISCONSIN MADISON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPLICATION PROGRAMS;

CONTROL FLOWS; CONTROL-FLOW; PROGRAM BEHAVIOR; PROGRAM MAINTENANCES; PROGRAM POINTS; PROGRAM SLICING; PROGRAM TRANSFORMATIONS; SLICING ALGORITHMS;

PROGRAM DEBUGGING;

EID: 84980009359     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0019410     Document Type: Conference Paper

References (14)

1. A. Aho, R. Sethi, and J. Ullman, Compilers: Principles, Techniques and Tools, Addison-Wesley, Reading, MA (1986).
2. B. Baker, “An Algorithm for Structuring Flow Graphs,” J. ACM 24(1) pp. 98-120 New York, NY, (January 1977).
3. T. Ball and S. Horwitz, “Slicing programs with arbitrary control flow,” Technical Report #1128, University of Wisconsin, Madison (December 1992).
4. J. D. Choi and J. Ferrante, “What is in a slice,” Unpublished draft, IBM TJ. Watson Research Center (December 1992).
5. J. Ferrante, K. Ottenstein, and J. Warren, “The program dependence graph and its use in optimization,” ACM Transactions on Programming Languages and Systems 9(5) pp. 319-349 (July 1987).
6. S. Horwitz, J. Prins, and T. Reps, “On the adequacy of program dependence graphs for representing programs,” pp. 146-157 in Conference Record of the 15th ACM. Symposium on Principles of Programming Languages, (San Diego, CA, January 13-15, 1988), ACM, New Yak (1988).
7. S. Horwitz, J. Prins, and T. Reps, “Integrating non-interfering versions of programs,” ACM Trans. Program. Lang. Syst. 11(3) pp. 345-387 (July 1989).
8. S. Horwitz, “Identifying the semantic and textual differences between two versions of a program,” Proceedings of the ACM SIGPLAN '90 Conference on Programming Language Design and Implementation (published as SIGPLAN Notices) 25(6) pp. 234-245 ACM, (June 20-22, 1990).
9. S. Horwitz, T. Reps, and D. Binkley, “Interprocedural slicing using dependence graphs,” ACM Transactions on Programming Languages and Systems 12(1) pp. 26-60 (January 1990).
10. J. C. Hwang, M. W. Du, and C. R. Chou, “Finding program slices for recursive procedures,” Proceedings of IEEE COMPSAC 88, (Chicago, IL, Oct. 3-7, 1988), IEEE Computer Society, (1988).
11. B. Korel, “PELAS-Program Error-Locating Assistant System,” IEEE Transactions on Software Engineering SE-14(9) pp. 1253-1260 (September 1988).
12. K.J. Ottenstein and L.M. Ottenstein, “The program dependence graph in a software development environment,” Proceedings of the ACM SIGSOFTISIGPLAN Software Engineering Symposium on Practical Software Development Environments, (Pittsburgh, PA, April 23-25, 1984), ACM SIGPLAN Notices 19(5) pp. 177-184 (May, 1984).
13. T. Reps and W. Yang, “The semantics of program slicing and program integration,” in Proceedings of the Colloquium on Current Issues in Programming Languages, (Barcelona, Spain, Mardi 13-17, 1989), Lecture Notes in Computer Science, Springer-Verlag, New York, NY (March 1989).
14. M. Weiser, “Program slicing,” IEEE Transactions on Software Engineering SE-10(4) pp. 352-357 (July, 1984).