Performing Implicit Induction Reasoning with Certifying Proof Environments - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2012

Performing Implicit Induction Reasoning with Certifying Proof Environments

Résumé

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.
Fichier principal
Vignette du fichier
document.pdf (503.83 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00764909 , version 1 (13-12-2012)

Identifiants

  • HAL Id : hal-00764909 , version 1

Citer

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⟩
185 Consultations
184 Téléchargements

Partager

Gmail Facebook X LinkedIn More