Symbolic model checking is an important tool for finding bugs (or proving the absence of
bugs) in modern system designs. Because of this, improving the ease of use, scalability, and …

We consider the problem of certifying the robustness of deep neural networks against real-
world distribution shifts. To do so, we bridge the gap between hand-crafted specifications …

This paper describes Kratos2, a tool for the verification of imperative programs. Kratos2
operates on an intermediate verification language called K2, with a formally-specified …

Abstract Partially-Observable Markov Decision Processes (POMDPs) are a well-known
stochastic model for sequential decision making under limited information. We consider the …

We revisit the symbolic verification of Markov chains with respect to finite horizon
reachability properties. The prevalent approach iteratively computes step-bounded state …

The problem of invariant checking in parametric systems–which are required to operate
correctly regardless of the number and connections of their components–is gaining …

We present a novel verification technique to prove properties of a class of array programs
with a symbolic parameter N denoting the size of arrays. The technique relies on …

Verifying safety and liveness over array systems is a highly challenging problem. Array
systems naturally capture parameterized systems such as distributed protocols with an …

We present VMT-LIB, a language for the representation of verification problems of linear-
time temporal properties on infinite-state symbolic transition systems. VMT-LIB is an …

This article addresses the problem of checking invariant properties for a large class of
symbolic transition systems defined by a combination of SMT theories and quantifiers. State …