Grove is a concurrent separation logic library for verifying distributed systems. Grove is the
first to handle time-based leases, including their interaction with reconfiguration, crash …

This paper presents the research undertaken with the goal of designing a consensus
algorithm for cryptocurrencies with less latency than the current state-of-the-art while …

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 …

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 …

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 …

Abstract LibraBFT is a Byzantine Fault Tolerant (BFT) consensus protocol based on HotStuff.
We present an abstract model of the protocol underlying HotStuff/LibraBFT, and formal …

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

Fault-tolerant distributed algorithms such as Reliable Broadcast, Causal Broadcast, Total
Order Broadcast, and Consensus, are at the core of many modern distributed systems …

Threshold automata are a formalism for modeling and analyzing fault-tolerant distributed
algorithms, recently introduced by Konnov, Veith, and Widder, describing protocols executed …