[isabelle] New in the AFP: OpSets: Sequential Specifications for Replicated Datatypes
- To: isabelle-users <isabelle-users at cl.cam.ac.uk>
- Subject: [isabelle] New in the AFP: OpSets: Sequential Specifications for Replicated Datatypes
- From: "Thiemann, Rene" <Rene.Thiemann at uibk.ac.at>
- Date: Fri, 25 May 2018 09:00:42 +0000
- Accept-language: de-DE, de-AT, en-US
- Thread-index: AQHT9Abb8EVa09DnGEu6Lv0UhsPanQ==
- Thread-topic: New in the AFP: OpSets: Sequential Specifications for Replicated Datatypes
I’m happy to announce a new AFP entry by
Martin Kleppmann, Victor B. F. Gomes, Dominic P. Mulligan and Alastair R. Beresford.
OpSets: Sequential Specifications for Replicated Datatypes
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.
This archive was generated by a fusion of
Pipermail (Mailman edition) and