veriT: an open, trustable and efficient SMT-solver - Archive ouverte HAL Access content directly
Conference Papers Year : 2009

veriT: an open, trustable and efficient SMT-solver

(1) , (1) , (2) , (1)
1
2

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.

Dates and versions

inria-00430634 , version 1 (09-11-2009)

Identifiers

Cite

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⟩
103 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More