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 …

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 …

Case split is a core proof rule in current decision procedures for the theory of string
constraints. Its use is the primary cause of the state space explosion in string constraint …

Several new algorithms for deciding emptiness of Boolean combinations of regular
languages and of languages of alternating automata have been proposed recently …

String solvers are automated-reasoning tools that can solve combinatorial problems over
formal languages. They typically operate on restricted first-order logic formulas that include …

When eating spaghetti, one should have the sauce and noodles mixed instead of eating
them separately. We argue that also in string solving, word equations and regular …

This paper is a description of the CVC5 SMT solver as entered into the 2023 SMT
Competition. Here, we briefly summarize the main techniques implemented by CVC5 that …