Byzantine fault-tolerant algorithms promise agreement on a correct value, even if a subset of
processes can deviate from the algorithm arbitrarily. While these algorithms provide strong …

Proving the correctness of a distributed protocol is a challenging endeavor. Central to this
task is finding an inductive invariant for the protocol. Currently, automated invariant …

TLA+ is a language for formal specification of all kinds of computer systems. System
designers use this language to specify concurrent, distributed, and fault-tolerant protocols …

Asynchronous programs are notoriously difficult to reason about because they spawn
computation tasks which take effect asynchronously in a nondeterministic way. Devising …

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 …

The last decade has sparked several valiant efforts in deductive verification of distributed
agreement protocols such as consensus and leader election. Oddly, there have been far …

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

Inspired by distributed applications that use consensus or other agreement protocols for
global coordination, we define a new computational model for parameterized systems that is …

Threshold automata are a formalism introduced for modeling, verification, and synthesis of
fault-tolerant distributed algorithms for asynchronous systems, that is, in interleaving …

This paper presents a foundation for refining concurrent programs with structured control
flow. The verification problem is decomposed into subproblems that aid interactive program …