An efficient method for computing dynamic program slices
We propose an efficient method for computing dynamic slices of programs. Our method is based on construction of data dependence edges of program dependence graph at run-time. We introduce the concept of compact dynamic dependence graphs (CDDGs) of programs. We show computation of dynamic slices using CDDGs to be more efficient than existing methods. (C) 2002 Elsevier Science B.V. All rights reserved.
program slicing dynamic slicing program dependence graph static slicing control flow graph program debugging