Making Operation-Based CRDTs Operation-Based

Baquero, Carlos; Almeida, Paulo Sérgio; Shoker, Ali

doi:10.1007/978-3-662-43352-2_11

Cited by 28 publications

(30 citation statements)

References 16 publications

(13 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Causal stability [6] was defined in the context of static group and in absence of an adversary. Here, we tailor this concept to dynamic groups and we assume that all participants are honest.…”

Section: A Provable Causal Stability In Dynamic Groupmentioning

confidence: 99%

See 1 more Smart Citation

Prunable Authenticated Log and Authenticable Snapshot in Distributed Collaborative Systems

Elvinger

Oster

Charoy

2018

2018 IEEE 4th International Conference on Collaboration and Internet Computing (CIC)

View full text Add to dashboard Cite

In distributed collaborative systems, participants maintain a replicated copy of shared documents. They edit their own copy and then share their modifications without any coordination. Copies follow successions of divergence and convergence. Convergence is a liveness property of collaborative systems. Some malicious participants may find an advantage to make the collaboration fail. To that end, they can preclude convergence of the copies. To protect convergence of copies, participants can exploit an authenticated log of modifications. New participants have to retrieve the entire log in order to contribute. Unfortunately, the cost of joining a collaboration increases with the size of this log. Causal Stability allows to prune authenticated logs in a static collaborative group without any malicious participants. In this paper, we first tailor Causal Stability to dynamic groups in presence of malicious participants. We then propose a mechanism to verify the consistency of a pruned log and a mechanism to authenticate a snapshot from a pruned log.

show abstract

Section: A Provable Causal Stability In Dynamic Groupmentioning

confidence: 99%

“…Authenticated logs rely on consistency models [5] which define how contributions can be related to each other. Causal Stability [6] enables us to safely prune causal-consistent logs in static groups. Once a contribution is stable, participants have the guarantee that all participants included it in their log.…”

Section: Introductionmentioning

confidence: 99%

Prunable Authenticated Log and Authenticable Snapshot in Distributed Collaborative Systems

Elvinger

Oster

Charoy

2018

2018 IEEE 4th International Conference on Collaboration and Internet Computing (CIC)

View full text Add to dashboard Cite

show abstract

“…In this section we develop a formal definition of an asynchronous unreliable causal broadcast network. We choose this model because it satisfies the causal delivery requirements of many operationbased CRDTs [Almeida et al 2015;Baquero et al 2014]. Moreover, it is suitable for use in decentralised settings, as motivated in the introduction, since it does not require waiting for communication with a central server or a quorum of nodes.…”

Section: An Axiomatic Network Modelmentioning

confidence: 99%

Verifying strong eventual consistency in distributed systems

Gomes

Kleppmann

Mulligan

et al. 2017

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

Data replication is used in distributed systems to maintain up-to-date copies of shared data across multiple computers in a network. However, despite decades of research, algorithms for achieving consistency in replicated systems are still poorly understood. Indeed, many published algorithms have later been shown to be incorrect, even some that were accompanied by supposed mechanised proofs of correctness. 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 in the Isabelle/HOL interactive proof assistant 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. We find that our framework is highly reusable, developing proofs of correctness for the latter two CRDTs in a few hours and with relatively little CRDT-specific code.

show abstract

“…In Section 3, we show a specification of a trivial resettable counter design and point to the meta-data trade-off of such design. In Section 4, we explain how causal stability, that is already a part of the pure opbased framework [3], can be used to remove unnecessary meta-data leading to a more compact design. We conclude, in section 5, with some final remarks.…”

Section: Introductionmentioning

confidence: 99%

Compact Resettable Counters through Causal Stability

Younes

Almeida

Baquero

2017

Proceedings of the 3rd International Workshop on Principles and Practice of Consistency for Distributed Data

Self Cite

View full text Add to dashboard Cite

Conflict-free Data Types (CRDTs) were designed to automatically resolve conflicts in eventually consistent systems. Different CRDTs were designed in both operation-based and state-based flavors such as Counters, Sets, Registers, Maps, etc. In a previous paper [2], Baquero et al. presented the problem with embedded CRDT counters and a solution, covering state-based counters that can be embedded in maps, but needing an ad-hoc extension to the standard counter API. Here, we present a resettable operation-based counter design, with the standard simple API and small state, through a causalstability-based state compaction.

show abstract

Making Operation-Based CRDTs Operation-Based

Cited by 28 publications

References 16 publications

Prunable Authenticated Log and Authenticable Snapshot in Distributed Collaborative Systems

Prunable Authenticated Log and Authenticable Snapshot in Distributed Collaborative Systems

Verifying strong eventual consistency in distributed systems

Compact Resettable Counters through Causal Stability

Contact Info

Product

Resources

About