This book presents a technique for the automatic generation of termination proofs for logic programs, which constitute a crucial part of program verification. Several nontrivial examples are discussed.
Lutz Plümer
Automat Logische Programmierung Partielle Auswertung Terminierung Verifikation automation linear predicate inequalities lineare Prädikatungleichungen logic logic programs partial evaluation programming semantics termination verification