Invariant Safety for Distributed Applications [article]

Sreeja Nair
2019 arXiv   pre-print
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.
arXiv:1903.02759v1 fatcat:ajc2fq3tw5bcpjjxzcpoen7hca