Invariant Safety for Distributed Applications

March 07, 2019 Β· Declared Dead Β· πŸ› PaPoC@EuroSys

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Sreeja Nair, Gustavo Petri, Marc Shapiro arXiv ID 1903.02759 Category cs.DC: Distributed Computing Cross-listed cs.DB, cs.FL Citations 3 Venue PaPoC@EuroSys Last Checked 3 months ago
Abstract
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.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Distributed Computing

Died the same way β€” πŸ‘» Ghosted