Synthesis of program fragments from specifications can make programs easier to write and
easier to reason about. To integrate synthesis into programming languages, synthesis …

Proving the equivalence between SQL queries is a fundamental problem in database
research. Existing solvers model queries using algebraic representations and convert such …

We describe a family of decision procedures that extend the decision procedure for
quantifier-free constraints on recursive algebraic data types (term algebras) to support …

Automated synthesis of program fragments from specifications can make programs easier to
write and easier to reason about. To integrate synthesis into programming languages …

We study the computational complexity of existential Presburger arithmetic with (possibly
nested occurrences of) a Kleene-star operator. In addition to being a natural extension of …

Motivated by applications in software verification, we explore automated reasoning about
the non-disjoint combination of theories of infinitely many finite structures, where the theories …

Vector addition systems (VAS), also known as Petri nets, are a popular model of concurrent
systems. Many problems from many areas reduce to the reachability problem for VAS, which …

We discuss two extensions to a recently introduced theory of arrays, which are based on
considerations coming from the model theory of power structures. First, we discuss how the …

We introduce parametric semilinear data logic (pSDL) for reasoning about data words with
numeric data. The logic allows parameters, and Presburger guards on the data and on the …

Logics that involve collections (sets, multisets), and cardinality constraints are useful for
reasoning about unbounded data structures and concurrent processes. To make such logics …