Parameterized verification

Verification of parameterized programs

Verification of Parameterized Protocols

Recently there has been much interest in the automatic and semi-automatic veri cation of parameterized networks, i.e., veri cation of a family of systems fPi j i 2 !g, where each Pi is a network consisting of i processes. In this paper, we present a method for the veri cation of so-called universal properties of fair parameterized networks of similar processes, that is, properties of the form 8...

Context-Sensitive Parameterized Verification

We present a method for automatic verification of systems with a parameterized number of communicating processes, such as mutual exclusion protocols or agreement protocols. To that end, we present a powerful abstraction framework that uses an efficient and precise symbolic encoding of (infinite) sets of configurations. In particular, it generalizes downward-closed sets that have successfully be...

Environment Abstraction for Parameterized Verification

Many aspects of computer systems are naturally modeled as parameterized systems which renders their automatic verification difficult. In wellknown examples such as cache coherence protocols and mutual exclusion protocols, the unbounded parameter is the number of concurrent processes which run the same distributed algorithm. In this paper, we introduce environment abstraction as a tool for the v...

Monotonic Abstraction in Parameterized Verification

We present a tutorial on verification of safety properties for parameterized systems. Such a system consists of an arbitrary number of processes which are organized in a linear array. The aim is to prove correctness of the system regardless of the number of processes inside the system. We give an overview of the method of monotonic abstraction, which provides an over-approximation of the transi...