Yices is an SMT solver developed by SRI International. The first version of Yices was
released in 2006 and has been continuously updated since then. In 2007, we started a …

Object-relational mapping libraries are a popular way for applications to interact with
databases because they provide transparent access to the database using the same …

Proof production for SMT solvers is paramount to ensure their correctness independently
from implementations, which are often prohibitively difficult to verify. Historically, however …

SMT solvers have been used successfully as reasoning engines for automated verification.
Current techniques for dealing with quantified formulas in SMT are generally incomplete …

In this article, we propose an automated standard cell synthesis framework, SP&R, which
simultaneously solves P&R without deploying any sequential/separate operations, by a …

We present a framework for processing formulas in automatic theorem provers, with
generation of detailed proofs. The main components are a generic contextual recursion …

ProB provides a constraint solver for the B-method written in Prolog and can make use of
different backends based on SAT and SMT solving. One such backend translates B and …

We present a simple resolution-based proof format targeted for SMT. The proof format uses
a syntax similar to SMT-LIB terms. The resolution rule is its only proof rule with premises; all …

SMT solvers are fundamental tools for reasoning about constraints in practical problems like
symbolic execution and program synthesis. Faster SMT solving can improve the …

We introduce the first program synthesis engine implemented inside an SMT solver. We
present an approach that extracts solution functions from unsatisfiability proofs of the …