Summary: Monotonic Abstraction in Action
(Automatic Verification of Distributed Mutex Algorithms)
Parosh Aziz Abdulla1
Uppsala University, Sweden
Universit`a di Genova, Italy.
Abstract. We consider verification of safety properties for parameter-
ized distributed protocols. Such a protocol consists of an arbitrary number
of (infinite-state) processes that communicate asynchronously over FIFO
channels. The aim is to perform parameterized verification, i.e., show-
ing correctness regardless of the number of processes inside the system.
We consider two non-trivial case studies: the distributed Lamport and
Ricart-Agrawala mutual exclusion protocols. We adapt the method of
monotonic abstraction that considers an over-approximation of the sys-