Distributed protocols such as Paxos play an important role in many computer systems.
Therefore, a bug in a distributed protocol may have tremendous effects. Accordingly, a lot of …

Distributed algorithms have many mission-critical applications ranging from embedded
systems and replicated databases to cloud computing. Due to asynchronous …

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 …

Proof automation can substantially increase productivity in formal verification of complex
systems. However, unpredictablility of automated provers in handling quantified formulas …

Our increasing dependence on complex and critical information infrastructures and the
emerging threat of sophisticated attacks, ask for extended efforts to ensure the correctness …

Consensus algorithms are fundamental building blocks for fault-tolerant distributed systems
and their correctness is critical. However, there are currently no fully-automated methods for …

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 …

We develop a new technique for verifying temporal properties of infinite-state (distributed)
systems. The main idea is to reduce the temporal verification problem to the problem of …

We propose a general semantics for strategic abilities of agents in asynchronous systems,
with and without perfect information. Based on the semantics, we show some general …

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 …