Implementing Reasoning Modules in Implicit Induction Theorem Provers - Archive ouverte HAL Access content directly
Conference Papers Year :

Implementing Reasoning Modules in Implicit Induction Theorem Provers

Abstract

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
Origin : Files produced by the author(s)
Loading...

Dates and versions

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

Identifiers

  • HAL Id : hal-01098933 , version 1

Cite

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
23 View
111 Download

Share

Gmail Facebook Twitter LinkedIn More