### Abstract

In this work, we focus on the correctness of Conflict-free Replicated Data Types (CRDTs), a class of algorithm that provides strong eventual consistency guarantees for replicated data. We develop a modular and reusable framework for verifying the correctness of CRDT algorithms. We avoid correctness issues that have dogged previous mechanised proofs in this area by including a network model in our formalisation, and proving that our theorems hold in all possible network behaviours. Our axiomatic network model is a standard abstraction that accurately reflects the behaviour of real-world computer networks. Moreover, we identify an abstract convergence theorem, a property of order relations, which provides a formal definition of strong eventual consistency. We then obtain the first machine-checked correctness theorems for three concrete CRDTs: the Replicated Growable Array, the Observed-Remove Set, and an Increment-Decrement Counter.

### License

BSD License

### Topics

- Computer science/Algorithms/Distributed
- Computer science/Data structures

### Session CRDT

- Util
- Convergence
- Network
- Ordered_List
- RGA
- Counter
- ORSet

### Used by

- The IMAP CmRDT

## Cite

×

CRDT-AFP

    @article{CRDT-AFP,
      author  = {Victor B. F. Gomes and Martin Kleppmann and Dominic P. Mulligan and Alastair R. Beresford},
      title   = {A framework for establishing Strong Eventual Consistency for Conflict-free Replicated Datatypes},
      journal = {Archive of Formal Proofs},
      month   = {July},
      year    = {2017},
      note    = {\url{https://isa-afp.org/entries/CRDT.html},
                 Formal proof development},
      ISSN    = {2150-914x},
    }

Download

## Download

× Download latest

Older releases:

- Sep 13, 2023 : Isabelle2023
- Oct 27, 2022 : Isabelle2022
- Dec 14, 2021 : Isabelle2021-1
- Feb 23, 2021 : Isabelle2021
- Apr 18, 2020 : Isabelle2020
- Jun 11, 2019 : Isabelle2019
- Aug 16, 2018 : Isabelle2018
- Oct 10, 2017 : Isabelle2017
- Jul 7, 2017 : Isabelle2016-1