Abstract cvc5 is the latest SMT solver in the cooperating validity checker series and builds
on the successful code base of CVC4. This paper serves as a comprehensive system …

Many SMT problems of interest may require the capability of finding models that are optimal
wrt. some objective functions. These problems are grouped under the umbrella term of …

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 …

Abstract Optimization Modulo Theories (OMT OMT) is an extension of SMT which allows for
finding models that optimize given objectives. OptiMathSAT is an OMT solver which allows …

Satisfiability modulo theories (SMT) solvers check the satisfiability of quantifier-free first-
order logic formulae over different theories. We consider the theory of non-linear real …

Abstract The design of Cyber-Physical Systems (CPS) poses a number of challenges, in
particular for cyber-security. Eliciting Security Requirements is a key aspect in the early …

Quantifier-free nonlinear arithmetic (QF_NRA) appears in many applications of satisfiability
modulo theories solving (SMT). Accordingly, efficient reasoning for corresponding …

Incremental linearization is a conceptually simple, yet effective, technique that we have
recently proposed for solving SMT problems over nonlinear real arithmetic constraints. In …

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 …