A Improved Algorithm for Forward Computation of Dynamic Program Slice

Dynamic program slice with respect to a variable of interest at some execution position contains only those statements that actually had an influence on this variable. It has been widely used in many software activities, such as debugging, testing and software maintenance. In this paper, we present a dynamic program slicing algorithm based on forward analysis. In this method, dynamic slices are computed during program execution without major recording of the execution trace. Moreover, it improved the precision of the dynamic program slice, the space complexity is bounded as opposed to the backward methods of slice, it is easy to realize. The experiment has proved that the method is effective.