Please use this identifier to cite or link to this item: http://repositorio.inesctec.pt/handle/123456789/10536
Full metadata record
DC FieldValueLanguage
dc.contributor.authorPaulo Sérgio Almeidaen
dc.contributor.authorLeijnse,Aen
dc.contributor.authorCarlos Baqueroen
dc.contributor.other5607en
dc.contributor.other5596en
dc.date.accessioned2019-12-16T14:58:48Z-
dc.date.available2019-12-16T14:58:48Z-
dc.date.issued2019en
dc.identifier.urihttp://repositorio.inesctec.pt/handle/123456789/10536-
dc.identifier.urihttp://dx.doi.org/10.1145/3301419.3323971en
dc.description.abstractThe design of Conflict-free Replicated Data Types traditionally requires implementing new designs from scratch to meet a desired behavior. Although there are composition rules that can guide the process, there has not been a lot of work explaining how existing data types relate to each other, nor work that factors out common patterns. To bring clarity to the field we explain underlying patterns that are common to flags, sets, and registers. The identified patterns are succinct and composable, which gives them the power to explain both current designs and open up the space for new ones. © 2019 Copyright held by the owner/author(s). Publication rights licensed to ACM.en
dc.languageengen
dc.titleHigher-order patterns in replicated data typesen
dc.typePublicationen
dc.typeconferenceObjecten
Appears in Collections:HASLab - Articles in International Conferences

Files in This Item:
File Description SizeFormat 
P-00Q-WJM.pdf529.12 kBAdobe PDFThumbnail
View/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.