{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T12:19:22Z","timestamp":1743077962949,"version":"3.40.3"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031787089"},{"type":"electronic","value":"9783031787096"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-78709-6_9","type":"book-chapter","created":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T22:10:30Z","timestamp":1738361430000},"page":"181-202","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Dynamic Partial Order Reduction for Transactional Programs on Serializable Platforms"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6832-6611","authenticated-orcid":false,"given":"Parosh Aziz","family":"Abdulla","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-7755-2006","authenticated-orcid":false,"given":"Ashutosh","family":"Gupta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0925-398X","authenticated-orcid":false,"given":"Shankara Narayanan","family":"Krishna","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-1197-5556","authenticated-orcid":false,"given":"Omkar","family":"Tuppe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,2,1]]},"reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/978-3-662-46681-0_28","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"PA Abdulla","year":"2015","unstructured":"Abdulla, P.A., Aronis, S., Atig, M.F., Jonsson, B., Leonardsson, C., Sagonas, K.: Stateless model checking for tso and pso. In: Baier, C., Tinelli, C. (eds.) Tools and Algorithms for the Construction and Analysis of Systems, pp. 353\u2013367. Springer, Berlin Heidelberg, Berlin, Heidelberg (2015)"},{"key":"9_CR2","doi-asserted-by":"publisher","unstructured":"Abdulla, P.A., Aronis, S., Jonsson, B., Sagonas, K.: Source sets: A foundation for optimal dynamic partial order reduction. J. ACM 64(4), 25:1\u201325:49 (2017). https:\/\/doi.org\/10.1145\/3073408","DOI":"10.1145\/3073408"},{"key":"9_CR3","doi-asserted-by":"publisher","unstructured":"Abdulla, P.A., Atig, M.F., Jonsson, B., L\u00e5ng, M., Ngo, T.P., Sagonas, K.: Optimal stateless model checking for reads-from equivalence under sequential consistency. Proc. ACM Program. Lang. 3(OOPSLA) (Oct 2019). https:\/\/doi.org\/10.1145\/3360576, https:\/\/doi.org\/10.1145\/3360576","DOI":"10.1145\/3360576"},{"key":"9_CR4","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":"9_CR5","doi-asserted-by":"publisher","unstructured":"Abdulla, P.A., Atig, M.F., Krishna, S., Gupta, A., Tuppe, O.: Optimal stateless model checking for causal consistency. In: Sankaranarayanan, S., Sharygina, N. (eds.) Tools and Algorithms for the Construction and Analysis of Systems - 29th International Conference, TACAS 2023, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022, Paris, France, April 22-27, 2023, Proceedings, Part I. Lecture Notes in Computer Science, vol. 13993, pp. 105\u2013125. Springer (2023). https:\/\/doi.org\/10.1007\/978-3-031-30823-9_6","DOI":"10.1007\/978-3-031-30823-9_6"},{"key":"9_CR6","doi-asserted-by":"publisher","unstructured":"Ahamad, M., Neiger, G., Burns, J.E., Kohli, P., Hutto, P.W.: Causal memory: Definitions, implementation, and programming. Distrib. Comput. 9(1), 37\u201349 (Mar 1995). https:\/\/doi.org\/10.1007\/BF01784241","DOI":"10.1007\/BF01784241"},{"key":"9_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) (jul 2014). https:\/\/doi.org\/10.1145\/2627752","DOI":"10.1145\/2627752"},{"key":"9_CR8","doi-asserted-by":"publisher","unstructured":"anonymous: Transactional jpf (Apr 2023). https:\/\/doi.org\/10.5281\/zenodo.7824546","DOI":"10.5281\/zenodo.7824546"},{"key":"9_CR9","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: Yoshida, N. (ed.) Programming Languages and Systems, pp. 87\u2013117. Springer International Publishing, Cham (2021)"},{"key":"9_CR10","doi-asserted-by":"publisher","unstructured":"Beillahi, S.M., Bouajjani, A., Enea, C.: Robustness Against Transactional Causal Consistency. Logical Methods in Computer Science Volume 17, Issue 1 (Feb 2021). https:\/\/doi.org\/10.23638\/LMCS-17(1:12)2021. https:\/\/lmcs.episciences.org\/7149","DOI":"10.23638\/LMCS-17(1:12)2021"},{"key":"9_CR11","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: Proceedings of the 1995 ACM SIGMOD International Conference on Management of Data, pp. 1\u201310. SIGMOD \u201995, Association for Computing Machinery, New York, NY, USA (1995). https:\/\/doi.org\/10.1145\/223784.223785","DOI":"10.1145\/223784.223785"},{"key":"9_CR12","doi-asserted-by":"publisher","unstructured":"Biswas, R., Enea, C.: On the complexity of checking transactional consistency. Proc. ACM Program. Lang. 3(OOPSLA) (Oct 2019). https:\/\/doi.org\/10.1145\/3360591","DOI":"10.1145\/3360591"},{"key":"9_CR13","doi-asserted-by":"publisher","unstructured":"Bouajjani, A., Enea, C., Guerraoui, R., Hamza, J.: On verifying causal consistency. SIGPLAN Not. 52(1), 626\u2013638 (Jan 2017). https:\/\/doi.org\/10.1145\/3093333.3009888","DOI":"10.1145\/3093333.3009888"},{"key":"9_CR14","doi-asserted-by":"publisher","unstructured":"Bouajjani, A., Enea, C., Rom\u00e1n-Calvo, E.: Dynamic partial order reduction for checking correctness against transaction isolation levels. Proc. ACM Program. Lang. 7(PLDI), 565\u2013590 (2023). https:\/\/doi.org\/10.1145\/3591243","DOI":"10.1145\/3591243"},{"key":"9_CR15","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, January 18-20, 2017, pp. 458\u2013472. ACM (2017). https:\/\/doi.org\/10.1145\/3009837.3009895","DOI":"10.1145\/3009837.3009895"},{"key":"9_CR16","doi-asserted-by":"publisher","unstructured":"Burckhardt, S.: Principles of eventual consistency. Found. Trends Program. Lang. 1(1\u20132), 1\u2013150 (2014). https:\/\/doi.org\/10.1561\/2500000011","DOI":"10.1561\/2500000011"},{"key":"9_CR17","doi-asserted-by":"publisher","unstructured":"Cahill, M.J., R\u00f6hm, U., Fekete, A.D.: Serializable isolation for snapshot databases. In: Wang, J.T. (ed.) Proceedings of the ACM SIGMOD International Conference on Management of Data, SIGMOD 2008, Vancouver, BC, Canada, June 10-12, 2008, pp. 729\u2013738. ACM (2008). https:\/\/doi.org\/10.1145\/1376616.1376690","DOI":"10.1145\/1376616.1376690"},{"key":"9_CR18","doi-asserted-by":"publisher","unstructured":"Cerone, A., Bernardi, G., Gotsman, A.: A framework for transactional consistency models with atomic visibility. In: Aceto, L., de\u00a0Frutos-Escrig, D. (eds.) 26th International Conference on Concurrency Theory, CONCUR 2015, Madrid, Spain, September 1.4, 2015. LIPIcs, vol.\u00a042, 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":"9_CR19","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":"9_CR20","doi-asserted-by":"publisher","unstructured":"Clarke, E.M., Emerson, E.A., Sistla, A.P.: Automatic verification of finite state concurrent systems using temporal logic specifications: A practical approach. In: Wright, J.R., Landweber, L., Demers, A.J., Teitelbaum, T. (eds.) Conference Record of the Tenth Annual ACM Symposium on Principles of Programming Languages, Austin, Texas, USA, January 1983, pp. 117\u2013126. ACM Press (1983). https:\/\/doi.org\/10.1145\/567067.567080","DOI":"10.1145\/567067.567080"},{"key":"9_CR21","doi-asserted-by":"publisher","unstructured":"Clarke, E.M., Grumberg, O., Minea, M., Peled, D.A.: State space reduction using partial order techniques. Int. J. Softw. Tools Technol. Transf. 2(3), 279\u2013287 (1999). https:\/\/doi.org\/10.1007\/s100090050035","DOI":"10.1007\/s100090050035"},{"key":"9_CR22","doi-asserted-by":"crossref","unstructured":"Difallah, D., Pavlo, A., Curino, C., CudreMauroux, P.: Oltp-bench: An extensible testbed for benchmarking relational databases. Proc. VLDB Endowm. 7, 277\u2013288 (12 2013)","DOI":"10.14778\/2732240.2732246"},{"key":"9_CR23","doi-asserted-by":"publisher","unstructured":"Flanagan, C., Godefroid, P.: Dynamic partial-order reduction for model checking software. In: Palsberg, J., Abadi, M. (eds.) Proceedings of the 32nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2005, Long Beach, California, USA, January 12-14, 2005, pp. 110\u2013121. ACM (2005). https:\/\/doi.org\/10.1145\/1040305.1040315","DOI":"10.1145\/1040305.1040315"},{"key":"9_CR24","doi-asserted-by":"publisher","unstructured":"Gibbons, P.B., Korach, E.: Testing shared memories. SIAM J. Comput. 26(4), 1208\u20131244 (1997). https:\/\/doi.org\/10.1137\/S0097539794279614","DOI":"10.1137\/S0097539794279614"},{"key":"9_CR25","doi-asserted-by":"publisher","unstructured":"Godefroid, P.: Partial-Order Methods for the Verification of Concurrent Systems - An Approach to the State-Explosion Problem, Lecture Notes in Computer Science, vol.\u00a01032. Springer (1996). https:\/\/doi.org\/10.1007\/3-540-60761-7","DOI":"10.1007\/3-540-60761-7"},{"key":"9_CR26","doi-asserted-by":"publisher","unstructured":"Godefroid, P.: Model checking for programming languages using verisoft. In: Proceedings of the 24th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 174\u2013186. POPL \u201997, Association for Computing Machinery, New York, NY, USA (1997). https:\/\/doi.org\/10.1145\/263699.263717","DOI":"10.1145\/263699.263717"},{"key":"9_CR27","doi-asserted-by":"publisher","unstructured":"Kokologiannakis, M., Lahav, O., Sagonas, K., Vafeiadis, V.: Effective stateless model checking for C\/C++ concurrency. Proc. ACM Program. Lang. 2(POPL), 17:1\u201317:32 (2018). https:\/\/doi.org\/10.1145\/3158105","DOI":"10.1145\/3158105"},{"key":"9_CR28","doi-asserted-by":"publisher","unstructured":"Kokologiannakis, M., Marmanis, I., Gladstein, V., Vafeiadis, V.: Truly stateless, optimal dynamic partial order reduction. Proc. ACM Program. Lang. 6(POPL), 1\u201328 (2022). https:\/\/doi.org\/10.1145\/3498711","DOI":"10.1145\/3498711"},{"key":"9_CR29","doi-asserted-by":"publisher","unstructured":"Kokologiannakis, M., Raad, A., Vafeiadis, V.: Model checking for weakly consistent libraries. 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-26, 2019, pp. 96\u2013110. ACM (2019). https:\/\/doi.org\/10.1145\/3314221.3314609","DOI":"10.1145\/3314221.3314609"},{"key":"9_CR30","doi-asserted-by":"crossref","unstructured":"Mazurkiewicz, A.: Trace theory. In: Advances in Petri Nets 1986. Part II on Petri Nets: Applications and Relationships to Other Models of Concurrency, pp. 279\u2013324. Springer-Verlag, Berlin, Heidelberg (1987)","DOI":"10.1007\/3-540-17906-2_30"},{"key":"9_CR31","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1007\/978-3-030-44914-8_20","volume-title":"Programming Languages and Systems","author":"SS Nair","year":"2020","unstructured":"Nair, S.S., Petri, G., Shapiro, M.: Proving the safety of highly-available distributed objects. In: M\u00fcller, P. (ed.) Programming Languages and Systems, pp. 544\u2013571. Springer International Publishing, Cham (2020)"},{"key":"9_CR32","doi-asserted-by":"publisher","unstructured":"Norris, B., Demsky, B.: A practical approach for model checking c\/c++11 code. ACM Trans. Program. Lang. Syst. 38(3) (May 2016). https:\/\/doi.org\/10.1145\/2806886","DOI":"10.1145\/2806886"},{"key":"9_CR33","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":"9_CR34","doi-asserted-by":"publisher","unstructured":"Peled, D.A.: All from one, one for all: on model checking using representatives. In: Courcoubetis, C. (ed.) Computer Aided Verification, 5th International Conference, CAV \u201993, Elounda, Greece, June 28 - July 1, 1993, Proceedings. Lecture Notes in Computer Science, vol.\u00a0697, pp. 409\u2013423. Springer (1993). https:\/\/doi.org\/10.1007\/3-540-56922-7_34","DOI":"10.1007\/3-540-56922-7_34"},{"key":"9_CR35","doi-asserted-by":"publisher","unstructured":"Perrin, M., Mostefaoui, A., Jard, C.: Causal consistency: Beyond memory. SIGPLAN Not. 51(8) (feb 2016). https:\/\/doi.org\/10.1145\/3016078.2851170","DOI":"10.1145\/3016078.2851170"},{"key":"9_CR36","doi-asserted-by":"publisher","unstructured":"Sivaramakrishnan, K., Kaki, G., Jagannathan, S.: Declarative programming over eventually consistent data stores. SIGPLAN Not. 50(6), 413\u2013424 (jun 2015). https:\/\/doi.org\/10.1145\/2813885.2737981","DOI":"10.1145\/2813885.2737981"},{"key":"9_CR37","doi-asserted-by":"publisher","unstructured":"Warszawski, T., Bailis, P.: Acidrain: Concurrency-related attacks on database-backed web applications. In: Salihoglu, S., Zhou, W., Chirkova, R., Yang, J., Suciu, D. (eds.) Proceedings of the 2017 ACM International Conference on Management of Data, SIGMOD Conference 2017, Chicago, IL, USA, May 14-19, 2017, pp. 5\u201320. ACM (2017). https:\/\/doi.org\/10.1145\/3035918.3064037","DOI":"10.1145\/3035918.3064037"},{"key":"9_CR38","doi-asserted-by":"publisher","unstructured":"Zhang, N., Kusano, M., Wang, C.: Dynamic partial order reduction for relaxed memory models. In: Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 250\u2013259. PLDI \u201915, Association for Computing Machinery, New York, NY, USA (2015). https:\/\/doi.org\/10.1145\/2737924.2737956","DOI":"10.1145\/2737924.2737956"}],"container-title":["Lecture Notes in Computer Science","Automated Technology for Verification and Analysis"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-78709-6_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T22:10:34Z","timestamp":1738361434000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-78709-6_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031787089","9783031787096"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-78709-6_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"1 February 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ATVA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Automated Technology for Verification and Analysis","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kyoto","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 October 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 October 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"atva2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}