Name
Abstract | ||
|---|---|---|
Production distributed systems are challenging to formally verify, in particular when they are based on distributed protocols that are not rigorously described or fully understood. In this paper, we derive models and properties for two core distributed protocols used in eventually consistent production key-value stores such as Riak and Cassandra. We propose a novel modeling called certified program models, where complete distributed systems are captured as programs written in traditional systems languages such as concurrent C. Specifically, we model the read-repair and hinted-handoff recovery protocols as concurrent C programs, test them for conformance with real systems, and then verify that they guarantee eventual consistency, modeling precisely the specification as well as the failure assumptions under which the results hold. |
Year | Venue | Field |
|---|---|---|
2017 | arXiv: Distributed, Parallel, and Cluster Computing | Eventual consistency,Computer science,Certified program,Real systems,Distributed computing |
DocType | Volume | Citations |
Journal | abs/1712.10056 | 0 |
PageRank | References | Authors |
0.34 | 10 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Edgar Pek | 1 | 4 | 1.49 |
| Pranav Garg | 2 | 95 | 4.76 |
| Muntasir Raihan Rahman | 3 | 455 | 21.21 |
| Karl Palmskog | 4 | 21 | 5.19 |
| Indranil Gupta | 5 | 1837 | 143.92 |
| P. Madhusudan | 6 | 4498 | 188.75 |