Quantified first-order formulas, often with quantifier alternations, are increasingly used in the
verification of complex systems. While automated theorem provers for first-order logic are …

Reliable broadcast is a communication primitive guaranteeing, intuitively, that all processes
in a distributed system deliver the same set of messages. The reason why this primitive is …

We provide a suite of impossibility results and lower bounds for the required number of
processes and rounds for synchronous consensus under transient link failures. Our results …

We introduce an automated parameterized verification method for fault-tolerant distributed
algorithms (FTDA). FTDAs are parameterized by both the number of processes and the …

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 …

Fault-tolerant distributed algorithms are notoriously hard to get right. In this paper we
introduce an automated method that helps in that process: the designer provides …

Algebraic data types (ADTs) are a construct classically found in functional programming
languages that capture data structures like enumerated types, lists, and trees. In recent …

Fault-tolerant distributed algorithms are central for building reliable, spatially distributed
systems. In order to ensure that these algorithms actually make systems more reliable, we …

We present a novel partially synchronous system model, which augments the asynchronous
model by a (possibly unknown) bound Θ on the ratio of longest and shortest end-to-end …

Various verification techniques for temporal properties transform temporal verification to
safety verification. For infinite-state systems, these transformations are inherently imprecise …