To implement a blockchain, the trend is now to integrate a non-trivial Byzantine fault-tolerant
consensus algorithm instead of the seminal idea of waiting to receive blocks to decide upon …

Verification of fault-tolerant distributed protocols is an immensely difficult task. Often, in these
protocols, thresholds on set cardinalities are used both in the process code and in its …

The verification of asynchronous fault-tolerant distributed systems is challenging due to
unboundedly many interleavings and network failures (eg, processes crash or message …

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

Threshold guards are a basic primitive of many fault-tolerant algorithms that solve classical
problems of distributed computing, such as reliable broadcast, two-phase commit, and …

We present Graft, a generic tool for creating distributed consensus clusters running the Raft
algorithm using state machines in Elixir. Our tool exhibits performance that is comparable to …

TLA+ is a language for formal specification of concurrent and distributed protocols. TLA+ is
extremely concise yet expressive: The language primitives include Booleans, integers …

The need to provide formal guarantees about the behaviour of the algorithms underpinning
modern distributed systems became evident in recent years. This interest made apparent the …

Synchronization primitives for fault-tolerant distributed systems that ensure an effective and
efficient cooperation among processes are an important challenge in the programming …

We present the tool PyLTA, which can model check parameterized distributed algorithms
against LTL specifications. The parameters typically include the number of processes and a …