haRVey: combining reasoners

David Déharbe 1 Pascal Fontaine 2
2 MOSEL - Proof-oriented development of computer-based systems
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : We present the architecture of the oncoming version of the SMT (Satisfiability Modulo Theories) solver haRVey. haRVey checks the satisfiability of a formula written in a first-order language with interpreted symbols from various theories. Its new architecture is original, first in the sense that it is a combination of reasoners, rather than the traditional combination of decision procedures. Second, one of these reasoners is a full-featured first-order saturation-based prover. Finally, some of those reasoners in the combination may only be sporadically activated not using computer time when inactive. We believe those new features will contribute to the efficiency and expressivity of the new version of the tool.
Document type :
Conference papers
Complete list of metadatas

https://hal.inria.fr/inria-00091662
Contributor : Stephan Merz <>
Submitted on : Wednesday, September 6, 2006 - 7:14:28 PM
Last modification on : Thursday, January 11, 2018 - 6:19:52 AM
Long-term archiving on : Thursday, September 20, 2012 - 10:21:04 AM

Identifiers

  • HAL Id : inria-00091662, version 1

Collections

Citation

David Déharbe, Pascal Fontaine. haRVey: combining reasoners. Automatic Verification of Critical Systems - AVoCS 2006, Sep 2006, Nancy/France, pp.152-156. ⟨inria-00091662⟩

Share

Metrics

Record views

158

Files downloads

180