Programs with arrays are ubiquitous. Automated reasoning about arrays necessitates
discovering properties about ranges of elements at certain program points. Such properties …

TRICERA is an automated, open-source verification tool for C programs based on the
concept of Constrained Horn Clauses (CHCs). In order to handle programs operating on …

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

Automated program verification is a difficult problem. It is undecidable even for transition
systems over Linear Integer Arithmetic (LIA). Extending the transition system with theory of …

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

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 …

We present a full-program induction technique for proving (a sub-class of) quantified as well
as quantifier-free properties of programs manipulating arrays of parametric size N. Instead of …

A thread-modular proof for the correctness of a concurrent program is based on an inductive
and interference-free annotation of each thread. It is well-known that the corresponding …

We develop a framework for model checking infinite-state systems by automatically
augmenting them with auxiliary variables, enabling quantifier-free induction proofs for …

Precondition inference is an important problem with many applications. Existing
precondition inference techniques for programs with arrays have limited ability to find and …