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 …

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 …

Solidity smart contract allow developers to formalize financial agreements between users.
Due to their monetary nature, smart contracts have been the target of many high-profile …

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 …

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

A thread-modular proof for the correctness of a concurrent program is based on an inductive
and interference-free annotation of each thread. It is well-known that the corresponding …

Verification of Data-Aware Processes via Satisfiability Modulo Theories Page 1 123 LNBIP 470
Verification of Data-Aware Processes via Satisfiability Modulo Theories Alessandro Gianola …

We consider parameterized verification of concurrent programs under the Total Store Order
(TSO) semantics. A program consists of a set of processes that share a set of variables on …

Structural Invariants for the Verification of Systems with Parameterized Architectures Page 1
Structural Invariants for the Verification of Systems with Parameterized Architectures Marius …

We consider parameterized verification of systems executing according to the total store
ordering (TSO) semantics. The processes manipulate abstract data types over potentially …