Invariant Safety for Distributed Applications

03/07/2019

∙

by   Sreeja Nair, et al.

∙

0

∙

share

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.