Implementing Reasoning Modules in Implicit Induction Theorem Provers - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2014

Implementing Reasoning Modules in Implicit Induction Theorem Provers

Résumé

We detail the integration in SPIKE, an implicit induction theorem prover, of two reasoning modules operating over naturals combined with interpreted symbols. The first integration schema is à la Boyer-Moore, based on the combination of a congruence closure procedure with a decision procedure for linear arithmetic over rationals/reals. The second follows a 'black-box' approach and is based on external SMT solvers. It is shown that the two extensions significantly increase the power of SPIKE; their performances are compared when proving a non-trivial application.
Fichier principal
Vignette du fichier
synasc2014_submission_87 (1).pdf (289.12 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01098933 , version 1 (30-12-2014)

Identifiants

  • HAL Id : hal-01098933 , version 1

Citer

Sorin Stratulat. Implementing Reasoning Modules in Implicit Induction Theorem Provers. International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2014), Sep 2014, Timisoara, Romania. ⟨hal-01098933⟩

Collections

UNIV-LORRAINE
26 Consultations
120 Téléchargements

Partager

Gmail Facebook X LinkedIn More