{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T11:43:52Z","timestamp":1743075832486,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031377648"},{"type":"electronic","value":"9783031377655"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-37765-5_5","type":"book-chapter","created":{"date-parts":[[2023,7,6]],"date-time":"2023-07-06T19:01:53Z","timestamp":1688670113000},"page":"62-77","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Comparing Causal Convergence Consistency Models"],"prefix":"10.1007","author":[{"given":"Sidi Mohamed","family":"Beillahi","sequence":"first","affiliation":[]},{"given":"Ahmed","family":"Bouajjani","sequence":"additional","affiliation":[]},{"given":"Constantin","family":"Enea","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,7,7]]},"reference":[{"key":"5_CR1","doi-asserted-by":"publisher","unstructured":"Abdulla, P.A., Arora, J., Atig, M.F., Krishna, S.N.: Verification of programs under the release-acquire semantics. In: McKinley, K.S., Fisher, K. (eds.) Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2019, Phoenix, AZ, USA, June 22\u201326, 2019, pp. 1117\u20131132. ACM (2019). https:\/\/doi.org\/10.1145\/3314221.3314649. https:\/\/doi.org\/10.1145\/3314221.3314649","DOI":"10.1145\/3314221.3314649 10.1145\/3314221.3314649"},{"key":"5_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/978-3-030-25543-5_17","volume-title":"Computer Aided Verification","author":"SM Beillahi","year":"2019","unstructured":"Beillahi, S.M., Bouajjani, A., Enea, C.: Checking robustness against snapshot isolation. In: Dillig, I., Tasiran, S. (eds.) CAV 2019. LNCS, vol. 11562, pp. 286\u2013304. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-25543-5_17"},{"key":"5_CR3","doi-asserted-by":"publisher","unstructured":"Beillahi, S.M., Bouajjani, A., Enea, C.: Robustness against transactional causal consistency. In: Fokkink, W.J., van Glabbeek, R. (eds.) 30th International Conference on Concurrency Theory, CONCUR 2019, August 27\u201330, 2019, Amsterdam, the Netherlands. LIPIcs, vol. 140, pp. 30:1\u201330:18. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019). https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2019.30","DOI":"10.4230\/LIPIcs.CONCUR.2019.30"},{"key":"5_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-030-72019-3_4","volume-title":"Programming Languages and Systems","author":"SM Beillahi","year":"2021","unstructured":"Beillahi, S.M., Bouajjani, A., Enea, C.: Checking robustness between weak transactional consistency models. In: ESOP 2021. LNCS, vol. 12648, pp. 87\u2013117. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-72019-3_4"},{"key":"5_CR5","doi-asserted-by":"publisher","unstructured":"Bernardi, G., Gotsman, A.: Robustness against consistency models with atomic visibility. In: Desharnais, J., Jagadeesan, R. (eds.) 27th International Conference on Concurrency Theory, CONCUR 2016, August 23\u201326, 2016, Qu\u00e9bec City, Canada. LIPIcs, vol. 59, pp. 7:1\u20137:15. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2016). https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2016.7","DOI":"10.4230\/LIPIcs.CONCUR.2016.7"},{"key":"5_CR6","doi-asserted-by":"publisher","unstructured":"Bouajjani, A., Enea, C., Guerraoui, R., Hamza, J.: On verifying causal consistency. In: Castagna, G., Gordon, A.D. (eds.) Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, POPL 2017, Paris, France, 18\u201320 January 2017, pp. 626\u2013638. ACM (2017). https:\/\/doi.org\/10.1145\/3009837.3009888","DOI":"10.1145\/3009837.3009888"},{"key":"5_CR7","doi-asserted-by":"publisher","unstructured":"Brutschy, L., Dimitrov, D.K., M\u00fcller, P., Vechev, M.T.: Serializability for eventual consistency: criterion, analysis, and applications. In: Castagna, G., Gordon, A.D. (eds.) Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, POPL 2017, Paris, France, 18\u201320 January 2017, pp. 458\u2013472. ACM (2017). https:\/\/doi.org\/10.1145\/3009837.3009895","DOI":"10.1145\/3009837.3009895"},{"key":"5_CR8","doi-asserted-by":"publisher","unstructured":"Brutschy, L., Dimitrov, D.K., M\u00fcller, P., Vechev, M.T.: Static serializability analysis for causal consistency. In: Foster, J.S., Grossman, D. (eds.) Proceedings of the 39th ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2018, Philadelphia, PA, USA, 18\u201322 June 2018, pp. 90\u2013104. ACM (2018). https:\/\/doi.org\/10.1145\/3192366.3192415","DOI":"10.1145\/3192366.3192415"},{"key":"5_CR9","doi-asserted-by":"publisher","unstructured":"Burckhardt, S.: Principles of eventual consistency. Found. Trends Program. Lang. 1(1-2), 1\u2013150 (2014). https:\/\/doi.org\/10.1561\/2500000011","DOI":"10.1561\/2500000011"},{"key":"5_CR10","doi-asserted-by":"publisher","unstructured":"Burckhardt, S., Gotsman, A., Yang, H., Zawirski, M.: Replicated data types: specification, verification, optimality. In: Jagannathan, S., Sewell, P. (eds.) The 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2014, San Diego, CA, USA, 20\u201321 January 2014, pp. 271\u2013284. ACM (2014). https:\/\/doi.org\/10.1145\/2535838.2535848","DOI":"10.1145\/2535838.2535848"},{"key":"5_CR11","doi-asserted-by":"publisher","unstructured":"Burckhardt, S., Leijen, D., Protzenko, J., F\u00e4hndrich, M.: Global sequence protocol: a robust abstraction for replicated shared state. In: Boyland, J.T. (ed.) 29th European Conference on Object-Oriented Programming, ECOOP 2015, 5\u201310 July 2015, Prague, Czech Republic. LIPIcs, vol. 37, pp. 568\u2013590. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2015). https:\/\/doi.org\/10.4230\/LIPIcs.ECOOP.2015.568","DOI":"10.4230\/LIPIcs.ECOOP.2015.568"},{"key":"5_CR12","doi-asserted-by":"publisher","unstructured":"Cerone, A., Bernardi, G., Gotsman, A.: A framework for transactional consistency models with atomic visibility. In: Aceto, L., de Frutos-Escrig, D. (eds.) 26th International Conference on Concurrency Theory, CONCUR 2015, Madrid, Spain, September 1.4, 2015. LIPIcs, vol. 42, pp. 58\u201371. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2015). https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2015.58","DOI":"10.4230\/LIPIcs.CONCUR.2015.58"},{"key":"5_CR13","doi-asserted-by":"publisher","unstructured":"Cerone, A., Gotsman, A.: Analysing snapshot isolation. J. ACM 65(2), 11:1\u201311:41 (2018). https:\/\/doi.org\/10.1145\/3152396","DOI":"10.1145\/3152396"},{"key":"5_CR14","doi-asserted-by":"publisher","unstructured":"Gilbert, S., Lynch, N.A.: Brewer\u2019s conjecture and the feasibility of consistent, available, partition-tolerant web services. SIGACT News 33(2), 51\u201359 (2002). https:\/\/doi.org\/10.1145\/564585.564601","DOI":"10.1145\/564585.564601"},{"key":"5_CR15","doi-asserted-by":"publisher","unstructured":"Houshmand, F., Lesani, M.: Hamsaz: replication coordination analysis and synthesis. Proc. ACM Program. Lang. 3(POPL), 74:1\u201374:32 (2019). https:\/\/doi.org\/10.1145\/3290387","DOI":"10.1145\/3290387"},{"key":"5_CR16","doi-asserted-by":"publisher","unstructured":"Kaki, G., Priya, S., Sivaramakrishnan, K.C., Jagannathan, S.: Mergeable replicated data types. Proc. ACM Program. Lang. 3(OOPSLA) 154, 1\u2013154:29 (2019). https:\/\/doi.org\/10.1145\/3360580","DOI":"10.1145\/3360580"},{"key":"5_CR17","doi-asserted-by":"publisher","unstructured":"Kleppmann, M., Mulligan, D.P., Gomes, V.B.F., Beresford, A.R.: A highly-available move operation for replicated trees. IEEE Trans. Parallel Distributed Syst. 33(7), 1711\u20131724 (2022). https:\/\/doi.org\/10.1109\/TPDS.2021.3118603","DOI":"10.1109\/TPDS.2021.3118603"},{"key":"5_CR18","doi-asserted-by":"publisher","unstructured":"Lahav, O., Boker, U.: Decidable verification under a causally consistent shared memory. In: Donaldson, A.F., Torlak, E. (eds.) Proceedings of the 41st ACM SIGPLAN International Conference on Programming Language Design and Implementation, PLDI 2020, London, UK, 15\u201320 June 2020, pp. 211\u2013226. ACM (2020). https:\/\/doi.org\/10.1145\/3385412.3385966","DOI":"10.1145\/3385412.3385966"},{"key":"5_CR19","doi-asserted-by":"publisher","unstructured":"Lahav, O., Margalit, R.: Robustness against release\/acquire semantics. In: McKinley, K.S., Fisher, K. (eds.) Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2019, Phoenix, AZ, USA, 22\u201326 June 2019, pp. 126\u2013141. ACM (2019). https:\/\/doi.org\/10.1145\/3314221.3314604","DOI":"10.1145\/3314221.3314604"},{"key":"5_CR20","doi-asserted-by":"publisher","unstructured":"Lamport, L.: Time, clocks, and the ordering of events in a distributed system. Commun. ACM 21(7), 558\u2013565 (1978). https:\/\/doi.org\/10.1145\/359545.359563","DOI":"10.1145\/359545.359563"},{"key":"5_CR21","unstructured":"Li, C., Porto, D., Clement, A., Gehrke, J., Pregui\u00e7a, N.M., Rodrigues, R.: Making geo-replicated systems fast as possible, consistent when necessary. In: Thekkath, C., Vahdat, A. (eds.) 10th USENIX Symposium on Operating Systems Design and Implementation, OSDI 2012, Hollywood, CA, USA, 8\u201310 October 2012, pp. 265\u2013278. USENIX Association (2012), https:\/\/www.usenix.org\/conference\/osdi12\/technical-sessions\/presentation\/li"},{"key":"5_CR22","doi-asserted-by":"publisher","unstructured":"Nagar, K., Jagannathan, S.: Automated detection of serializability violations under weak consistency. In: Schewe, S., Zhang, L. (eds.) 29th International Conference on Concurrency Theory, CONCUR 2018, 4\u20137 September, 2018, Beijing, China. LIPIcs, vol. 118, pp. 41:1\u201341:18. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2018). https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2018.41","DOI":"10.4230\/LIPIcs.CONCUR.2018.41"},{"key":"5_CR23","doi-asserted-by":"publisher","unstructured":"Papadimitriou, C.H.: The serializability of concurrent database updates. J. ACM 26(4), 631\u2013653 (1979). https:\/\/doi.org\/10.1145\/322154.322158","DOI":"10.1145\/322154.322158"},{"key":"5_CR24","doi-asserted-by":"publisher","unstructured":"Perrin, M., Most\u00e9faoui, A., Jard, C.: Causal consistency: beyond memory. In: Asenjo, R., Harris, T. (eds.) Proceedings of the 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP 2016, Barcelona, Spain, 12\u201316 March 2016, pp. 26:1\u201326:12. ACM (2016). https:\/\/doi.org\/10.1145\/2851141.2851170, https:\/\/doi.org\/10.1145\/2851141.2851170","DOI":"10.1145\/2851141.2851170 10.1145\/2851141.2851170"},{"key":"5_CR25","doi-asserted-by":"crossref","unstructured":"Pregui\u00e7a, N.M., Baquero, C., Shapiro, M.: Conflict-free replicated data types (crdts). CoRR abs\/1805.06358 (2018). http:\/\/arxiv.org\/abs\/1805.06358","DOI":"10.1007\/978-3-319-63962-8_185-1"},{"key":"5_CR26","doi-asserted-by":"publisher","unstructured":"Shapiro, M., Ardekani, M.S., Petri, G.: Consistency in 3d. In: Desharnais, J., Jagadeesan, R. (eds.) 27th International Conference on Concurrency Theory, CONCUR 2016, August 23\u201326, 2016, Qu\u00e9bec City, Canada. LIPIcs, vol. 59, pp. 3:1\u20133:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2016). https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2016.3","DOI":"10.4230\/LIPIcs.CONCUR.2016.3"}],"container-title":["Lecture Notes in Computer Science","Networked Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-37765-5_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,6]],"date-time":"2023-07-06T19:02:54Z","timestamp":1688670174000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-37765-5_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031377648","9783031377655"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-37765-5_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"7 July 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NETYS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Networked Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Benguerir","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Morocco","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 May 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 May 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"netys2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/netys.net\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"9","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"29% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.6","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}