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 …

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

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 …

Proving that an unbounded distributed protocol satisfies a given safety property amounts to
finding a quantified inductive invariant that implies the property for all possible instance …

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 …

Many invariant inference techniques reason simultaneously about states and predicates,
and it is well-known that these two kinds of reasoning are in some sense dual to each other …

Lamport's celebrated Paxos consensus protocol is generally viewed as a complex hard-to-
understand algorithm. Notwithstanding its complexity, in this paper, we take a step towards …

Understanding and debugging the performance of distributed systems is a notoriously hard
task, but a critical one. Traditional techniques like logging, tracing, and benchmarking …

Loops with multiple phases are challenging to verify because they require disjunctive
invariants. Invariants could also have the form of implication between a precondition for the …

We present a PDR/IC3 algorithm for finding inductive invariants with quantifier alternations.
We tackle scalability issues that arise due to the large search space of quantified invariants …