Termination Proofs for Logic Programs
Lutz Plumer
€ 64.11
FREE Delivery in Ireland
Description for Termination Proofs for Logic Programs
Paperback. Presents a technique for the automatic generation of termination proofs for logic programs, which constitute a crucial part of program verification. This book discusses several nontrivial examples. Series: Lecture Notes in Computer Science. Num Pages: 150 pages, biography. BIC Classification: UMX; UYQ. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. Dimension: 235 x 155 x 8. Weight in Grams: 510.
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 ... Read more
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 ... Read more
Product Details
Format
Paperback
Publication date
1990
Publisher
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG Germany
Number of pages
150
Condition
New
Series
Lecture Notes in Computer Science
Number of Pages
142
Place of Publication
Berlin, Germany
ISBN
9783540528371
SKU
V9783540528371
Shipping Time
Usually ships in 15 to 20 working days
Ref
99-15
Reviews for Termination Proofs for Logic Programs