{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T05:22:51Z","timestamp":1769232171336,"version":"3.49.0"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2021,2,9]],"date-time":"2021-02-09T00:00:00Z","timestamp":1612828800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,2,9]],"date-time":"2021-02-09T00:00:00Z","timestamp":1612828800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100010663","name":"H2020 European Research Council","doi-asserted-by":"publisher","award":["678177"],"award-info":[{"award-number":["678177"]}],"id":[{"id":"10.13039\/100010663","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006319","name":"Centre National pour la Recherche Scientifique et Technique","doi-asserted-by":"publisher","award":["78UM5R2017"],"award-info":[{"award-number":["78UM5R2017"]}],"id":[{"id":"10.13039\/501100006319","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[2022,10]]},"DOI":"10.1007\/s00607-021-00911-3","type":"journal-article","created":{"date-parts":[[2021,2,10]],"date-time":"2021-02-10T05:45:41Z","timestamp":1612935941000},"page":"2181-2201","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Checking causal consistency of distributed databases"],"prefix":"10.1007","volume":"104","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7772-534X","authenticated-orcid":false,"given":"Rachid","family":"Zennou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ranadeep","family":"Biswas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ahmed","family":"Bouajjani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Constantin","family":"Enea","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammed","family":"Erradi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,2,9]]},"reference":[{"key":"911_CR1","unstructured":"https:\/\/www.cockroachlabs.com, [Retrieved 15\/11\/2018]"},{"key":"911_CR2","unstructured":"http:\/\/galeracluster.com, [Retrieved 15\/11\/2018]"},{"key":"911_CR3","unstructured":"https:\/\/github.com\/codership\/galera\/issues\/336, [Retrieved 15\/11\/2018]"},{"key":"911_CR4","doi-asserted-by":"crossref","unstructured":"Abdulla PA, Atig MF, Jonsson B, L\u00e5ng M, Ngo TP, Sagonas K (2019) Optimal stateless model checking for reads-from equivalence under sequential consistency. Proc. ACM Program. Lang. 3(OOPSLA) https:\/\/doi.org\/10.1145\/3360576","DOI":"10.1145\/3360576"},{"key":"911_CR5","volume-title":"Foundations of databases: the logical level","year":"1995","unstructured":"Abiteboul S, Hull R, Vianu V (eds) (1995) Foundations of databases: the logical level, 1st edn. Addison-Wesley Longman Publishing Co., Inc, Boston","edition":"1"},{"issue":"1","key":"911_CR6","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/BF01784241","volume":"9","author":"M Ahamad","year":"1995","unstructured":"Ahamad M, Neiger G, Burns JE, Kohli P, Hutto PW (1995) Causal memory: Definitions, implementation, and programming. Distrib Comput 9(1):37\u201349. https:\/\/doi.org\/10.1007\/BF01784241","journal-title":"Distrib Comput"},{"key":"911_CR7","doi-asserted-by":"crossref","unstructured":"Bailis P, Ghodsi A, Hellerstein JM, Stoica I (2013) Bolt-on causal consistency. In: Proceedings of the 2013 ACM SIGMOD international conference on management of data. SIGMOD \u201913, ACM, New York, NY, USA, pp 761\u2013772, http:\/\/doi.acm.org\/10.1145\/2463676.2465279","DOI":"10.1145\/2463676.2465279"},{"key":"911_CR8","doi-asserted-by":"crossref","unstructured":"Bouajjani A, Enea C, Guerraoui R, Hamza J (2017) On verifying causal consistency. In: Castagna G, Gordon AD (eds) Proceedings of the 44th ACM SIGPLAN symposium on principles of programming languages, POPL 2017, Paris, France, January 18\u201320. ACM, pp 626\u2013638, http:\/\/dl.acm.org\/citation.cfm?id=3009888","DOI":"10.1145\/3009837.3009888"},{"key":"911_CR9","doi-asserted-by":"crossref","unstructured":"Bouajjani A, Enea C, Hamza J (2014) Verifying eventual consistency of optimistic replication systems. In: Proceedings of the 41st ACM SIGPLAN-SIGACT symposium on principles of programming languages. POPL \u201914, ACM, New York, NY, USA, pp 285\u2013296, http:\/\/doi.acm.org\/10.1145\/2535838.2535877","DOI":"10.1145\/2535838.2535877"},{"key":"911_CR10","doi-asserted-by":"crossref","unstructured":"Burckhardt S, Dern C, Musuvathi M, Tan R (2010) Line-up: a complete and automatic linearizability checker. In: Zorn BG, Aiken A (eds) Proceedings of the 2010 ACM SIGPLAN conference on programming language design and implementation, PLDI 2010, Toronto, Ontario, Canada, June 5\u201310. ACM, pp 330\u2013340, https:\/\/doi.org\/10.1145\/1806596.1806634","DOI":"10.1145\/1806596.1806634"},{"key":"911_CR11","doi-asserted-by":"crossref","unstructured":"Du J, Elnikety S, Roy A, Zwaenepoel W (2013) Orbe: scalable causal consistency using dependency matrices and physical clocks. In: Proceedings of the 4th annual symposium on cloud computing. SOCC \u201913, ACM, New York, NY, USA, pp 11:1\u201311:14, http:\/\/doi.acm.org\/10.1145\/2523616.2523628","DOI":"10.1145\/2523616.2523628"},{"key":"911_CR12","doi-asserted-by":"crossref","unstructured":"Emmi M, Enea C (2018) Monitoring weak consistency. In: Chockler H, Weissenbacher G (eds) Computer aided verification - 30th international conference, CAV 2018, held as part of the federated logic conference, FloC 2018, Oxford, UK, July 14\u201317, 2018, Proceedings, Part I. Lecture notes in computer science, vol 10981. Springer, pp 487\u2013506, https:\/\/doi.org\/10.1007\/978-3-319-96145-3_26","DOI":"10.1007\/978-3-319-96145-3_26"},{"key":"911_CR13","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1145\/3158113","volume":"2","author":"M Emmi","year":"2018","unstructured":"Emmi M, Enea C (2018) Sound, complete, and tractable linearizability monitoring for concurrent collections. PACMPL 2:251\u20132527. https:\/\/doi.org\/10.1145\/3158113","journal-title":"PACMPL"},{"key":"911_CR14","doi-asserted-by":"crossref","unstructured":"Emmi M, Enea C, Hamza J (2015) Monitoring refinement via symbolic reasoning. In: Grove D, Blackburn S (eds) Proceedings of the 36th ACM SIGPLAN conference on programming language design and implementation, Portland, OR, USA, June 15-17, 2015. ACM, pp 260\u2013269, https:\/\/doi.org\/10.1145\/2737924.2737983","DOI":"10.1145\/2737924.2737983"},{"issue":"2","key":"911_CR15","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1145\/564585.564601","volume":"33","author":"S Gilbert","year":"2002","unstructured":"Gilbert S, Lynch N (2002) Brewer\u2019s conjecture and the feasibility of consistent, available, partition-tolerant web services. SIGACT News 33(2):51\u201359. https:\/\/doi.org\/10.1145\/564585.564601","journal-title":"SIGACT News"},{"issue":"3","key":"911_CR16","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/78969.78972","volume":"12","author":"MP Herlihy","year":"1990","unstructured":"Herlihy MP, Wing JM (1990) Linearizability: a correctness condition for concurrent objects. ACM Trans Program Lang Syst 12(3):463\u2013492. https:\/\/doi.org\/10.1145\/78969.78972","journal-title":"ACM Trans Program Lang Syst"},{"issue":"9","key":"911_CR17","doi-asserted-by":"publisher","first-page":"690","DOI":"10.1109\/TC.1979.1675439","volume":"28","author":"L Lamport","year":"1979","unstructured":"Lamport L (1979) How to make a multiprocessor computer that correctly executes multiprocess programs. IEEE Trans Comput 28(9):690\u2013691. https:\/\/doi.org\/10.1109\/TC.1979.1675439","journal-title":"IEEE Trans Comput"},{"issue":"7","key":"911_CR18","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1145\/359545.359563","volume":"21","author":"L Lamport","year":"1978","unstructured":"Lamport L (1978) Time, clocks, and the ordering of events in a distributed system. Commun ACM 21(7):558\u2013565. https:\/\/doi.org\/10.1145\/359545.359563","journal-title":"Commun ACM"},{"key":"911_CR19","doi-asserted-by":"crossref","unstructured":"Lloyd W, Freedman MJ, Kaminsky M, Andersen DG (2011) Don\u2019t settle for eventual: scalable causal consistency for wide-area storage with cops. In: proceedings of the twenty-third ACM symposium on operating systems principles. SOSP \u201911, ACM, New York, NY, USA, pp 401\u2013416, http:\/\/doi.acm.org\/10.1145\/2043556.2043593","DOI":"10.1145\/2043556.2043593"},{"key":"911_CR20","unstructured":"Mahajan P, Alvisi L, Dahlin M (2011) Consistency, availability, convergence. Technical report"},{"key":"911_CR21","doi-asserted-by":"crossref","unstructured":"Perrin M, Mostefaoui A, Jard C (2016) Causal consistency: beyond memory. In: Proceedings of the 21st ACM SIGPLAN symposium on principles and practice of parallel programming. PPoPP \u201916, ACM, New York, NY, USA, pp 26:1\u201326:12","DOI":"10.1145\/2851141.2851170"},{"issue":"5","key":"911_CR22","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1145\/269005.266711","volume":"31","author":"K Petersen","year":"1997","unstructured":"Petersen K, Spreitzer MJ, Terry DB, Theimer MM, Demers AJ (1997) Flexible update propagation for weakly consistent replication. SIGOPS Oper Syst Rev 31(5):288\u2013301. https:\/\/doi.org\/10.1145\/269005.266711","journal-title":"SIGOPS Oper Syst Rev"},{"key":"911_CR23","doi-asserted-by":"crossref","unstructured":"Pregui\u00e7a N, Zawirski M, Bieniusa A, Duarte S, Balegas V, Baquero C, Shapiro M (2014) Swiftcloud: fault-tolerant geo-replication integrated all the way to the client machine. In: Proceedings of the 2014 IEEE 33rd international symposium on reliable distributed systems workshops. SRDSW \u201914, IEEE Computer Society, Washington, DC, USA, pp 30\u201333, https:\/\/doi.org\/10.1109\/SRDSW.2014.33","DOI":"10.1109\/SRDSW.2014.33"},{"issue":"8","key":"911_CR24","doi-asserted-by":"publisher","first-page":"730","DOI":"10.1109\/TPDS.2003.1225053","volume":"14","author":"S Qadeer","year":"2003","unstructured":"Qadeer S (2003) Verifying sequential consistency on shared-memory multiprocessors by model checking. IEEE Trans Parallel Distrib Syst 14(8):730\u2013741. https:\/\/doi.org\/10.1109\/TPDS.2003.1225053","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"911_CR25","doi-asserted-by":"crossref","unstructured":"Vardi M.Y (1982) The complexity of relational query languages (extended abstract). In: Proceedings of the fourteenth annual ACM symposium on theory of computing. STOC \u201982, ACM, New York, NY, USA, pp 137\u2013146, http:\/\/doi.acm.org\/10.1145\/800070.802186","DOI":"10.1145\/800070.802186"},{"key":"911_CR26","unstructured":"Warren DS (1999) Programming in tabled prolog. In: Symposium program, pp\u00a062"},{"issue":"1\u20132","key":"911_CR27","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1006\/jpdc.1993.1015","volume":"17","author":"JM Wing","year":"1993","unstructured":"Wing JM, Gong C (1993) Testing and verifying concurrent objects. J Parallel Distrib Comput 17(1\u20132):164\u2013182. https:\/\/doi.org\/10.1006\/jpdc.1993.1015","journal-title":"J Parallel Distrib Comput"},{"key":"911_CR28","doi-asserted-by":"crossref","unstructured":"Zennou R, Atig MF, Biswas R, Bouajjani A, Enea C, Erradi M (2020) Boosting sequential consistency checking using saturation. In: Hung DV, Sokolsky O (eds) Automated technology for verification and analysis. Springer, Cham, pp 360\u2013376. https:\/\/doi.org\/10.1007\/978-3-030-59152-6_20","DOI":"10.1007\/978-3-030-59152-6_20"},{"key":"911_CR29","doi-asserted-by":"crossref","unstructured":"Zennou R, Biswas R, Bouajjani A, Enea C, Erradi M (2019) Checking causal consistency of distributed databases. In: Atig MF, Schwarzmann AA (eds) Networked systems. Springer International Publishing, Cham, pp 35\u201351 https:\/\/doi.org\/10.1007\/978-3-030-31277-0_3","DOI":"10.1007\/978-3-030-31277-0_3"},{"key":"911_CR30","doi-asserted-by":"crossref","unstructured":"Zennou R, Biswas R, Bouajjani A, Enea C, Erradi M (2020) Checking causal consistency of distributed databases, https:\/\/arxiv.org\/abs\/2011.09753","DOI":"10.1007\/s00607-021-00911-3"},{"key":"911_CR31","doi-asserted-by":"crossref","unstructured":"Zennou R, Bouajjani A, Enea C, Erradi M (2019) Gradual consistency checking. In: Dillig I, Tasiran S, (eds) Computer Aided Verification. Springer, Cham, pp 267\u2013285, https:\/\/doi.org\/10.1007\/978-3-030-25543-5_16","DOI":"10.1007\/978-3-030-25543-5_16"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-021-00911-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00607-021-00911-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-021-00911-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,15]],"date-time":"2022-09-15T18:14:57Z","timestamp":1663265697000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00607-021-00911-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,2,9]]},"references-count":31,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2022,10]]}},"alternative-id":["911"],"URL":"https:\/\/doi.org\/10.1007\/s00607-021-00911-3","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,2,9]]},"assertion":[{"value":"30 April 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 January 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 February 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}