✦ LIBER ✦

Inductive Theorem Proving for Design Specifications

✍ Scribed by PETER PADAWITZ

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 985 KB
Volume: 21
Category: Article
ISSN: 0747-7171
DOI: 10.1006/jsco.1996.0003

No coin nor oath required. For personal study only.

✦ Synopsis

We present a number of new results on inductive theorem proving for design specifications based on Horn logic with equality. Induction is explicit here because induction orderings are supposed to be part of the specification. We show how the automatic support for program verification is enhanced if the specification satisfies a bunch of rewrite properties, summarized under the notion of canonicity. The enhancement is due to inference rules and corresponding strategies whose soundness is implied by the specification's canonicity. The second main result of the paper provides a method for proving canonicity by using the same rules, which are applied in proofs of conjectures about the specification and the functional-logic programs it contains.

📜 SIMILAR VOLUMES

Automated Theorem Proving by Test Set In

Automated Theorem Proving by Test Set Induction

✍ ADEL BOUHOULA 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 825 KB

Test set induction is a goal-directed proof technique which combines the full power of explicit induction and proof by consistency. It works by computing an appropriate explicit induction scheme called a test set, to trigger the induction proof, and then applies a refutation principle using proof by

Automated theorem proving for Łukasiewic

Automated theorem proving for Łukasiewicz logics

✍ Gordon Beavers 📂 Article 📅 1993 🏛 Springer Netherlands 🌐 English ⚖ 650 KB

Summation theorem for inductive dimensio

Summation theorem for inductive dimensions

✍ S. V. Kotkin 📂 Article 📅 1992 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 409 KB

Automated theorem proving for non-classi

Automated theorem proving for non-classical logics

📂 Article 📅 1993 🏛 Springer Netherlands 🌐 English ⚖ 14 KB

Automated Design of Circuits from Recurs

Automated Design of Circuits from Recursion Equations Using Theorem-Proving Technique

✍ Masateru Harao; Kouji Iwanuma 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 908 KB

## Abstract This paper aims at establishing the automated design for a circuit by the theorem‐proving technique, by formulating the circuit design as a transformation from the specification description (recursion equation) to the circuit model FN (functional network based on dataflow operation). F

Theorem Proving Techniques for View Dele

Theorem Proving Techniques for View Deletion in Databases

✍ Chandrabose Aravindan; Peter Baumgartner 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 454 KB

In this paper, we show how techniques from first-order theorem proving can be used for efficient deductive database updates. The key idea is to transform the given database, together with the update request, into a (disjunctive) logic program and to apply the hyper-tableau calculus (Baumgartner et a