Thumbnail
Access Restriction
Subscribed

Author Setty, Srinath ♦ Hawblitzel, Chris ♦ Howell, Jon ♦ Roberts, Michael L. ♦ Lorch, Jacob R. ♦ Kapritsos, Manos ♦ Parno, Bryan ♦ Zill, Brian
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Abstract Distributed systems are notorious for harboring subtle bugs. Verification can, in principle, eliminate these bugs, but it has historically been difficult to apply at full-program scale, much less distributed system scale. We describe a methodology for building practical and provably correct distributed systems based on a unique blend of temporal logic of actions-style state-machine refinement and Hoare-logic verification. We demonstrate the methodology on a complex implementation of a Paxos-based replicated state machine library and a lease-based sharded key-value store. We prove that each obeys a concise safety specification as well as desirable liveness requirements. Each implementation achieves performance competitive with a reference system. With our methodology and lessons learned, we aim to raise the standard for distributed systems from "tested" to "correct."
Description Affiliation: Microsoft Research (Hawblitzel, Chris; Kapritsos, Manos; Lorch, Jacob R.; Parno, Bryan; Roberts, Michael L.; Setty, Srinath; Zill, Brian) || Google (Howell, Jon)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 60
Issue Number 7
Page Count 10
Starting Page 83
Ending Page 92


Open content in new tab

   Open content in new tab
Source: ACM Digital Library