Termination Proofs for Logic Programs
(Sprache: Englisch)
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...
Leider schon ausverkauft
versandkostenfrei
Buch
64.19 €
32 DeutschlandCard Punkte
sammeln
- Lastschrift, Kreditkarte, Paypal, Rechnung
- Kostenlose Rücksendung
- Ratenzahlung möglich
Produktdetails
Produktinformationen zu „Termination Proofs for Logic Programs “
Klappentext zu „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 comprehensive discussion of the termination problem in the context of logic programming. Although logic programs pose specialdifficulties 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.
Inhaltsverzeichnis zu „Termination Proofs for Logic Programs “
Basic notions.- Static program properties and transformations.- Terminating logic programs.- The problem of local variables.- And/or dataflow graphs.- A termination proof procedure.- Integration of unfolding techniques.- Conclusions.
Bibliographische Angaben
- Autor: Lutz Plümer
- 1990, 1990., 142 Seiten, Maße: 15,5 x 23,5 cm, Kartoniert (TB), Englisch
- Verlag: Springer
- ISBN-10: 3540528377
- ISBN-13: 9783540528371
- Erscheinungsdatum: 24.07.1990
Sprache:
Englisch
Kommentar zu "Termination Proofs for Logic Programs"
0 Gebrauchte Artikel zu „Termination Proofs for Logic Programs“
| Zustand | Preis | Porto | Zahlung | Verkäufer | Rating |
|---|
Schreiben Sie einen Kommentar zu "Termination Proofs for Logic Programs".
Kommentar verfassen