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 …

Most common vulnerabilities in Web applications are due to string manipulation errors in
input validation and sanitization code. String constraint solvers are essential components of …

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 version 1.0 of the Norn SMT solver for string constraints. Norn is a solver for an
expressive constraint language, including word equations, length constraints, and regular …

The manipulation of raw string data is ubiquitous in security-critical software, and verification
of such software relies on efficiently solving string and regular expression constraints via …

Symbolic execution is a systematic technique for checking programs, which forms a basis for
various software testing and verification techniques. It provides a powerful analysis in …

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 an automated approach for detecting and quantifying side channels in Java
programs, which uses symbolic execution, string analysis and model counting to compute …

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 …