Verifying Termination and Error-Freedom of Logic Programs with block Declarations

Details Verifying Termination and Error-Freedom of Logic Programs with block Declarations Verifying Termination and Error-Freedom of Logic Programs with block Declarations

2000-06-23

arxiv.org/abs/cs/0006033v1

Computer Science

Logic in Computer Science

to be published in Theory and Practice of Logic Programming, 40 pages, 10 figures

Scientific paper

We present verification methods for logic programs with delay declarations. The verified properties are termination and freedom from errors related to built-ins. Concerning termination, we present two approaches. The first approach tries to eliminate the well-known problem of speculative output bindings. The second approach is based on identifying the predicates for which the textual position of an atom using this predicate is irrelevant with respect to termination. Three features are distinctive of this work: it allows for predicates to be used in several modes; it shows that block declarations, which are a very simple delay construct, are sufficient to ensure the desired properties; it takes the selection rule into account, assuming it to be as in most Prolog implementations. The methods can be used to verify existing programs and assist in writing new programs.

Affiliated with

Also associated with

No associations

Rating

Verifying Termination and Error-Freedom of Logic Programs with block Declarations 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 Verifying Termination and Error-Freedom of Logic Programs with block Declarations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Verifying Termination and Error-Freedom of Logic Programs with block Declarations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-95891