Performing Implicit Induction Reasoning with Certifying Proof Environments

@inproceedings{Henaien2012PerformingII,
  title={Performing Implicit Induction Reasoning with Certifying Proof Environments},
  author={Amira Henaien and Sorin Stratulat},
  booktitle={SCSS},
  year={2012}
}
Largely adopted by proof assistants, the conventional induction methods based on explicit induction schemas are non-reductive and local, at schema level. On the other hand, the implicit induction methods used by automated theorem provers allow for lazy and mutual induction reasoning. In this paper, we present a new tactic for the Coq proof assistant able to perform automatically implicit induction reasoning. By using an automatic black-box approach, conjectures intended to be manually proved by… 

Figures and Tables from this paper

Mechanically certifying formula-based Noetherian induction reasoning

Structural vs. Cyclic Induction: A Report on Some Experiments with Coq

  • Sorin Stratulat
  • Computer Science
    2016 18th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)
  • 2016
A set of conjectures that can be proved by using cyclic induction and following a similar scenario is defined and it is shown that the scenarios for proving these conjectures with structural induction differ in terms of the number of induction steps and lemmas, as well as proof scenario.

Structural vs. Cyclic Induction

A set of conjectures that can be proved by using cyclic induction and following a similar scenario is defined and it is shown that the scenarios for proving these conjectures with structural induction differ in terms of the number of induction steps and lemmas, as well as proof scenario.

SPIKE, an automatic theorem prover — revisited

  • Sorin Stratulat
  • Computer Science
    2020 22nd International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)
  • 2020
The goal of this paper is to highlight and bring together in one spot the major changes supported by SPIKE since then.

Proof-Based Synthesis of Sorting Algorithms for Trees

Various proof techniques for the synthesis of sorting algorithms on binary trees are developed and used for the automatic synthesis of several algorithms for sorting and for the auxiliary functions, from which few are presented here.

Synthesis of Some Algorithms for Trees : Experiments in Theorema Isabela

Various proof techniques for the synthesis of sorting algorithms on binary trees are developed and used for the automatic synthesis of several algorithms for sorting and for the auxiliary functions, from which few are presented here.

Project-Team Pareo Formal Islands: Foundations and Applications

Formal islands: foundations and applications IN COLLABORATION WITH: Laboratoire lorrain de recherche en informatique et ses applications (LORIA)

Certification des raisonnements formels portant sur des systèmes d'information critiques. (Certifying formal reasoning about critical information systems)

Les preuves par recurrence sont parfaitement adaptees au raisonnement sur des structures de donnees non-bornees, comme par exemple les entiers et les listes, ou, de maniere plus generale, sur des

References

SHOWING 1-10 OF 26 REFERENCES

Integrating Implicit Induction Proofs into Certified Proof Environments

We give evidence of the direct integration and automated checking of implicit induction-based proofs inside certified reasoning environments, as that provided by the Coq proof assistant. This is the

Automated Certification of Implicit Induction Proofs

This work automatically proves and certifies properties about conditional specifications that are proved using automated proof techniques like those employed by the Spike prover, a rewrite-based implicit induction proof system.

A Unified View of Induction Reasoning for First-Order Logic

A new cycle-based induction method that keeps their best features, i.e., performs local and non-reductive reasoning, and naturally fits for mutual and lazy induction.

Lazy Generation of Induction Hypotheses

Analysis of successful induction proofs reveals that these proofs can be guided without reference to a specific induction axiom, which means that required induction hypotheses can be computed during the proof.

A General Framework to Build Contextual Cover Set Induction Provers

This paper presents an abstract inference system uniformly defined in terms of contextual cover sets as a general framework to build implicit induction provers and shows that it generalizes existing cover set induction procedures.

Automating Induction over Mutually Recursive Functions

How the cover set induction method implemented in RRL can be extended to automatically prove inductive properties of mutual recursive functions is discussed and an algorithm for generating cover sets from mutually recursive definitions is given.

Certification of Automated Termination Proofs

This work aims at bridging the gap between proof assistants that yield formal guarantees of reliability and highly automated tools one has to trust, and presents an approach making use of both shallow and deep embeddings.

Incorporating Decision Procedures in Implicit Induction

In this paper we present an approach to integrating reasoning specialists into cover set induction based on constraint contextual rewriting. The approach has been successfully used to incorporate

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.

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.