3 research outputs found
Invariant Safety for Distributed Applications
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.Comment: Workshop on Principles and Practice of Consistency for Distributed
Data (PaPoC), Mar 2019, Dresden, Germany.
https://novasys.di.fct.unl.pt/conferences/papoc19
Invariant Safety for Distributed Applications
International audienceWe 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
Invariant Safety for Distributed Applications
International audienceWe 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