Skip to Main content Skip to Navigation
Conference papers

Performing Implicit Induction Reasoning with Certifying Proof Environments

Abstract : 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 the certifying proof environment that integrates Coq are proved instead by the Spike implicit induction theorem prover. The resulting proofs are translated afterwards into certified Coq scripts.
Complete list of metadata

Cited literature [23 references]  Display  Hide  Download
Contributor : Sorin Stratulat Connect in order to contact the contributor
Submitted on : Thursday, December 13, 2012 - 4:01:20 PM
Last modification on : Wednesday, February 2, 2022 - 4:45:19 PM
Long-term archiving on: : Sunday, December 18, 2016 - 12:50:53 AM


Files produced by the author(s)


  • HAL Id : hal-00764909, version 1



Amira Henaien, Sorin Stratulat. Performing Implicit Induction Reasoning with Certifying Proof Environments. SCSS'2012 - 4th International Symposium on Symbolic Computation in Software Science, Dec 2012, Gammarth, Tunisia. ⟨hal-00764909⟩



Record views


Files downloads