{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:37:18Z","timestamp":1742913438371,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030853143"},{"type":"electronic","value":"9783030853150"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-85315-0_4","type":"book-chapter","created":{"date-parts":[[2021,8,19]],"date-time":"2021-08-19T12:05:42Z","timestamp":1629374742000},"page":"47-64","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the Correctness Problem for Serializability"],"prefix":"10.1007","author":[{"given":"J\u00fcrgen","family":"K\u00f6nig","sequence":"first","affiliation":[]},{"given":"Heike","family":"Wehrheim","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,8,20]]},"reference":[{"issue":"1\u20132","key":"4_CR1","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1006\/inco.1999.2847","volume":"160","author":"R Alur","year":"2000","unstructured":"Alur, R., McMillan, K.L., Peled, D.A.: Model-checking of correctness conditions for concurrent objects. Inf. Comput. 160(1\u20132), 167\u2013188 (2000). https:\/\/doi.org\/10.1006\/inco.1999.2847","journal-title":"Inf. Comput."},{"key":"4_CR2","unstructured":"Armstrong, A., Dongol, B., Doherty, S.: Reducing opacity to linearizability: a sound and complete method. CoRR abs\/1610.01004 (2016). http:\/\/arxiv.org\/abs\/1610.01004"},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/978-3-642-37036-6_17","volume-title":"Programming Languages and Systems","author":"A Bouajjani","year":"2013","unstructured":"Bouajjani, A., Emmi, M., Enea, C., Hamza, J.: Verifying concurrent programs against sequential specifications. In: Felleisen, M., Gardner, P. (eds.) ESOP 2013. LNCS, vol. 7792, pp. 290\u2013309. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-37036-6_17"},{"issue":"Part","key":"4_CR4","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/j.ic.2018.02.014","volume":"261","author":"A Bouajjani","year":"2018","unstructured":"Bouajjani, A., Emmi, M., Enea, C., Hamza, J.: On reducing linearizability to state reachability. Inf. Comput. 261(Part), 383\u2013400 (2018). https:\/\/doi.org\/10.1016\/j.ic.2018.02.014","journal-title":"Inf. Comput."},{"key":"4_CR5","doi-asserted-by":"publisher","unstructured":"Cohen, A., O\u2019Leary, J.W., Pnueli, A., Tuttle, M.R., Zuck, L.D.: Verifying correctness of transactional memories. In: Formal Methods in Computer-Aided Design, 7th International Conference, FMCAD 2007, Austin, Texas, USA, 11\u201314 November 2007, Proceedings, pp. 37\u201344. IEEE Computer Society (2007). https:\/\/doi.org\/10.1109\/FAMCAD.2007.40","DOI":"10.1109\/FAMCAD.2007.40"},{"key":"4_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/978-3-319-06410-9_15","volume-title":"FM 2014: Formal Methods","author":"J Derrick","year":"2014","unstructured":"Derrick, J., Dongol, B., Schellhorn, G., Tofan, B., Travkin, O., Wehrheim, H.: Quiescent consistency: defining and verifying relaxed linearizability. In: Jones, C., Pihlajasaari, P., Sun, J. (eds.) FM 2014. LNCS, vol. 8442, pp. 200\u2013214. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-06410-9_15"},{"issue":"5","key":"4_CR7","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1007\/s00165-012-0225-8","volume":"25","author":"S Doherty","year":"2013","unstructured":"Doherty, S., Groves, L., Luchangco, V., Moir, M.: Towards formally specifying and verifying transactional memory. Formal Aspects Comput. 25(5), 769\u2013799 (2013). https:\/\/doi.org\/10.1007\/s00165-012-0225-8","journal-title":"Formal Aspects Comput."},{"key":"4_CR8","doi-asserted-by":"publisher","unstructured":"Dongol, B., Hierons, R.M.: Decidability and complexity for quiescent consistency. In: Grohe, M., Koskinen, E., Shankar, N. (eds.) Proceedings of the 31st Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS \u201916, New York, NY, USA, 5\u20138 July 2016, pp. 116\u2013125. ACM (2016). https:\/\/doi.org\/10.1145\/2933575.2933576","DOI":"10.1145\/2933575.2933576"},{"key":"4_CR9","doi-asserted-by":"publisher","unstructured":"Emmi, M., Majumdar, R., Manevich, R.: Parameterized verification of transactional memories. In: Zorn, B.G., Aiken, A. (eds.) Proceedings of the 2010 ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2010, Toronto, Ontario, Canada, 5\u201310 June 2010, pp. 134\u2013145. ACM (2010). https:\/\/doi.org\/10.1145\/1806596.1806613","DOI":"10.1145\/1806596.1806613"},{"issue":"11","key":"4_CR10","doi-asserted-by":"publisher","first-page":"624","DOI":"10.1145\/360363.360369","volume":"19","author":"KP Eswaran","year":"1976","unstructured":"Eswaran, K.P., Gray, J., Lorie, R.A., Traiger, I.L.: The notions of consistency and predicate locks in a database system. Commun. ACM 19(11), 624\u2013633 (1976). https:\/\/doi.org\/10.1145\/360363.360369","journal-title":"Commun. ACM"},{"key":"4_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/978-3-540-70545-1_8","volume-title":"Computer Aided Verification","author":"A Farzan","year":"2008","unstructured":"Farzan, A., Madhusudan, P.: Monitoring atomicity in concurrent programs. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol. 5123, pp. 52\u201365. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-70545-1_8"},{"key":"4_CR12","doi-asserted-by":"publisher","unstructured":"Gibbons, P.B., Korach, E.: The complexity of sequential consistency. In: Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing, SPDP 1992, Arlington, Texas, USA, 1\u20134 December 1992, pp. 317\u2013325. IEEE Computer Society (1992). https:\/\/doi.org\/10.1109\/SPDP.1992.242728","DOI":"10.1109\/SPDP.1992.242728"},{"issue":"3","key":"4_CR13","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/s00446-009-0092-6","volume":"22","author":"R Guerraoui","year":"2010","unstructured":"Guerraoui, R., Henzinger, T.A., Singh, V.: Model checking transactional memories. Distrib. Comput. 22(3), 129\u2013145 (2010). https:\/\/doi.org\/10.1007\/s00446-009-0092-6","journal-title":"Distrib. Comput."},{"key":"4_CR14","doi-asserted-by":"publisher","unstructured":"Guerraoui, R., Kapalka, M.: On the correctness of transactional memory. In: Chatterjee, S., Scott, M.L. (eds.) Proceedings of the 13th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP 2008, Salt Lake City, UT, USA, 20\u201323 February 2008, pp. 175\u2013184. ACM (2008). https:\/\/doi.org\/10.1145\/1345206.1345233","DOI":"10.1145\/1345206.1345233"},{"key":"4_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/3-540-48683-6_27","volume-title":"Computer Aided Verification","author":"TA Henzinger","year":"1999","unstructured":"Henzinger, T.A., Qadeer, S., Rajamani, S.K.: Verifying sequential consistency on shared-memory multiprocessor systems. In: Halbwachs, N., Peled, D. (eds.) CAV 1999. LNCS, vol. 1633, pp. 301\u2013315. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48683-6_27"},{"issue":"3","key":"4_CR16","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/78969.78972","volume":"12","author":"M Herlihy","year":"1990","unstructured":"Herlihy, M., Wing, J.M.: Linearizability: a correctness condition for concurrent objects. ACM Trans. Program. Lang. Syst. 12(3), 463\u2013492 (1990). https:\/\/doi.org\/10.1145\/78969.78972","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"4_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/978-3-642-05089-3_21","volume-title":"FM 2009: Formal Methods","author":"Y Liu","year":"2009","unstructured":"Liu, Y., Chen, W., Liu, Y.A., Sun, J.: Model checking linearizability via refinement. In: Cavalcanti, A., Dams, D.R. (eds.) FM 2009. LNCS, vol. 5850, pp. 321\u2013337. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-05089-3_21"},{"key":"4_CR18","doi-asserted-by":"publisher","unstructured":"O\u2019Leary, J.W., Saha, B., Tuttle, M.R.: Model checking transactional memory with spin. In: 29th IEEE International Conference on Distributed Computing Systems (ICDCS 2009), Montreal, Qu\u00e9bec, Canada, 22\u201326 June 2009, pp. 335\u2013342. IEEE Computer Society (2009). https:\/\/doi.org\/10.1109\/ICDCS.2009.72","DOI":"10.1109\/ICDCS.2009.72"},{"issue":"4","key":"4_CR19","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1145\/322154.322158","volume":"26","author":"CH Papadimitriou","year":"1979","unstructured":"Papadimitriou, C.H.: The serializability of concurrent database updates. J. ACM 26(4), 631\u2013653 (1979). https:\/\/doi.org\/10.1145\/322154.322158","journal-title":"J. ACM"},{"issue":"8","key":"4_CR20","doi-asserted-by":"publisher","first-page":"730","DOI":"10.1109\/TPDS.2003.1225053","volume":"14","author":"S Qadeer","year":"2003","unstructured":"Qadeer, S.: Verifying sequential consistency on shared-memory multiprocessors by model checking. IEEE Trans. Parallel Distrib. Syst. 14(8), 730\u2013741 (2003). https:\/\/doi.org\/10.1109\/TPDS.2003.1225053","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"4_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1007\/978-3-642-14295-6_40","volume-title":"Computer Aided Verification","author":"V Vafeiadis","year":"2010","unstructured":"Vafeiadis, V.: Automatically proving linearizability. In: Touili, T., Cook, B., Jackson, P. (eds.) CAV 2010. LNCS, vol. 6174, pp. 450\u2013464. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14295-6_40"},{"key":"4_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/978-3-642-02652-2_21","volume-title":"Model Checking Software","author":"M Vechev","year":"2009","unstructured":"Vechev, M., Yahav, E., Yorsh, G.: Experience with model checking linearizability. In: P\u0103s\u0103reanu, C.S. (ed.) SPIN 2009. LNCS, vol. 5578, pp. 261\u2013278. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02652-2_21"},{"key":"4_CR23","doi-asserted-by":"publisher","unstructured":"Zhang, S.J.: Scalable automatic linearizability checking. In: Taylor, R.N., Gall, H.C., Medvidovic, N. (eds.) Proceedings of the 33rd International Conference on Software Engineering, ICSE 2011, Waikiki, Honolulu, HI, USA, 21\u201328 May 2011, pp. 1185\u20131187. ACM (2011). https:\/\/doi.org\/10.1145\/1985793.1986037","DOI":"10.1145\/1985793.1986037"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing \u2013 ICTAC 2021"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-85315-0_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,27]],"date-time":"2021-08-27T00:00:01Z","timestamp":1630022401000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-85315-0_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030853143","9783030853150"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-85315-0_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"20 August 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICTAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Colloquium on Theoretical Aspects of Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ictac2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ictac2021.github.io\/","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":"55","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":"20","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":"0","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":"36% - 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","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","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)"}}]}}