Dynamic slicing of feature-oriented programs

Abstract

We intend to suggest a dynamic slicing algorithm for feature-oriented programs. We have named our algorithm Execution Trace file Based Dynamic Slicing (ETBDS) algorithm. The ETBDS algorithm constructs an intermediate program representation known as Dynamic Feature-Oriented Dependence Graph (DFDG) based on various dependences exist amongst the program statements. We use an execution trace file to keep the execution history of the program. The dynamic slice is computed by first performing breadth-first or depth-first traversal on the DFDG and then mapping out the resultant nodes to the program statements.