Automated Mathematical Induction

  title={Automated Mathematical Induction},
  author={Adel Bouhoula and Emmanuel Kounalis and Micha{\"e}l Rusinowitch},
  journal={J. Log. Comput.},
Proofs by induction are important in many computer science and artifical intelligence applications, in particular, in program verification and specification systems. We present a new method to prove (and disprove) automatically inductives properties. Given a set of axioms, a well-suited induction scheme is constructed automatically. We call such and induction scheme a test set. Then, for proving a property, we just instantiate it with terms from the test set and apply pure algebraic… 

Customised induction rules for proving correctness of imperative programs

This paper develops a method for automatic construction of customised induction rules for use in a semi-interactive theorem prover and creates an induction rule, in destructor style, that is customised to make the proving of the loop simpler.

Using Induction and Rewriting to Verify and Complete Parameterized Specifications

Austrian-Japanese Workshop on Symbolic Computation in Software Science

A refined system of rewriting induction is presented with an increased capability of non-orientable theorems and a capability of disproving incorrect conjectures.

General Framework for Mechanizing Induction using Test Set

A test set induction procedure which is refutationally complete for conditional specifications (not restricted to Boolean specifications), in that it refutes any conjecture which is not an inductive theorem.

Induction as Deduction Modulo

This paper extends slightly the original version of the deduction modulo framework and provides modularity properties for it and shows how this applies to a uniform understanding of the so called induction by rewriting method and how this relates directly to the general use of an induction principle.

Sufficient Completeness and Parameterized Proofs by Induction

This new method when limited to non-parameterized conditional specifications, can refute general clauses; refutational completeness is also preserved for boolean ground convergent rewrite systems even if the functions are not sufficiently complete and the constructors are not free.

Inductive Theorem Proving in Non-terminating Rewriting Systems and Its Application to Program Transformation

A framework for proving inductive theorems of first-order equational theories, using techniques of implicit induction developed in the field of term rewriting, is presented, which makes use of automated confluence provers as well as a novel condition of sufficient completeness, called localsufficient completeness.

RAPPORT Implicit induction techniques for the verification of PIMa transformational toolkit for compilers

This paper proposes new implicit induction techniques adequate for solving the indicated proof problem for Pim, a transformational toolkit for compilers that consists of the untyped lambda calculus extended with an algebraic rewriting system.

Mechanizable Inductive Proofs for a Class of Forall Exists Formulas

We show how to prove formulas of the form ∀ x∃ yΦ(x, y) in the initial model of an equational variety by using purely algebraic simplifications. This allows to tackle theorems whose proofs requires

Automatic inductive theorem proving and program construction methods using program transformation

  • M. Kabir
  • Computer Science, Mathematics
  • 2007
The use of distillation in the framework of Poitin has eased the automation of the proof and program construction techniques in a reduced search space to make it fully automatic and efficient.



Proof by Induction Using Test Sets

A new method for proving an equational formula by induction is presented, based on the use of the Knuth-Bendix completion procedure for equational theories, which appears to be more practical and efficient than a recently proposed method by Jouannaud and Kounalis.

Proving Properties of Programs by Structural Induction

Some syntactic extensions to Landin's functional programming language ISWIM are suggested which make it easier to program the manipulation of data structures and to develop proofs about such programs.

Proof by Consistency

On proving inductive properties of abstract data types

The equational axioms of an algebraic specification of a data type often can be formed into a convergent set of rewrite rules, which leads to a new method of proof of inductive properties--not requiring the explicit invocation of an inductive rule of inference.

Proving Inductive Theorems Based on Term Rewriting Systems

Modular use of lemmata, already known inductive theorems, is incorporated into the results, and sufficient criteria for an equation to be in the inductive theory of a term rewriting system are given.

Equations and rewrite rules: a survey

The Oyster-Clam System

An interactive proof editor closely based on the Cornell NuPRL system, but implemented in Prolog, which allows the system to be used as a program synthesis environment, since a theorem can be regarded as a speciication which is realised by its extract term.

Proofs by induction in equational theories with constructors

  • G. HuetJ. Hullot
  • Mathematics, Computer Science
    21st Annual Symposium on Foundations of Computer Science (sfcs 1980)
  • 1980

Extensions to the Rippling-Out Tactic for Guiding Inductive Proofs

Testing on harder examples has shown that the rippling-out tactic significantly reduces the search for a proof of a wide variety of theorems, with relatively few cases in which all proofs were pruned.