A Denotational View of Replicated Data Types - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2017

A Denotational View of Replicated Data Types


“Weak consistency” refers to a family of properties concerning the state of a distributed system. One of the key issues in their description is the way in which systems are specified. In this regard, a major advance is represented by the introduction of Replicated Data Types (rdts), in which the meaning of operators is given in terms of two relations, namely, visibility and arbitration. Concretely, a data type operation is defined as a function that maps visibility and arbitration into a return value. In this paper we recast such standard approaches into a denotational framework in which a data type is seen as a function that maps visibility into admissible arbitrations. This characterisation provides a more abstract view of RDTs that (i) highlights some of the implicit assumptions shared in operational approaches to specification; (ii) accommodates underspecification and refinement; (iii) enables a categorical presentation of RDT and the development of composition operators for specifications.
Fichier principal
Vignette du fichier
450044_1_En_8_Chapter.pdf (249.8 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01657339 , version 1 (06-12-2017)





Fabio Gadducci, Hernán Melgratti, Christian Roldán. A Denotational View of Replicated Data Types. 19th International Conference on Coordination Languages and Models (COORDINATION), Jun 2017, Neuchâtel, Switzerland. pp.138-156, ⟨10.1007/978-3-319-59746-1_8⟩. ⟨hal-01657339⟩
59 View
43 Download



Gmail Facebook Twitter LinkedIn More