OpSets: Sequential Specifications for Replicated Datatypes

Title:	OpSets: Sequential Specifications for Replicated Datatypes
Authors:	Martin Kleppmann (mk428 /at/ cl /dot/ cam /dot/ ac /dot/ uk), Victor B. F. Gomes (vb358 /at/ cl /dot/ cam /dot/ ac /dot/ uk), Dominic P. Mulligan (Dominic /dot/ Mulligan /at/ arm /dot/ com) and Alastair R. Beresford (arb33 /at/ cl /dot/ cam /dot/ ac /dot/ uk)
Submission date:	2018-05-10
Abstract:	We introduce OpSets, an executable framework for specifying and reasoning about the semantics of replicated datatypes that provide eventual consistency in a distributed system, and for mechanically verifying algorithms that implement these datatypes. Our approach is simple but expressive, allowing us to succinctly specify a variety of abstract datatypes, including maps, sets, lists, text, graphs, trees, and registers. Our datatypes are also composable, enabling the construction of complex data structures. To demonstrate the utility of OpSets for analysing replication algorithms, we highlight an important correctness property for collaborative text editing that has traditionally been overlooked; algorithms that do not satisfy this property can exhibit awkward interleaving of text. We use OpSets to specify this correctness property and prove that although one existing replication algorithm satisfies this property, several other published algorithms do not.
BibTeX:	@article{OpSets-AFP, author = {Martin Kleppmann and Victor B. F. Gomes and Dominic P. Mulligan and Alastair R. Beresford}, title = {OpSets: Sequential Specifications for Replicated Datatypes}, journal = {Archive of Formal Proofs}, month = may, year = 2018, note = {\url{http://isa-afp.org/entries/OpSets.html}, Formal proof development}, ISSN = {2150-914x}, }
License:	BSD License
Status: [ok]	This is a development version of this entry. It might change over time and is not stable. Please refer to release versions for citations.

Proof outline
Proof document

Browse theories

Download this entry