Termination proofs for logic programs /
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 compreh...
| Main Author: | |
|---|---|
| Corporate Author: | |
| Format: | eBook |
| Language: | English |
| Published: |
Berlin ; New York :
Springer-Verlag,
©1990.
|
| Series: | Lecture notes in computer science ;
446. Lecture notes in computer science. Lecture notes in artificial intelligence. |
| Subjects: | |
| Online Access: | Connect to the full text of this electronic book |
| Summary: | 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. |
|---|---|
| Item Description: | Revised version of author's thesis. Electronic resource. |
| Physical Description: | 1 online resource (viii, 142 pages) : illustrations. |
| Format: | Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002. |
| Bibliography: | Includes bibliographical references (pages 132-139) and index. |
| ISBN: | 9783540471639 (electronic bk.) 3540471634 (electronic bk.) |