Termination Proofs for Logic Programs

1. Front Matter

   PDF

2. Introduction

   Pages 1-5

3. Basic notions

   Pages 6-16

4. Static program properties and transformations

   Pages 17-40

5. Terminating logic programs

   Pages 41-60

6. The problem of local variables

   Pages 61-71

7. And/or dataflow graphs

   Pages 72-84

8. A termination proof procedure

   Pages 85-108

9. Integration of unfolding techniques

   Pages 109-129

10. Conclusions

    Pages 130-131

11. Back Matter

    PDF

Termination proofs constitute a crucial part of program verification. Much research about termination has been done in the context of term rewriting systems. But until now there was little hope that termination proofs for nontrivial programs could be achieved automatically. This book gives a comprehensive discussion of the termination problem in the context of logic programming. Although logic programs pose special difficulties for termination proofs it turns out that automation of this task is obtainable to a much larger degree than for programs in imperative languages. A technique for the automatic derivation of termination proofs is presented in detail. The discussion of several nontrivial examples illustrates its range of applicability. The approach is based on the concept of declarative semantics, and thus makes use of an important feature of logic programming.

• Automat
• Logische Programmierung
• Partielle Auswertung
• Terminierung
• Verifikation
• automation
• linear predicate inequalities
• lineare Prädikatungleichungen
• logic
• logic programs
• partial evaluation
• programming
• semantics
• termination
• verification

Policies and ethics