{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T05:57:20Z","timestamp":1777874240726,"version":"3.51.4"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032227195","type":"print"},{"value":"9783032227201","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T00:00:00Z","timestamp":1775779200000},"content-version":"vor","delay-in-days":99,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-22720-1_14","type":"book-chapter","created":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T15:29:53Z","timestamp":1775748593000},"page":"373-400","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Causal-Broadcast Memory"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-4563-2385","authenticated-orcid":false,"given":"Amir","family":"Karniel","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4305-6998","authenticated-orcid":false,"given":"Ori","family":"Lahav","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,4,10]]},"reference":[{"key":"14_CR1","doi-asserted-by":"publisher","unstructured":"Abdulla, P.A., Arora, J., Atig, M.F., Krishna, S.: Verification of programs under the release-acquire semantics. In: PLDI. pp. 1117\u20131132. ACM, New York, NY, USA (2019). https:\/\/doi.org\/10.1145\/3314221.3314649","DOI":"10.1145\/3314221.3314649"},{"key":"14_CR2","doi-asserted-by":"publisher","unstructured":"Abdulla, P.A., Atig, M.F., Bouajjani, A., Derevenetc, E., Leonardsson, C., Meyer, R.: On the state reachability problem for concurrent programs under Power. In: NETYS. pp. 47\u201359. Springer International Publishing, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-67087-0_4","DOI":"10.1007\/978-3-030-67087-0_4"},{"key":"14_CR3","doi-asserted-by":"publisher","unstructured":"Abdulla, P.A., Atig, M.F., Bouajjani, A., Ngo, T.P.: A load-buffer semantics for total store ordering. Logical Methods in Computer Science Volume 14, Issue 1 (Jan 2018). https:\/\/doi.org\/10.23638\/LMCS-14(1:9)2018","DOI":"10.23638\/LMCS-14(1:9)2018"},{"key":"14_CR4","doi-asserted-by":"publisher","unstructured":"Abdulla, P.A., Atig, M.F., Godbole, A., Krishna, S., Vafeiadis, V.: The decidability of verification under PS 2.0. In: ESOP. pp. 1\u201329. Springer International Publishing, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-72019-3_1","DOI":"10.1007\/978-3-030-72019-3_1"},{"key":"14_CR5","doi-asserted-by":"publisher","unstructured":"Abdulla, P.A., Atig, M.F., Jonsson, B., Ngo, T.P.: Optimal stateless model checking under the release-acquire semantics. Proc. ACM Program. Lang. 2(OOPSLA) (Oct 2018). https:\/\/doi.org\/10.1145\/3276505","DOI":"10.1145\/3276505"},{"key":"14_CR6","doi-asserted-by":"publisher","unstructured":"Ahamad, M., Neiger, G., Burns, J.E., Kohli, P., Hutto, P.W.: Causal memory: Definitions, implementation, and programming. Distributed Comput. 9(1), 37\u201349 (1995). https:\/\/doi.org\/10.1007\/BF01784241","DOI":"10.1007\/BF01784241"},{"key":"14_CR7","doi-asserted-by":"publisher","unstructured":"Alglave, J., Maranget, L., Tautschnig, M.: Herding cats: modelling, simulation, testing, and data mining for weak memory. ACM Trans. Program. Lang. Syst. 36(2), 7:1\u20137:74 (Jul 2014). https:\/\/doi.org\/10.1145\/2627752","DOI":"10.1145\/2627752"},{"key":"14_CR8","doi-asserted-by":"publisher","unstructured":"Atig, M.F., Bouajjani, A., Burckhardt, S., Musuvathi, M.: On the verification problem for weak memory models. In: POPL. p. 7\u201318. ACM, New York, NY, USA (2010). https:\/\/doi.org\/10.1145\/1706299.1706303","DOI":"10.1145\/1706299.1706303"},{"key":"14_CR9","doi-asserted-by":"publisher","unstructured":"Berenson, H., Bernstein, P., Gray, J., Melton, J., O\u2019Neil, E., O\u2019Neil, P.: A critique of ansi sql isolation levels. In: SIGMOD. p. 1\u201310. ACM, New York, NY, USA (1995). https:\/\/doi.org\/10.1145\/223784.223785","DOI":"10.1145\/223784.223785"},{"key":"14_CR10","doi-asserted-by":"publisher","unstructured":"Bouajjani, A., Enea, C., Guerraoui, R., Hamza, J.: On verifying causal consistency. In: POPL. p. 626\u2013638. ACM, New York, NY, USA (2017). https:\/\/doi.org\/10.1145\/3009837.3009888","DOI":"10.1145\/3009837.3009888"},{"key":"14_CR11","doi-asserted-by":"publisher","unstructured":"Brand, D., Zafiropulo, P.: On communicating finite-state machines. J. ACM 30(2), 323\u2013342 (Apr 1983). https:\/\/doi.org\/10.1145\/322374.322380","DOI":"10.1145\/322374.322380"},{"key":"14_CR12","doi-asserted-by":"publisher","unstructured":"Cerone, A., Bernardi, G., Gotsman, A.: A framework for transactional consistency models with atomic visibility. In: CONCUR. pp. 58\u201371. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2015). https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2015.58","DOI":"10.4230\/LIPIcs.CONCUR.2015.58"},{"key":"14_CR13","doi-asserted-by":"publisher","unstructured":"Chakraborty, S., Krishna, S.N., Mathur, U., Pavlogiannis, A.: How hard is weak-memory testing? Proc. ACM Program. Lang. 8(POPL) (Jan 2024). https:\/\/doi.org\/10.1145\/3632908","DOI":"10.1145\/3632908"},{"key":"14_CR14","doi-asserted-by":"publisher","unstructured":"Di Giusto, C., Ferr\u00e9, D., Laversa, L., Lozes, E.: A partial order view of message-passing communication models. Proc. ACM Program. Lang. 7(POPL) (Jan 2023). https:\/\/doi.org\/10.1145\/3571248","DOI":"10.1145\/3571248"},{"key":"14_CR15","doi-asserted-by":"publisher","unstructured":"Furbach, F., Meyer, R., Schneider, K., Senftleben, M.: Memory-model-aware testing: A unified complexity analysis. ACM Trans. Embed. Comput. Syst. 14(4) (Sep 2015). https:\/\/doi.org\/10.1145\/2753761","DOI":"10.1145\/2753761"},{"key":"14_CR16","doi-asserted-by":"publisher","unstructured":"Gondelman, L., Gregersen, S.O., Nieto, A., Timany, A., Birkedal, L.: Distributed causal memory: modular specification and verification in higher-order distributed separation logic. Proc. ACM Program. Lang. 5(POPL) (Jan 2021). https:\/\/doi.org\/10.1145\/3434323","DOI":"10.1145\/3434323"},{"key":"14_CR17","doi-asserted-by":"publisher","unstructured":"Kozen, D.: Lower bounds for natural proof systems. In: SFCS. p. 254\u2013266. IEEE Computer Society, USA (1977). https:\/\/doi.org\/10.1109\/SFCS.1977.16","DOI":"10.1109\/SFCS.1977.16"},{"key":"14_CR18","doi-asserted-by":"publisher","unstructured":"Lahav, O., Boker, U.: What\u2019s decidable about causally consistent shared memory? ACM Trans. Program. Lang. Syst. 44(2) (Apr 2022). https:\/\/doi.org\/10.1145\/3505273","DOI":"10.1145\/3505273"},{"key":"14_CR19","doi-asserted-by":"publisher","unstructured":"Lahav, O., Giannarakis, N., Vafeiadis, V.: Taming release-acquire consistency. In: POPL. p. 649\u2013662. ACM, New York, NY, USA (2016). https:\/\/doi.org\/10.1145\/2837614.2837643","DOI":"10.1145\/2837614.2837643"},{"key":"14_CR20","doi-asserted-by":"publisher","unstructured":"Lahav, O., Vafeiadis, V.: Owicki-gries reasoning for weak memory models. In: ICALP. pp. 311\u2013323. Springer (2015). https:\/\/doi.org\/10.1007\/978-3-662-47666-6_25","DOI":"10.1007\/978-3-662-47666-6_25"},{"key":"14_CR21","doi-asserted-by":"publisher","unstructured":"Lamport, L.: How to make a multiprocessor computer that correctly executes multiprocess programs. IEEE Trans. Comput. 28(9), 690\u2013691 (Sep1979). https:\/\/doi.org\/10.1109\/TC.1979.1675439","DOI":"10.1109\/TC.1979.1675439"},{"key":"14_CR22","doi-asserted-by":"publisher","unstructured":"Lamport, L.: Time, clocks, and the ordering of events in a distributed system. Commun. ACM 21(7), 558\u2013565 (Jul 1978). https:\/\/doi.org\/10.1145\/359545.359563","DOI":"10.1145\/359545.359563"},{"key":"14_CR23","doi-asserted-by":"publisher","unstructured":"Lesani, M., Bell, C.J., Chlipala, A.: Chapar: certified causally consistent distributed key-value stores. In: POPL. p. 357\u2013370. ACM, New York, NY, USA (2016). https:\/\/doi.org\/10.1145\/2837614.2837622","DOI":"10.1145\/2837614.2837622"},{"key":"14_CR24","doi-asserted-by":"publisher","unstructured":"Lloyd, W., Freedman, M.J., Kaminsky, M., Andersen, D.G.: Stronger semantics for low-latency geo-replicated storage. In: NSDI. p. 313\u2013328. USENIX Association, USA (2013), https:\/\/doi.org\/10.5555\/2482626.2482657","DOI":"10.5555\/2482626.2482657"},{"key":"14_CR25","unstructured":"Most\u00e9faoui, A., Perrin, M., Raynal, M.: Extending causal consistency to any object defined by a sequential specification. Bull. EATCS 125 (2018), http:\/\/eatcs.org\/beatcs\/index.php\/beatcs\/article\/view\/545."},{"key":"14_CR26","doi-asserted-by":"publisher","unstructured":"Owens, S., Sarkar, S., Sewell, P.: A better x86 memory model: x86-TSO. In: TPHOLs. pp. 391\u2013407. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03359-9_27","DOI":"10.1007\/978-3-642-03359-9_27"},{"key":"14_CR27","doi-asserted-by":"publisher","unstructured":"Perrin, M., Mostefaoui, A., Jard, C.: Causal consistency: beyond memory. In: PPoPP. ACM, New York, NY, USA (2016). https:\/\/doi.org\/10.1145\/2851141.2851170","DOI":"10.1145\/2851141.2851170"},{"key":"14_CR28","doi-asserted-by":"publisher","unstructured":"Raynal, M., Schiper, A., Toueg, S.: The causal ordering abstraction and a simple way to implement it. Inf. Process. Lett. 39(6), 343\u2013350 (Oct 1991). https:\/\/doi.org\/10.1016\/0020-0190(91)90008-6","DOI":"10.1016\/0020-0190(91)90008-6"},{"key":"14_CR29","doi-asserted-by":"publisher","unstructured":"Schiper, A., Eggli, J., Sandoz, A.: A new algorithm to implement causal ordering. vol. 392, pp. 219\u2013232 (09 1989). https:\/\/doi.org\/10.1007\/3-540-51687-5_45","DOI":"10.1007\/3-540-51687-5_45"},{"key":"14_CR30","doi-asserted-by":"publisher","unstructured":"Sovran, Y., Power, R., Aguilera, M.K., Li, J.: Transactional storage for geo-replicated systems. In: SOSP. p. 385\u2013400. ACM, New York, NY, USA (2011). https:\/\/doi.org\/10.1145\/2043556.2043592","DOI":"10.1145\/2043556.2043592"},{"key":"14_CR31","doi-asserted-by":"publisher","unstructured":"Tun\u00e7, H.C., Abdulla, P.A., Chakraborty, S., Krishna, S., Mathur, U., Pavlogiannis, A.: Optimal reads-from consistency checking for C11-style memory models. Proc. ACM Program. Lang. 7(PLDI) (Jun 2023). https:\/\/doi.org\/10.1145\/3591251","DOI":"10.1145\/3591251"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-22720-1_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T19:23:57Z","timestamp":1777577037000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-22720-1_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032227195","9783032227201"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-22720-1_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"10 April 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ESOP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Symposium on Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Turin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 April 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 April 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"35","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"esop2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/etaps.org\/about\/esop\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}