We implement finite transducers in a new fast and simple automata library Mata. Finite
transducers are finite state machines modelling rational relations. Our primary use case for …

In recent years, string solvers have become an essential component in many formal-
verification, security-analysis and bug-finding tools. Such solvers typically support a theory …

With the ever-growing dependency on software, testing for their unexpected behavior is as
important as verifying for their known properties, to avoid potential losses. Existing software …

Data streams arise in a variety of applications, such as feeds from financial markets, event
streams from sensors and medical devices, logs produced by long-running programs, click …

Improper string manipulations are an important cause of software defects, which make them
a target for program analysis by hackers and developers alike. Symbolic execution based …

In this thesis we develop a practical and scalable approach for dynamic symbolic execution
(DSE) of JavaScript programs and prove its effectiveness by implementing ExpoSE, our new …

Strings are ubiquitous in code. Not all strings are created equal, some contain structure that
makes them incompatible with other strings. CSS units are an obvious example. Worse, type …

An increasing number of applications in verification and security rely on or could benefit from
automatic solvers that can check the satisfiability of constraints over a rich set of data types …

This is a brief overview of the string solver Z3-Noodler1 entering SMT-comp 2023. It is based
on the SMT solver Z3 [1] in which it replaces the solver for the theory of strings. It is built …

Software systems are deeply involved in diverse human activities as everyone uses a variety
of software systems on a daily basis. It is essential to guarantee that software systems all …