Dynamic program slicing based on dependence relations

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.<>