Document Open Access Logo

A Categorical Account of Replicated Data Types

Authors Fabio Gadducci , Hernán Melgratti , Christian Roldán , Matteo Sammartino

PDF
Thumbnail PDF

File

LIPIcs.FSTTCS.2019.42.pdf
  • Filesize: 0.58 MB
  • 15 pages

Document Identifiers

Author Details

Fabio Gadducci
  • Dipartimento di Informatica, Università di Pisa, Italia
Hernán Melgratti
  • Departamento de Computación, Universidad de Buenos Aires, Argentina
  • ICC-CONICET-UBA, Buenos Aires, Argentina
Christian Roldán
  • Departamento de Computación, Universidad de Buenos Aires, Argentina
Matteo Sammartino
  • Department of Computer Science, University College London, UK

Funding

Research partially supported by the MIUR PRIN 2017FTXR7S "IT-MaTTerS", by the EU H2020 RISE programme under the Marie Skłodowska-Curie grant agreement 778233, by the UBACyT projects 20020170100544BA and 20020170100086BA, by the PIP project 11220130100148CO, by the Leverhulme Prize PLP-2016-129, and by the EPSRC grant EP/S028641/1.
  • Gadducci, Fabio: MIUR PRIN 2017FTXR7S "IT-MaTTerS"
  • Melgratti, Hernán: EU H2020 RISE programme under the Marie Skłodowska-Curie grant agreement 778233, UBACyT projects 20020170100544BA and 20020170100086BA, and PIP project 11220130100148CO
  • Roldán, Christian: EU H2020 RISE programme under the Marie Skłodowska-Curie grant agreement 778233, UBACyT projects 20020170100544BA and 20020170100086BA, and PIP project 11220130100148CO
  • Sammartino, Matteo: Leverhulme Prize PLP-2016-129 and EPSRC grant EP/S028641/1

Acknowledgements

We thank the reviewers for their careful reading and insightful comments.

Cite AsGet BibTex

Fabio Gadducci, Hernán Melgratti, Christian Roldán, and Matteo Sammartino. A Categorical Account of Replicated Data Types. In 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 150, pp. 42:1-42:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
https://doi.org/10.4230/LIPIcs.FSTTCS.2019.42

Abstract

Replicated Data Types (RDTs) have been introduced as a suitable abstraction for dealing with weakly consistent data stores, which may (temporarily) expose multiple, inconsistent views of their state. In the literature, RDTs are commonly specified in terms of two relations: visibility, which accounts for the different views that a store may have, and arbitration, which states the logical order imposed on the operations executed over the store. Different flavours, e.g., operational, axiomatic and functional, have recently been proposed for the specification of RDTs. In this work, we propose an algebraic characterisation of RDT specifications. We define categories of visibility relations and arbitrations, show the existence of relevant limits and colimits, and characterize RDT specifications as functors between such categories that preserve these additional structures.

Subject Classification

ACM Subject Classification
  • Theory of computation → Program semantics
  • Software and its engineering → General programming languages
Keywords
  • Replicated data type
  • Specification
  • Functorial characterisation

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

References

  1. Carlos Baquero, Paulo Sérgio Almeida, Alcino Cunha, and Carla Ferreira. Composition in state-based replicated data types. Bulletin of the EATCS, 123, 2017. Google Scholar
  2. Ahmed Bouajjani, Constantin Enea, and Jad Hamza. Verifying eventual consistency of optimistic replication systems. In Suresh Jagannathan and Peter Sewell, editors, POPL 2014, pages 285-296. ACM, 2014. Google Scholar
  3. Sebastian Burckhardt, Alexey Gotsman, and Hongseok Yang. Understanding eventual consistency. Technical Report MSR-TR-2013-39, Microsoft Research, 2013. Google Scholar
  4. Sebastian Burckhardt, Alexey Gotsman, Hongseok Yang, and Marek Zawirski. Replicated data types: specification, verification, optimality. In Suresh Jagannathan and Peter Sewell, editors, POPL 2014, pages 271-284. ACM, 2014. Google Scholar
  5. Andrea Cerone, Giovanni Bernardi, and Alexey Gotsman. A framework for transactional consistency models with atomic visibility. In Luca Aceto and David de Frutos-Escrig, editors, CONCUR 2015, volume 42 of LIPIcs. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2015. Google Scholar
  6. Fabio Gadducci, Hernán Melgratti, and Christian Roldán. On the semantics and implementation of replicated data types. Science of Computer Programming, 167:91-113, 2018. Google Scholar
  7. Fabio Gadducci, Hernán C. Melgratti, and Christian Roldán. A denotational view of replicated data types. In Jean-Marie Jacquet and Mieke Massink, editors, COORDINATION 2017, volume 10319 of LNCS, pages 138-156. Springer, 2017. Google Scholar
  8. Seth Gilbert and Nancy Lynch. Brewer’s conjecture and the feasibility of consistent, available, partition-tolerant web services. SIGACT News, 33(2):51-59, June 2002. Google Scholar
  9. Alexey Gotsman and Sebastian Burckhardt. Consistency models with global operation sequencing and their composition. In Andréa W. Richa, editor, DISC 2017, volume 91 of LIPIcs, pages 23:1-23:16. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017. Google Scholar
  10. Alexey Gotsman and Hongseok Yang. Composite replicated data types. In Jan Vitek, editor, ESOP 2015, volume 9032 of LNCS, pages 585-609. Springer, 2015. Google Scholar
  11. Gowtham Kaki, Kapil Earanky, K. C. Sivaramakrishnan, and Suresh Jagannathan. Safe replication through bounded concurrency verification. In OOPSLA 2018, volume 2 of PACMPL, pages 164:1-164:27. ACM, 2018. Google Scholar
  12. Adriaan Leijnse, Paulo Sérgio Almeida, and Carlos Baquero. Higher-order patterns in replicated data types. In PaPoC 2019. ACM, 2019. Google Scholar
  13. Marc Shapiro, N. Preguiça, Carlos Baquero, and Marek Zawirski. Conflict-free replicated data types. In Xavier Défago, Franck Petit, and Vincent Villain, editors, SSS 2011, volume 6976 of LNCS, pages 386-400. Springer, 2011. Google Scholar
  14. K. C. Sivaramakrishnan, Gowtham Kaki, and Suresh Jagannathan. Declarative programming over eventually consistent data stores. In David Grove and Steve Blackburn, editors, PLDI 2015, pages 413-424. ACM, 2015. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact