We introduce an automated parameterized verification method for fault-tolerant distributed
algorithms (FTDA). FTDAs are parameterized by both the number of processes and the …

Abstract In recent work 10, 12, we have introduced a technique for automatic verification of
threshold-guarded distributed algorithms that have the following features:(1) up to t of …

Blockchain has recently attracted the attention of the industry due, in part, to its ability to
automate asset transfers. It requires distributed participants to reach a consensus on a block …

Counter abstraction is a powerful tool for parameterized model checking, if the number of
local states of the concurrent processes is relatively small. In recent work, we introduced …

Randomized fault-tolerant distributed algorithms pose a number of challenges for automated
verification:(i) parameterization in the number of processes and faults,(ii) randomized …

Parameterized verification of fault-tolerant distributed algorithms has recently gained more
and more attention. Most of the existing work considers asynchronous distributed systems …

Automatic verification of threshold-based fault-tolerant distributed algorithms (FTDA) is
challenging: FTDAs have multiple parameters that are restricted by arithmetic conditions, the …

Counter abstraction is a powerful tool for parameterized model checking, if the number of
local states of the concurrent processes is relatively small. In recent work, we introduced …

We present a formal model of a distributed consensus algorithm in the executable
specification language Promela extended with a new type of guards, called counting guards …

Distributed algorithms have numerous mission-critical applications in embedded avionic
and automotive systems, cloud computing, computer networks, hardware design, and the …