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 …

String constraint solving refers to solving combinatorial problems involving constraints over
string variables. String solving approaches have become popular over the past few years …

We present a new algorithm for solving string constraints. The algorithm builds upon a
recent method for solving word equations and regular constraints that interprets string …

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

We present Z3str4, a new high-performance string SMT solver for a rich quantifier-free first-
order theory of strings and length constraints. These kinds of constraints have found …

String-number conversion is an important class of constraints needed for the symbolic
execution of string-manipulating programs. In particular solving string constraints with string …

Data stored in cloud services is highly sensitive and so access to it is controlled via policies
written in domain-specific languages (DSLs). The expressiveness of these DSLs provides …

We address the satisfiability problem for string constraints that combine relational constraints
represented by transducers, word equations, and string length constraints. This problem is …

The performance of modern Satisfiability Modulo Theories (SMT) solvers relies crucially on
efficient decision procedures as well as static simplification techniques, which include large …

We argue that in string solving, word equations and regular constraints are better mixed
together than approached separately as in most current string solvers. We propose a fast …