This tutorial provides a programmer's introduction to the Satisfiability Modulo Theories
Solver Z3. It describes how to use Z3 through scripts, provided in the Python scripting …

Nonlinear integer constraints are common and difficult in the verification and analysis of
software/hardware. SMT (QF_NIA) generalizes such constraints, which is a boolean …

Satisfiability Modulo Theories (SMT) is the problem of deciding the satisfiability of a first-
order formula with respect to some theory or combination of theories; Verification Modulo …

The theory of arithmetic is integral to many uses of SMT solvers. Z3 has implemented native
solvers for arithmetic reasoning since its first release. We present a full re-implementation of …

Satisfiability Modulo Theory (SMT) generalizes the propositional satisfiability problem (SAT)
by extending support for various first-order background theories. In this paper, we focus on …

Modular combination of theory solvers is an integral theme in engineering modern SMT
solvers. The CDCL (T) architecture provides an overall setting for how theory solvers may …

Many SMT solvers implement efficient SAT-based procedures for solving fixed-size bit-
vector formulas. These approaches, however, cannot be used directly to reason about bit …

The state of the art for bit-precise reasoning in the context of Satisfiability Modulo Theories
(SMT) is a SAT-based technique called bit-blasting where the input formula is first simplified …

SMT solvers use sophisticated techniques for polynomial (linear or non-linear) integer
arithmetic. In contrast, non-polynomial integer arithmetic has mostly been neglected so far …

In the last few years there have been rapid developments in SMT solving for finite fields.
These include new decision procedures, new implementations of SMT theory solvers, and …