Slicing of Constraint Logic Programs

Details Slicing of Constraint Logic Programs Slicing of Constraint Logic Programs

2000-12-18

arxiv.org/abs/cs/0012014v1

Computer Science

Software Engineering

In M. Ducasse (ed), proceedings of the Fourth International Workshop on Automated Debugging (AADEBUG 2000), August 2000, Munic

Scientific paper

Slicing is a program analysis technique originally developed for imperative languages. It facilitates understanding of data flow and debugging. This paper discusses slicing of Constraint Logic Programs. Constraint Logic Programming (CLP) is an emerging software technology with a growing number of applications. Data flow in constraint programs is not explicit, and for this reason the concepts of slice and the slicing techniques of imperative languages are not directly applicable. This paper formulates declarative notions of slice suitable for CLP. They provide a basis for defining slicing techniques (both dynamic and static) based on variable sharing. The techniques are further extended by using groundness information. A prototype dynamic slicer of CLP programs implementing the presented ideas is briefly described together with the results of some slicing experiments.

Affiliated with

Also associated with

No associations

Rating

Slicing of Constraint Logic Programs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Slicing of Constraint Logic Programs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Slicing of Constraint Logic Programs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-180681