A Formal Analysis of the Global Sequence Protocol - Coordination Models and Languages (COORDINATION 2016) Access content directly
Conference Papers Year : 2016

A Formal Analysis of the Global Sequence Protocol


The Global Sequence Protocol (GSP) is an operational model for replicated data stores, in which updates propagate asynchronously. We introduce the GSP-calculus as a formal model for GSP. We give a formal account for its proposed implementation, which addresses communication failures and compact representation of data, and use simulation to prove that the implementation is correct. Then, we use the GSP-calculus to reason about execution histories and prove ordering guarantees, such as read my writes, monotonic reads, causality and consistent prefix. We also prove that GSP extended with synchronous updates provides strong consistency guarantees.
Fichier principal
Vignette du fichier
416253_1_En_11_Chapter.pdf (411.13 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-01631716 , version 1 (09-11-2017)




Hernán Melgratti, Christian Roldán. A Formal Analysis of the Global Sequence Protocol. 18th International Conference on Coordination Languages and Models (COORDINATION), Jun 2016, Heraklion, Greece. pp.175-191, ⟨10.1007/978-3-319-39519-7_11⟩. ⟨hal-01631716⟩
64 View
124 Download



Gmail Mastodon Facebook X LinkedIn More