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 …

String analysis is the problem of reasoning about how strings are manipulated by a program.
It has numerous applications including automatic detection of cross-site scripting, and …

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 …

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 describe a uniform and efficient framework for checking the satisfiability of a large class
of string constraints. The framework is based on the observation that both satisfiability and …

Theories over strings are among the most heavily researched logical theories in the SMT
community in the past decade, owing to the error-prone nature of string manipulations …