Trending Bestseller

Termination Proofs for Logic Programs

No reviews yet Write a Review
Paperback / softback
24 July 1990
$121.54
Ships in 3-5 business days

Delivery estimate

Hurry up! Current stock:
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.

You Can Find This Title In

    Product Details
    ISBN-13
    9783540528371
    Author
    Lutz Plümer
    Publisher
    Springer Nature B.V.
    Published
    24 July 1990
    Format
    Paperback / softback

    This product hasn't received any reviews yet. Be the first to review this product!

    $121.54
    Ships in 3-5 business days

    Delivery estimate

    Hurry up! Current stock:

    Termination Proofs for Logic Programs

    $121.54

    Description

    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.

    You Can Find This Title In

      This Title Is Categorised As