Abstract cvc5 is the latest SMT solver in the cooperating validity checker series and builds
on the successful code base of CVC4. This paper serves as a comprehensive system …

Mobile applications have become a ubiquitous part of our daily life, providing users with
access to various services and utilities. Text input, as an important interaction channel …

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

We extend the data-driven approach to inferring preconditions for code from a set of test
executions. Prior work requires a fixed set of features, atomic predicates that define the …

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

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

Symbolic automata and transducers extend finite automata and transducers by allowing
transitions to carry predicates and functions over rich alphabet theories, such as linear …

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 …

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 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 …