Dynamic program slicing based on dependence relations
- 9 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 191-200
- https://doi.org/10.1109/icsm.1991.160329
Abstract
Dynamic program slicing based on program dependence relations is discussed. The dynamic dependence relations can be generated in parallel with the execution of a program. The only information that is needed is the identification of the statement that is currently being executed, and the current state of the program (variables that are defined or used). This information is used to update the relations and the intermediate dependence information sets that are maintained for each level of nested compound statements. Once these sets have been updated, the program execution information about the current statement can be discarded and space can be reclaimed. An improved technique with space requirements proportional to the nesting depth of compound statements (loops and conditionals) in a program is described.Keywords
This publication has 9 references indexed in Scilit:
- Using automatic program decomposition techniques in software maintenance toolsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Integrating noninterfering versions of programsACM Transactions on Programming Languages and Systems, 1989
- Dynamic program slicingInformation Processing Letters, 1988
- Eliminating go to's while preserving program structureJournal of the ACM, 1988
- Interprocedural slicing using dependence graphsPublished by Association for Computing Machinery (ACM) ,1988
- The program dependence graph and its use in optimizationACM Transactions on Programming Languages and Systems, 1987
- Information-flow and data-flow analysis of while-programsACM Transactions on Programming Languages and Systems, 1985
- Program SlicingIEEE Transactions on Software Engineering, 1984
- Programmers use slices when debuggingCommunications of the ACM, 1982