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

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 …

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

Correctness of multi-threaded programs typically requires that they satisfy liveness
properties. For example, a program may require that no thread is starved of a shared …

In this paper, we present a new approach to automatically verify multi-threaded programs
which are executed by an unbounded number of threads running in parallel. The starting …

We consider parameterized verification of systems executing according to the total store
ordering (TSO) semantics. The processes manipulate abstract data types over potentially …

Counting arguments are among the most basic proof methods in mathematics. Within the
field of formal verification, they are useful for reasoning about programs with infinite control …

Abstract Model Checking Modulo Theories is a recent approach for the automated
verification of safety properties of a class of infinite state systems manipulating arrays, called …

Parameterized programs are composed of an arbitrary number of concurrent, infinite-state
threads. Automated safety and liveness proofs of such parameterized software are hard; …

In this paper, we present the formal modeling and automatic parameterized verification of a
distributed air traffic control protocol called the Small Aircraft Transportation System (SATS) …