Paper Info
Title
Verdi: a framework for implementing and formally verifying distributed systems
Abstract
Distributed systems are difficult to implement correctly because they must handle both concurrency and failures: machines may crash at arbitrary points and networks may reorder, drop, or duplicate packets. Further, their behavior is often too complex to permit exhaustive testing. Bugs in these systems have led to the loss of critical data and unacceptable service outages. We present Verdi, a framework for implementing and formally verifying distributed systems in Coq. Verdi formalizes various network semantics with different faults, and the developer chooses the most appropriate fault model when verifying their implementation. Furthermore, Verdi eases the verification burden by enabling the developer to first verify their system under an idealized fault model, then transfer the resulting correctness guarantees to a more realistic fault model without any additional proof burden. To demonstrate Verdi's utility, we present the first mechanically checked proof of linearizability of the Raft state machine replication algorithm, as well as verified implementations of a primary-backup replication system and a key-value store. These verified systems provide similar performance to unverified equivalents.
Year
DOI
Venue
2015
10.1145/2737924.2737958
PLDI
Keywords
Field
DocType
Coq,Formal verification,Verdi,distributed systems,proof assistants
Programming language,Concurrency,Computer science,Correctness,Theoretical computer science,Real-time computing,Implementation,Fault model,Distributed computing,Linearizability,State machine replication,Network packet,Formal verification
Conference
Volume
Issue
ISSN
50
6
0362-1340
Citations 
PageRank 
References 
58
1.42
20
Authors
7
Name
Order
Citations
PageRank
James R. Wilcox11416.00
Doug Woos21926.88
Pavel Panchekha31537.73
Zachary Tatlock430721.68
Xi Wang554029.04
Michael D. Ernst66629347.51
Thomas E. Anderson7142121641.43