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

Distributed protocols have long been formulated in terms of their safety and liveness
properties. Much recent work has focused on automatically verifying the safety properties of …

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 …

Temporal logics for hyperproperties like HyperLTL use trace quantifiers to express
properties that relate multiple system runs. In practice, the verification of such specifications …

We study the classical problem of verifying programs with respect to formal specifications
given in the linear temporal logic (LTL). We first present novel sound and complete …

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 …

Verifying safety and liveness over array systems is a highly challenging problem. Array
systems naturally capture parameterized systems such as distributed protocols with an …

We develop a framework for model checking infinite-state systems by automatically
augmenting them with auxiliary variables, enabling quantifier-free induction proofs for …

While the problem of mechanized proof of liveness of reactive programs has been studied
for decades, there is currently no method of proving liveness that is conceptually simple to …