Modern clouds depend crucially on an extensible ecosystem of thousands of controllers,
each managing critical systems (eg, a ZooKeeper cluster). A controller continuously …

Formal verification is a promising approach to eliminate bugs at compile time, before they
ship. Indeed, our community has verified a wide variety of system software. However, much …

Distributed systems are notoriously hard to implement correctly due to non-determinism.
Finding the inductive invariant of the distributed protocol is a critical step in verifying the …

Distributed systems are complex and difficult to build correctly. Formal verification can
provably rule out bugs in such systems, but finding an inductive invariant that implies the …

Ivy is a multi-modal verification tool for correct design and implementation of distributed
protocols and algorithms, supporting modular specification, implementation and proof. Ivy …

This paper surveys the work to date on Ivy, a language and a tool for the formal specification
and verification of distributed systems. Ivy supports deductive verification using automated …

To verify distributed systems, prior work introduced a methodology for verifying both the
code running on individual machines and the correctness of the overall system when those …

We present pretend synchrony, a new approach to verifying distributed systems, based on
the observation that while distributed programs must execute asynchronously, we can often …

This paper presents a formulation of multiparty session types (MPSTs) for practical fault-
tolerant distributed programming. We tackle the challenges faced by session types in the …

Concurrent and distributed programming is notoriously hard. Modern languages and toolkits
ease this difficulty by offering message-passing abstractions, such as actors (eg, Erlang …