On the computational complexity of dynamic slicing problems for program schemas

Sebastian Danicic, Robert M. Hierons, Michael R. Laurence

Given a program, a quotient can be obtained from it by deleting zero or more statements. The field of program slicing is concerned with computing a quotient of a program which pres…