Invariant Safety for Distributed Applications

03/07/2019
by   Sreeja Nair, et al.
0

We study a proof methodology for verifying the safety of data invariants of highly-available distributed applications that replicate state. The proof is (1) modular: one can reason about each individual operation separately, and (2) sequential: one can reason about a distributed application as if it were sequential. We automate the methodology and illustrate the use of the tool with a representative example.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/24/2021

Formal Verification of a Distributed Dynamic Reconfiguration Protocol

We present a formal, machine checked TLA+ safety proof of MongoRaftRecon...
research
08/24/2020

Sequential Proof-of-Work for Fair Staking and Distributed Randomness Beacons

We propose a new Proof-of-Stake consensus protocol based on a Sequential...
research
10/20/2017

Verifying Equivalence of Database-Driven Applications

This paper addresses the problem of verifying equivalence between a pair...
research
05/19/2019

Inferring Inductive Invariants from Phase Structures

Infinite-state systems such as distributed protocols are challenging to ...
research
09/28/2022

Verifying Safety of Behaviour Trees in Event-B

Behavior Trees (BT) are becoming increasingly popular in the robotics co...
research
09/14/2021

The concept of class invariant in object-oriented programming

Class invariants – consistency constraints preserved by every operation ...
research
01/19/2018

Just-Right Consistency: reconciling availability and safety

By the CAP Theorem, a distributed data storage system can ensure either ...

Please sign up or login with your details

Forgot password? Click here to reset