Computing Executable Slices for Concurrent Logic Programs

  • Authors:

  • J. Zhao;J. Cheng;K. Ushijima

  • Affiliations:

  • -;-;-

  • Venue:
  • APAQS '01 Proceedings of the Second Asia-Pacific Conference on Quality Software
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

Program Slicing has many applications in softwareengineering activities. However, until recently, no slicing algorithm has been presented that can compute executable slices for concurrent logic programs. In thispaper we present a dependence-graph based approachto computing executable slice for concurrent logic programs. The dependence-based representation used inthis paper is called the Argument Dependence Net whichcan be used to explicitly represent various types of program dependences in a concurrent logic program. Basedon the ADN, we can compute static executable slices forconcurrent logic programs at argument level.