A New Dynamic Program Slicing Algorithm Based on Abstract Machine

This paper proposes a new dynamic program slicing algorithm taking the advantage of the dynamic program slice technology nowadays. This algorithm uses abstract machine to ascertain the track of program execution, and uses the dependence relations of program statements to cut the program into slices. We compare our program slicing algorithm to others, the analyzable results show that our algorithm has high accuracy and low time and space complexity.