Computing executable slices for concurrent logic programs
Jianjun Zhao, J. Cheng, K. Ushijima · 2002
Program slicing has many applications in software engineering activities. However, until recently, no slicing algorithm has been presented that can compute executable slices for concurrent logic programs. We present a dependence-graph based approach to computing executable slices for concurrent logic programs. The dependence-based representation used in the paper is called the Argument Dependence Net which can be used to explicitly represent various types of program dependences in a concurrent logic program. Based on the ADN, we can compute static executable slices for concurrent logic programs at argument level.