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

This tutorial provides a programmer's introduction to the Satisfiability Modulo Theories
Solver Z3. It describes how to use Z3 through scripts, provided in the Python scripting …

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

Many problems in program analysis, verification, and synthesis require inferring
specifications of unknown procedures. Motivated by a broad range of applications, we …

We study Satisfiability Modulo Theories (SMT) enriched with the so-called Ramsey
quantifiers, which assert the existence of cliques (complete graphs) in the graph induced by …

All known quantifier elimination procedures for Presburger arithmetic require doubly
exponential time for eliminating a single block of existentially quantified variables. It has …

We propose a fully-automated technique for inverting functional programs that operate over
lists such as string encoders and decoders. We consider programs that can be modeled …

Symbolic finite automata and transducers augment classic automata and transducers with
symbolic alphabets represented as parametric theories. This extension enables to succinctly …

Monadic decomposability is a notion of variable independence, which asks whether a given
formula in a first-order theory is expressible as a Boolean combination of monadic …

String-manipulating programs are an important class of programs with applications in
malware detection, graphics, input sanitization for Web security, and large-scale HTML …