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

Regular expressions are a classical concept in formal language theory. Regular
expressions in programming languages (RegEx) such as JavaScript, feature non-standard …

The design and implementation of decision procedures for checking path feasibility in string-
manipulating programs is an important problem, with such applications as symbolic …

We present a novel length-aware solving algorithm for the quantifier-free first-order theory
over regex membership predicate and linear arithmetic over string length. We implement …

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 …

Widespread use of string solvers in the formal analysis of string-heavy programs has led to a
growing demand for more efficient and reliable techniques which can be applied in this …

The theory of strings with concatenation has been widely argued as the basis of constraint
solving for verifying string-manipulating programs. However, this theory is far from adequate …

We introduce TRAU, an SMT solver for an expressive constraint language, including word
equations, length constraints, context-free membership queries, and transducer constraints …

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 …

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