Inductive Proof Automation for Coq - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2010

Inductive Proof Automation for Coq

Sean Wilson
  • Function : Author
  • PersonId : 871787
Jacques Fleuriot
  • Function : Author
  • PersonId : 871788
Alan Smaill
  • Function : Author
  • PersonId : 871789


We introduce inductive proof automation for Coq that supports reasoning about inductively defined data types and recursively defined functions. This includes support for proofs involving case splits and multiple inductive hypotheses. The automation makes use of the rippling heuristic to guide step case proofs as well as heuristics for generalising goals. We include features for caching lemmas that are found during proof search, where these lemmas can be reused in future proof attempts. We show that the techniques we present provide a high-level of automation for inductive proofs which improves upon what is already available in Coq. We also discuss an algorithm that, by inspecting finished proofs, can identify and then remove irrelevant subformulae from cached lemmas, making the latter more reusable. Finally, we compare our work to related research in the field.
Fichier principal
Vignette du fichier
paper_2.pdf (128.12 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00489496 , version 1 (05-06-2010)


  • HAL Id : inria-00489496 , version 1


Sean Wilson, Jacques Fleuriot, Alan Smaill. Inductive Proof Automation for Coq. Second Coq Workshop, Yves Bertot, Jul 2010, Edinburgh, United Kingdom. ⟨inria-00489496⟩


271 View
311 Download


Gmail Facebook X LinkedIn More