Abstract Model checking is a computer-assisted method for the analysis of dynamical
systems that can be modeled by state-transition systems. Drawing from research traditions in …

While reactive synthesis and syntax-guided synthesis (SyGuS) have seen enormous
progress in recent years, combining the two approaches has remained a challenge. In this …

This article presents resource-guided synthesis, a technique for synthesizing recursive
programs that satisfy both a functional specification and a symbolic resource bound. The …

We develop abstract learning frameworks for synthesis that embody the principles of the
CEGIS (counterexample-guided inductive synthesis) algorithms in current literature. Our …

We study algorithmic questions for concurrent systems where the transitions are labeled
from a complete, closed semiring, and path properties are algebraic with semiring …

Rely-guarantee (RG) logic uses thread interference specifications (relies and guarantees) to
reason about the correctness of multithreaded software. Unfortunately, RG logic requires …

Opacity is a general framework modeling security properties of systems interacting with a
passive attacker. Initial-and-final-state opacity (IFO) generalizes the classical notions of …

We study algorithmic questions wrt algebraic path properties in concurrent systems, where
the transitions of the system are labeled from a complete, closed semiring. The algebraic …

Graph analytics elicits insights from large graphs to inform critical decisions for business,
safety and security. Several large-scale graph processing frameworks feature efficient …

We introduce and study pawn games, a class of two-player zero-sum turn-based graph
games. A turn-based graph game proceeds by placing a token on an initial vertex, and …