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 mea...

Descripción completa

Detalles Bibliográficos
Publicado: 2017
Materias:
Acceso en línea:https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_03029743_v10319LNCS_n_p138_Gadducci
http://hdl.handle.net/20.500.12110/paper_03029743_v10319LNCS_n_p138_Gadducci
Aporte de:
id paper:paper_03029743_v10319LNCS_n_p138_Gadducci
record_format dspace
spelling paper:paper_03029743_v10319LNCS_n_p138_Gadducci2023-06-08T15:28:15Z A denotational view of replicated data types Distributed computer systems Specifications Composition operators Data type Distributed systems Key Issues Replicated data Return value Underspecification Weak consistency Visibility “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. © IFIP International Federation for Information Processing 2017. 2017 https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_03029743_v10319LNCS_n_p138_Gadducci http://hdl.handle.net/20.500.12110/paper_03029743_v10319LNCS_n_p138_Gadducci
institution Universidad de Buenos Aires
institution_str I-28
repository_str R-134
collection Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA)
topic Distributed computer systems
Specifications
Composition operators
Data type
Distributed systems
Key Issues
Replicated data
Return value
Underspecification
Weak consistency
Visibility
spellingShingle Distributed computer systems
Specifications
Composition operators
Data type
Distributed systems
Key Issues
Replicated data
Return value
Underspecification
Weak consistency
Visibility
A denotational view of replicated data types
topic_facet Distributed computer systems
Specifications
Composition operators
Data type
Distributed systems
Key Issues
Replicated data
Return value
Underspecification
Weak consistency
Visibility
description “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. © IFIP International Federation for Information Processing 2017.
title A denotational view of replicated data types
title_short A denotational view of replicated data types
title_full A denotational view of replicated data types
title_fullStr A denotational view of replicated data types
title_full_unstemmed A denotational view of replicated data types
title_sort denotational view of replicated data types
publishDate 2017
url https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_03029743_v10319LNCS_n_p138_Gadducci
http://hdl.handle.net/20.500.12110/paper_03029743_v10319LNCS_n_p138_Gadducci
_version_ 1768543945108750336