Symbolic program analysis techniques rely on satisfiability-checking constraint solvers,
while quantitative program analysis techniques rely on model-counting constraint solvers …

In this work, we consider the satisfiability problem in a logic that combines word equations
over string variables denoting words of unbounded lengths, regular languages to which …

The theory of strings supported by solvers in formal methods contains a large number of
operators. Instead of implementing a semi-decision procedure that reasons about all the …

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 …

Mata is a well-engineered automata library written in C++ that offers a unique combination of
speed and simplicity. It is meant to serve in applications such as string constraint solving and …

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 …

Modern software engineering revolves around distributed applications. From IoT networks to
client-server infrastructures, the application code is increasingly being divided into separate …

The increased interest in string solving in the recent years has made it very hard to identify
the right tool to address a particular user's purpose. Firstly, there is a multitude of string …

In recent years, dynamic languages, such as JavaScript or Python, have been increasingly
used in a wide range of fields and applications. Their tricky and misunderstood behaviors …

Case split is a core proof rule in current decision procedures for the theory of string
constraints. Its use is the primary cause of the state space explosion in string constraint …