A dynamic program slice algorithm based on simplified dependence

Dynamic program slice is a program subset which contains variable values affecting some interesting point in program and some controlling predication. This paper presents a dynamic program slicing algorithm which simplifies dependence. The purpose of algorithm is to solve the problem that H. Agrawal´s dynamic slicing is not accurate. The algorithm determines data dependence node, control dependence node and reachable node to calculate variable slice by program path. The experiment results show that it improves precise of dynamic program slicing and reduces complexity of dynamic slicing.