Abstract: Dynamic slicing is an important approach to analyze, understand and maintain programs, which has been widely used in activities of software engineering and reengineering. In this paper, the existing methods based on graph reachability are firstly analyzed, and a coverage-testing-based method for computing dynamic programs slicing is then presented. The key of this method is to construct a coverage-testing-based dynamic dependence graph (CTDDG), which makes use of both dynamic information and static information to get execution dependencies. Besides efficiency, our approach overcomes the limitations of previous dynamic slicing methods, which have to redo if slicing criterion changes.

Key words: program slicing, dynamic slicing, program analysis, software testing