Slicing concurrent logic programs (1997) [9 citations — 4 self]
Abstract:
Program slicing has been widely studied for imperative programs, but for logic programs it is just starting. In this paper we address the problem of slicing concurrent logic programs. To solve this problem, we propose three types of primary program dependences between arguments in concurrent logic programs, named the sharing dependence, communication dependence and unification dependence. We also present a new program representation named the argument dependence net (ADN) for concurrent logic programs to explicitly represent three types of primary program dependences in the programs. Based on the ADN, we formally define various notions about slicing concurrent logic programs and show that our slicing algorithm can produce static slices for concurrent logic programs at argument level.
Citations
| 109 | Measuring Functional Cohesion – Bieman, Ott - 1994 |
| 81 | Incremental program testing using program dependency graphs – Bates, Horiwitz - 1993 |
| 37 | Slicing Concurrent Programs -- A GraphTheoretical Approach – Cheng - 1993 |
| 18 | Synthesis of Directionality Information for Functional Logic Programs – Boye, Paakki, et al. - 1993 |

