BibTeX
@TECHREPORT{Dutertre06theyices,
author = {Bruno Dutertre and Leonardo De Moura},
title = {The yices smt solver},
institution = {},
year = {2006}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Abstract. SMT stands for Satisfiability Modulo Theories. An SMT solver decides the satisfiability of propositionally complex formulas in theories such as arithmetic and uninterpreted functions with equality. SMT solving has numerous applications in automated theorem proving, in hardware and software verification, and in scheduling and planning problems. This paper describes Yices, an efficient SMT solver developed at SRI International. Yices supports a rich combination of first-order theories that occur frequently in software and hardware modeling: arithmetic, uninterpreted functions, bit vectors, arrays, recursive datatypes, and more. Beyond pure SMT solving, Yices can solve weighted MAX-SMT problems, compute unsatisfiable cores, and construct models. Yices is the main decision procedure used by the SAL model checking environment, and it is being integrated to the PVS theorem prover. As a MAX-SMT solver, Yices is the main component of the probabilistic consistency engine used in SRI’s CALO system. 1
Keyphrases
uninterpreted function numerous application pvs theorem prover beyond pure smt solving automated theorem proving hardware modeling compute unsatisfiable core construct model sri international probabilistic consistency engine satisfiability modulo theory max-smt solver software verification smt solver recursive datatypes weighted max-smt problem main decision procedure first-order theory bit vector efficient smt solver complex formula sal model rich combination calo system main component
