{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T03:24:44Z","timestamp":1779074684821,"version":"3.51.4"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031471148","type":"print"},{"value":"9783031471155","type":"electronic"}],"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-47115-5_17","type":"book-chapter","created":{"date-parts":[[2023,10,30]],"date-time":"2023-10-30T15:04:38Z","timestamp":1698678278000},"page":"301-319","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Verifying Read-Copy Update Under RC11"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0563-0525","authenticated-orcid":false,"given":"Mikhail","family":"Semenyuk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7053-4364","authenticated-orcid":false,"given":"Mark","family":"Batty","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0446-3507","authenticated-orcid":false,"given":"Brijesh","family":"Dongol","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,10,31]]},"reference":[{"key":"17_CR1","unstructured":"Batty, M.J.: The C11 and C++11 concurrency model. Ph.D. thesis, University of Cambridge, UK (2015). https:\/\/ethos.bl.uk\/OrderDetails.do?uin=uk.bl.ethos.708458"},{"key":"17_CR2","doi-asserted-by":"publisher","unstructured":"Bila, E.V., Dongol, B., Lahav, O., Raad, A., Wickerson, J.: View-based owicki-gries reasoning for persistent x86-tso. In: Sergey, I. (ed.) ESOP. LNCS, vol. 13240, pp. 234\u2013261. Springer (2022). https:\/\/doi.org\/10.1007\/978-3-030-99336-8_9","DOI":"10.1007\/978-3-030-99336-8_9"},{"key":"17_CR3","doi-asserted-by":"publisher","unstructured":"Dalvandi, S., Doherty, S., Dongol, B., Wehrheim, H.: Owicki-Gries reasoning for C11 RAR. In: Hirschfeld, R., Pape, T. (eds.) ECOOP. LIPIcs, vol. 166, pp. 11:1\u201311:26. Dagstuhl (2020). https:\/\/doi.org\/10.4230\/LIPIcs.ECOOP.2020.11","DOI":"10.4230\/LIPIcs.ECOOP.2020.11"},{"issue":"OOPSLA2","key":"17_CR4","doi-asserted-by":"publisher","first-page":"1817","DOI":"10.1145\/3563352","volume":"6","author":"S Dalvandi","year":"2022","unstructured":"Dalvandi, S., Dongol, B.: Implementing and verifying release-acquire transactional memory in C11. Proc. ACM Program. Lang. 6(OOPSLA2), 1817\u20131844 (2022). https:\/\/doi.org\/10.1145\/3563352","journal-title":"Proc. ACM Program. Lang."},{"key":"17_CR5","doi-asserted-by":"publisher","unstructured":"Dalvandi, S., Dongol, B., Doherty, S., Wehrheim, H.: Integrating Owicki-Gries for C11-style memory models into Isabelle\/HOL. J. Autom. Reason. 66(1), 141\u2013171 (2022). https:\/\/doi.org\/10.1007\/s10817-021-09610-2","DOI":"10.1007\/s10817-021-09610-2"},{"key":"17_CR6","doi-asserted-by":"publisher","unstructured":"Dechev, D.: The ABA problem in multicore data structures with collaborating operations. In: CollaborateCom, pp. 158\u2013167 (2011). https:\/\/doi.org\/10.4108\/icst.collaboratecom.2011.247161","DOI":"10.4108\/icst.collaboratecom.2011.247161"},{"key":"17_CR7","doi-asserted-by":"publisher","unstructured":"Dechev, D., Pirkelbauer, P., Stroustrup, B.: Understanding and effectively preventing the ABA problem in descriptor-based lock-free designs. In: ISORC, pp. 185\u2013192 (2010). https:\/\/doi.org\/10.1109\/ISORC.2010.10","DOI":"10.1109\/ISORC.2010.10"},{"key":"17_CR8","unstructured":"Fraser, K.: Practical lock-freedom. University of Cambridge, Computer Laboratory, Tech. rep. (2004)"},{"key":"17_CR9","doi-asserted-by":"publisher","unstructured":"Gotsman, A., Rinetzky, N., Yang, H.: Verifying concurrent memory reclamation algorithms with grace. In: Felleisen, M., Gardner, P. (eds.) ESOP. LNCS, vol. 7792, pp. 249\u2013269. Springer (2013). https:\/\/doi.org\/10.1007\/978-3-642-37036-6_15","DOI":"10.1007\/978-3-642-37036-6_15"},{"issue":"12","key":"17_CR10","doi-asserted-by":"publisher","first-page":"1270","DOI":"10.1016\/j.jpdc.2007.04.010","volume":"67","author":"TE Hart","year":"2007","unstructured":"Hart, T.E., McKenney, P.E., Brown, A.D., Walpole, J.: Performance of memory reclamation for lockless synchronization. J. Parallel Distributed Comput. 67(12), 1270\u20131285 (2007). https:\/\/doi.org\/10.1016\/j.jpdc.2007.04.010","journal-title":"J. Parallel Distributed Comput."},{"issue":"2","key":"17_CR11","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1145\/1062247.1062249","volume":"23","author":"M Herlihy","year":"2005","unstructured":"Herlihy, M., Luchangco, V., Martin, P., Moir, M.: Nonblocking memory management support for dynamic-sized data structures. ACM Trans. Comput. Syst. 23(2), 146\u2013196 (2005). https:\/\/doi.org\/10.1145\/1062247.1062249","journal-title":"ACM Trans. Comput. Syst."},{"key":"17_CR12","unstructured":"Herlihy, M., Shavit, N., Luchangco, V., Spear, M.: The art of multiprocessor programming. Newnes (2020)"},{"key":"17_CR13","doi-asserted-by":"publisher","unstructured":"Kang, J., Hur, C., Lahav, O., Vafeiadis, V., Dreyer, D.: A promising semantics for relaxed-memory concurrency. In: Castagna, G., Gordon, A.D. (eds.) POPL, pp. 175\u2013189. ACM (2017). https:\/\/doi.org\/10.1145\/3009837.3009850","DOI":"10.1145\/3009837.3009850"},{"issue":"1","key":"17_CR14","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1145\/2914770.2837643","volume":"51","author":"O Lahav","year":"2016","unstructured":"Lahav, O., Giannarakis, N., Vafeiadis, V.: Taming release-acquire consistency. ACM SIGPLAN Notices 51(1), 649\u2013662 (2016)","journal-title":"ACM SIGPLAN Notices"},{"key":"17_CR15","doi-asserted-by":"publisher","unstructured":"Lahav, O., Vafeiadis, V., Kang, J., Hur, C., Dreyer, D.: Repairing sequential consistency in C\/C++11. In: Cohen, A., Vechev, M.T. (eds.) PLDI, pp. 618\u2013632. ACM (2017). https:\/\/doi.org\/10.1145\/3062341.3062352","DOI":"10.1145\/3062341.3062352"},{"key":"17_CR16","doi-asserted-by":"publisher","unstructured":"Lowe, G.: Analysing lock-free linearizable datatypes using CSP. In: Gibson-Robinson, T., Hopcroft, P.J., Lazic, R. (eds.) Concurrency, Security, and Puzzles - Essays Dedicated to Andrew William Roscoe on the Occasion of His 60th Birthday. LNCS, vol. 10160, pp. 162\u2013184. Springer (2017). https:\/\/doi.org\/10.1007\/978-3-319-51046-0_9","DOI":"10.1007\/978-3-319-51046-0_9"},{"key":"17_CR17","unstructured":"McKenney, P.E.: Exploiting deferred destruction: an analysis of read-copy-update techniques in operating system kernels. Oregon Health & Science University (2004)"},{"key":"17_CR18","doi-asserted-by":"publisher","unstructured":"Memarian, K., et al.: Exploring C semantics and pointer provenance. Proc. ACM Program. Lang. 3(POPL), 67:1\u201367:32 (2019). https:\/\/doi.org\/10.1145\/3290380","DOI":"10.1145\/3290380"},{"key":"17_CR19","doi-asserted-by":"publisher","unstructured":"Michael, M.M.: Safe memory reclamation for dynamic lock-free objects using atomic reads and writes. In: Ricciardi, A. (ed.) PODC, pp. 21\u201330. ACM (2002). https:\/\/doi.org\/10.1145\/571825.571829","DOI":"10.1145\/571825.571829"},{"key":"17_CR20","doi-asserted-by":"publisher","unstructured":"Michael, M.M., Scott, M.L.: Simple, fast, and practical non-blocking and blocking concurrent queue algorithms. In: Burns, J.E., Moses, Y. (eds.) Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, Philadelphia, Pennsylvania, USA, 23\u201326 May 1996, pp. 267\u2013275. ACM (1996). https:\/\/doi.org\/10.1145\/248052.248106, https:\/\/doi.org\/10.1145\/248052.248106","DOI":"10.1145\/248052.248106"},{"issue":"6","key":"17_CR21","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1109\/TPDS.2004.8","volume":"15","author":"M Michael","year":"2004","unstructured":"Michael, M.: Hazard pointers: safe memory reclamation for lock-free objects. IEEE Trans. Parallel Distrib. Syst. 15(6), 491\u2013504 (2004). https:\/\/doi.org\/10.1109\/TPDS.2004.8","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"17_CR22","doi-asserted-by":"publisher","unstructured":"Parkinson, M.J., Bornat, R., O\u2019Hearn, P.W.: Modular verification of a non-blocking stack. In: Hofmann, M., Felleisen, M. (eds.) POPL, pp. 297\u2013302. ACM (2007). https:\/\/doi.org\/10.1145\/1190216.1190261","DOI":"10.1145\/1190216.1190261"},{"key":"17_CR23","doi-asserted-by":"publisher","unstructured":"Paviotti, M., Cooksey, S., Paradis, A., Wright, D., Owens, S., Batty, M.: Modular relaxed dependencies in weak memory concurrency. In: M\u00fcller, P. (ed.) ESOP. LNCS, vol. 12075, pp. 599\u2013625. Springer (2020). https:\/\/doi.org\/10.1007\/978-3-030-44914-8_22","DOI":"10.1007\/978-3-030-44914-8_22"},{"key":"17_CR24","doi-asserted-by":"publisher","unstructured":"Semenyuk, M., Dongol, B.: Isabelle\/HOL files for Verifying Read-Copy Update under RC11 (2022). https:\/\/doi.org\/10.5281\/zenodo.8099415","DOI":"10.5281\/zenodo.8099415"},{"key":"17_CR25","doi-asserted-by":"crossref","unstructured":"Semenyuk, M., Dongol, B.: Ownership-based Owicki-Gries reasoning. In: Proceedings of the 38th ACM\/SIGAPP Symposium on Applied Computing, pp. 1685\u20131694 (2023)","DOI":"10.1145\/3555776.3577636"},{"key":"17_CR26","doi-asserted-by":"publisher","unstructured":"Svendsen, K., Pichon-Pharabod, J., Doko, M., Lahav, O., Vafeiadis, V.: A separation logic for a promising semantics. In: Ahmed, A. (ed.) ESOP. LNCS, vol. 10801, pp. 357\u2013384. Springer (2018). https:\/\/doi.org\/10.1007\/978-3-319-89884-1_13","DOI":"10.1007\/978-3-319-89884-1_13"},{"key":"17_CR27","doi-asserted-by":"publisher","unstructured":"Tassarotti, J., Dreyer, D., Vafeiadis, V.: Verifying read-copy-update in a logic for weak memory. SIGPLAN Not. 50(6), 110\u2013120 (2015). https:\/\/doi.org\/10.1145\/2813885.2737992","DOI":"10.1145\/2813885.2737992"},{"key":"17_CR28","doi-asserted-by":"publisher","unstructured":"Tofan, B., Schellhorn, G., Reif, W.: Formal verification of a lock-free stack with hazard pointers. In: Cerone, A., Pihlajasaari, P. (eds.) ICTAC. LNCS, vol. 6916, pp. 239\u2013255. Springer (2011). https:\/\/doi.org\/10.1007\/978-3-642-23283-1_16","DOI":"10.1007\/978-3-642-23283-1_16"},{"key":"17_CR29","unstructured":"Treiber, R.K.: Systems programming: Coping with parallelism. Thomas J. Watson Research, International Business Machines Incorporated (1986)"},{"key":"17_CR30","doi-asserted-by":"publisher","unstructured":"Turon, A., Vafeiadis, V., Dreyer, D.: GPS: navigating weak memory with ghosts, protocols, and separation. In: Black, A.P., Millstein, T.D. (eds.) OOPSLA, pp. 691\u2013707. ACM (2014). https:\/\/doi.org\/10.1145\/2660193.2660243","DOI":"10.1145\/2660193.2660243"},{"key":"17_CR31","doi-asserted-by":"publisher","unstructured":"Wright, D., Batty, M., Dongol, B.: Owicki-Gries reasoning for C11 programs with relaxed dependencies. In: Huisman, M., Pasareanu, C.S., Zhan, N. (eds.) FM. LNCS, vol. 13047, pp. 237\u2013254. Springer (2021). https:\/\/doi.org\/10.1007\/978-3-030-90870-6_13","DOI":"10.1007\/978-3-030-90870-6_13"},{"key":"17_CR32","doi-asserted-by":"publisher","unstructured":"Wright, D., Dalvandi, S., Batty, M., Dongol, B.: Mechanised operational reasoning for C11 programs with relaxed dependencies. Formal Aspects Comput. 35(2), 10:1\u201310:27 (2023). https:\/\/doi.org\/10.1145\/3580285","DOI":"10.1145\/3580285"},{"key":"17_CR33","doi-asserted-by":"publisher","unstructured":"Wright, D., Dalvandi, S., Batty, M., Dongol, B.: Mechanised operational reasoning for C11 programs with relaxed dependencies. Form. Asp. Comput. (2023). https:\/\/doi.org\/10.1145\/3580285, just Accepted","DOI":"10.1145\/3580285"}],"container-title":["Lecture Notes in Computer Science","Software Engineering and Formal Methods"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-47115-5_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,4]],"date-time":"2023-11-04T00:03:49Z","timestamp":1699056229000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-47115-5_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031471148","9783031471155"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-47115-5_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"31 October 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SEFM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Software Engineering and Formal Methods","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Eindhoven","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","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":"6 November 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 November 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sefm2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sefm-conference.github.io\/2023\/","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":"41","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":"19","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":"46% - 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":"4,5","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)"}}]}}