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

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 …

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 …

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 …

In this paper, we propose a decision procedure for a class of string-manipulating programs
which includes not only a wide range of string operations such as concatenation, replaceAll …

Parikh's Theorem is a fundamental result in automata theory with numerous applications in
computer science. These include software verification (eg infinite-state verification, string …

The theory of arrays has been widely investigated. But concatenation, an operator that
consistently appears in specifications of functional-correctness verification tools (eg, Dafny …

In modern programming languages, more and more functionalities, such as reflection and
data interchange, rely on string values. String analysis statically computes the set of string …

Sequence theories are an extension of theories of strings with an infinite alphabet of letters,
together with a corresponding alphabet theory (eg linear integer arithmetic). Sequences are …

Abstract z3-Noodler is a fork of z3 that replaces its string theory solver with a custom solver
implementing the recently introduced stabilization-based algorithm for solving word …