Programming-by-Examples (PBE) involves synthesizing an" intended program" from a small
set of user-provided input-output examples. A key PBE strategy has been to restrict the …

Parameterized model checking is an active research field that considers automated
verification of distributed or concurrent systems, for all numbers of participating processes. In …

Distributed algorithms have many mission-critical applications ranging from embedded
systems and replicated databases to cloud computing. Due to asynchronous …

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 …

We present abstract acceleration techniques for computing loop invariants for numerical
programs with linear assignments and conditionals. Whereas abstract interpretation …

While model checking safety of infinite-state systems by inferring state invariants has
steadily improved recently, most verification tools still rely on a technique based on bounded …

Counter abstraction is a powerful tool for parameterized model checking, if the number of
local states of the concurrent processes is relatively small. In recent work, we introduced …

Word equations are a crucial element in the theoretical foundation of constraint solving over
strings. A word equation relates two words over string variables and constants. Its solution …

Transition Power Abstraction (TPA) is a recent symbolic model checking approach that
leverages Craig interpolation to create a sequence of symbolic abstractions for transition …

Loop acceleration can be used to prove safety, reachability, runtime bounds, and (non-)
termination of programs operating on integers. To this end, a variety of acceleration …