Loading...
Please wait, while we are loading the content...
Similar Documents
Synchronous Verification of Asynchronous Distributed Programs
| Content Provider | Semantic Scholar |
|---|---|
| Author | Gleissenthall, Klaus Von |
| Copyright Year | 2018 |
| Abstract | We present pretend synchrony, a new approach to verifying distributed systems, based on the observation that while distributed programs must execute asynchronously, we can often soundly treat them as if they were synchronous when verifying their correctness. To do so, we compute a synchronization, a semantically equivalent program where all sends, receives, and message buffers, have been replaced by simple assignments, yielding a program that can be verified using Floyd-Hoare style Verification Conditions and SMT.We implement our approach as a framework for writing verified distributed programs in Go and evaluate it with four challenging case studies— the classic two-phase commit protocol, the Raft leader election protocol, singledecree Paxos protocol, and a Multi-Paxos based distributed key-value store. We find that pretend synchrony allows us to develop performant systems while making verification of functional correctness simpler by reducing manually specified invariants by a factor of 6, and faster, by reducing checking time by three orders of magnitude. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://goto.ucsd.edu/~gleissen/papers/pretend-synchrony.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
