veriT: an open, trustable and efficient SMT-solver

Abstract : This article describes the first public version of the satisfiability modulo theory (SMT) solver {\verit}. It is open-source, proof-producing, and complete for quantifier-free formulas with uninterpreted functions and difference logic on real numbers and integers.
Document type :
Conference papers
Complete list of metadatas

https://hal.inria.fr/inria-00430634
Contributor : Pascal Fontaine <>
Submitted on : Monday, November 9, 2009 - 12:49:28 PM
Last modification on : Thursday, January 11, 2018 - 6:19:52 AM

Links full text

Identifiers

Collections

Citation

Thomas Bouton, Diego Caminha B. de Oliveira, David Déharbe, Pascal Fontaine. veriT: an open, trustable and efficient SMT-solver. 22nd International Conference on Automated Deduction - CADE 22, Aug 2009, Montreal, Canada. pp.151-156, ⟨10.1007/978-3-642-02959-2_12⟩. ⟨inria-00430634⟩

Share

Metrics

Record views

152