{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T08:17:18Z","timestamp":1769069838805,"version":"3.49.0"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031477041","type":"print"},{"value":"9783031477058","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,11,6]],"date-time":"2023-11-06T00:00:00Z","timestamp":1699228800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,11,6]],"date-time":"2023-11-06T00:00:00Z","timestamp":1699228800000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-47705-8_10","type":"book-chapter","created":{"date-parts":[[2023,11,10]],"date-time":"2023-11-10T09:02:24Z","timestamp":1699606944000},"page":"175-192","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Lifting the\u00a0Reasoning Level in\u00a0Generic Weak Memory Verification"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-8778-9098","authenticated-orcid":false,"given":"Lara","family":"Bargmann","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2385-7512","authenticated-orcid":false,"given":"Heike","family":"Wehrheim","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,11,6]]},"reference":[{"issue":"12","key":"10_CR1","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1109\/2.546611","volume":"29","author":"SV Adve","year":"1996","unstructured":"Adve, S.V., Gharachorloo, K.: Shared memory consistency models: a tutorial. Computer 29(12), 66\u201376 (1996). https:\/\/doi.org\/10.1109\/2.546611","journal-title":"Computer"},{"key":"10_CR2","doi-asserted-by":"publisher","unstructured":"Alglave, J., Cousot, P.: Ogre and pythia: an invariance proof method for weak consistency models. In: Castagna, G., Gordon, A.D. (eds.) POPL, pp. 3\u201318. ACM (2017). https:\/\/doi.org\/10.1145\/3009837.3009883","DOI":"10.1145\/3009837.3009883"},{"key":"10_CR3","doi-asserted-by":"publisher","unstructured":"Bargmann, L., Wehrheim, H.: Lifting the reasoning level in generic weak memory verification (Extended Version). CoRR abs\/2309.01433 (2023). https:\/\/doi.org\/10.48550\/arXiv.2309.01433","DOI":"10.48550\/arXiv.2309.01433"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Bargmann, L., Wehrheim, H.: View-based axiomatic reasoning for PSO. In: TASE (2023). to appear","DOI":"10.1007\/978-3-031-35257-7_17"},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/978-3-030-99336-8_9","volume-title":"Programming Languages and Systems","author":"EV Bila","year":"2022","unstructured":"Bila, E.V., Dongol, B., Lahav, O., Raad, A., Wickerson, J.: View-based Owicki\u2013Gries reasoning for persistent x86-TSO. In: ESOP 2022. LNCS, vol. 13240, pp. 234\u2013261. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-99336-8_9"},{"key":"10_CR6","doi-asserted-by":"publisher","unstructured":"Boehm, H., Adve, S.V.: Foundations of the C++ concurrency memory model. In: Gupta, R., Amarasinghe, S.P. (eds.) PLDI, pp. 68\u201378. ACM (2008). https:\/\/doi.org\/10.1145\/1375581.1375591","DOI":"10.1145\/1375581.1375591"},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/978-3-030-92124-8_12","volume-title":"Software Engineering and Formal Methods","author":"RJ Colvin","year":"2021","unstructured":"Colvin, R.J.: Parallelized sequential composition and\u00a0hardware weak memory models. In: Calinescu, R., P\u0103s\u0103reanu, C.S. (eds.) SEFM 2021. LNCS, vol. 13085, pp. 201\u2013221. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92124-8_12"},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/978-3-030-90870-6_16","volume-title":"Formal Methods","author":"N Coughlin","year":"2021","unstructured":"Coughlin, N., Winter, K., Smith, G.: Rely\/guarantee reasoning for multicopy atomic weak memory models. In: Huisman, M., P\u0103s\u0103reanu, C., Zhan, N. (eds.) FM 2021. LNCS, vol. 13047, pp. 292\u2013310. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90870-6_16"},{"key":"10_CR9","doi-asserted-by":"publisher","unstructured":"Coughlin, N., Winter, K., Smith, G.: Compositional reasoning for non-multicopy atomic architectures. Form. Asp. Comput. (2022). https:\/\/doi.org\/10.1145\/3574137. just Accepted","DOI":"10.1145\/3574137"},{"key":"10_CR10","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, pp. 11:1\u201311:26. LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020). https:\/\/doi.org\/10.4230\/LIPIcs.ECOOP.2020.11","DOI":"10.4230\/LIPIcs.ECOOP.2020.11"},{"issue":"1","key":"10_CR11","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s10817-021-09610-2","volume":"66","author":"S Dalvandi","year":"2022","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","journal-title":"J. Autom. Reason."},{"key":"10_CR12","unstructured":"Dijkstra, E.W.: A Discipline of Programming. Prentice-Hall, Upper Saddle river (1976). https:\/\/www.worldcat.org\/oclc\/01958445"},{"key":"10_CR13","doi-asserted-by":"publisher","unstructured":"Doherty, S., Dalvandi, S., Dongol, B., Wehrheim, H.: Unifying operational weak memory verification: an axiomatic approach. ACM Trans. Comput. Log. 23(4), 27:1\u201327:39 (2022). https:\/\/doi.org\/10.1145\/3545117","DOI":"10.1145\/3545117"},{"key":"10_CR14","doi-asserted-by":"publisher","unstructured":"Doherty, S., Dongol, B., Wehrheim, H., Derrick, J.: Verifying C11 programs operationally. In: PPoPP, pp. 355\u2013365 (2019). https:\/\/doi.org\/10.1145\/3293883.3295702","DOI":"10.1145\/3293883.3295702"},{"key":"10_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/978-3-030-25540-4_19","volume-title":"Computer Aided Verification","author":"N Gavrilenko","year":"2019","unstructured":"Gavrilenko, N., Ponce-de-Le\u00f3n, H., Furbach, F., Heljanko, K., Meyer, R.: BMC for weak memory models: relation analysis for compact SMT encodings. In: Dillig, I., Tasiran, S. (eds.) CAV 2019. LNCS, vol. 11561, pp. 355\u2013365. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-25540-4_19"},{"issue":"10","key":"10_CR16","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1145\/363235.363259","volume":"12","author":"CAR Hoare","year":"1969","unstructured":"Hoare, C.A.R.: An axiomatic basis for computer programming. Commun. ACM 12(10), 576\u2013580 (1969). https:\/\/doi.org\/10.1145\/363235.363259","journal-title":"Commun. ACM"},{"key":"10_CR17","doi-asserted-by":"publisher","unstructured":"Kokologiannakis, M., Raad, A., Vafeiadis, V.: Model checking for weakly consistent libraries. In: McKinley, K.S., Fisher, K. (eds.) PLDI, pp. 96\u2013110. ACM (2019). https:\/\/doi.org\/10.1145\/3314221.3314609","DOI":"10.1145\/3314221.3314609"},{"key":"10_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), 8:1\u20138:55 (2022). https:\/\/doi.org\/10.1145\/3505273","DOI":"10.1145\/3505273"},{"key":"10_CR19","doi-asserted-by":"crossref","unstructured":"Lahav, O., Dongol, B., Wehrheim, H.: Rely-guarantee reasoning for causally consistent shared memory. In: CAV (2023). to appear","DOI":"10.1007\/978-3-031-37706-8_11"},{"key":"10_CR20","doi-asserted-by":"publisher","unstructured":"Lahav, O., Giannarakis, N., Vafeiadis, V.: Taming release-acquire consistency. In: Bod\u00edk, R., Majumdar, R. (eds.) POPL, pp. 649\u2013662. ACM (2016). https:\/\/doi.org\/10.1145\/2837614.2837643","DOI":"10.1145\/2837614.2837643"},{"key":"10_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-662-47666-6_25","volume-title":"Automata, Languages, and Programming","author":"O Lahav","year":"2015","unstructured":"Lahav, O., Vafeiadis, V.: Owicki-Gries reasoning for weak memory models. In: Halld\u00f3rsson, M.M., Iwama, K., Kobayashi, N., Speckmann, B. (eds.) ICALP 2015. LNCS, vol. 9135, pp. 311\u2013323. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-47666-6_25"},{"issue":"9","key":"10_CR22","doi-asserted-by":"publisher","first-page":"690","DOI":"10.1109\/TC.1979.1675439","volume":"28","author":"L Lamport","year":"1979","unstructured":"Lamport, L.: How to make a multiprocessor computer that correctly executes multiprocess programs. IEEE Trans. Comput. 28(9), 690\u2013691 (1979). https:\/\/doi.org\/10.1109\/TC.1979.1675439","journal-title":"IEEE Trans. Comput."},{"key":"10_CR23","doi-asserted-by":"publisher","unstructured":"de Le\u00f3n, H.P., Furbach, F., Heljanko, K., Meyer, R.: BMC with memory models as modules. In: Bj\u00f8rner, N.S., Gurfinkel, A. (eds.) FMCAD. pp. 1\u20139. IEEE (2018). https:\/\/doi.org\/10.23919\/FMCAD.2018.8603021","DOI":"10.23919\/FMCAD.2018.8603021"},{"key":"10_CR24","unstructured":"Maranget, L., Sarkar, S., Sewell, P.: A Tutorial Introduction to the ARM and POWER Relaxed Memory Models (2012). https:\/\/www.cl.cam.ac.uk\/pes20\/ppc-supplemental\/test7.pdf. Accessed May 2022"},{"key":"10_CR25","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/BF00268134","volume":"6","author":"SS Owicki","year":"1976","unstructured":"Owicki, S.S., Gries, D.: An axiomatic proof technique for parallel programs I. Acta Inf. 6, 319\u2013340 (1976). https:\/\/doi.org\/10.1007\/BF00268134","journal-title":"Acta Inf."},{"key":"10_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-642-15057-9_4","volume-title":"Verified Software: Theories, Tools, Experiments","author":"T Ridge","year":"2010","unstructured":"Ridge, T.: A rely-guarantee proof system for x86-TSO. In: Leavens, G.T., O\u2019Hearn, P., Rajamani, S.K. (eds.) VSTTE 2010. LNCS, vol. 6217, pp. 55\u201370. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15057-9_4"},{"key":"10_CR27","doi-asserted-by":"publisher","unstructured":"Sarkar, S., et al.: The semantics of x86-CC multiprocessor machine code. In: Shao, Z., Pierce, B.C. (eds.) POPL, pp. 379\u2013391. ACM (2009). https:\/\/doi.org\/10.1145\/1480881.1480929","DOI":"10.1145\/1480881.1480929"},{"key":"10_CR28","doi-asserted-by":"publisher","unstructured":"Wehrheim, H., Bargmann, L., Dongol, B.: Reasoning about promises in weak memory models with event structures. In: Chechik, M., Katoen, J., Leucker, M. (eds.) FM, Lecture Notes in Computer Science, vol. 14000, pp. 282\u2013300. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-27481-7_17","DOI":"10.1007\/978-3-031-27481-7_17"},{"issue":"2","key":"10_CR29","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/BF01211617","volume":"9","author":"Q Xu","year":"1997","unstructured":"Xu, Q., de Roever, W.P., He, J.: The rely-guarantee method for verifying shared variable concurrent programs. Formal Aspects Comput. 9(2), 149\u2013174 (1997). https:\/\/doi.org\/10.1007\/BF01211617","journal-title":"Formal Aspects Comput."}],"container-title":["Lecture Notes in Computer Science","Integrated Formal Methods"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-47705-8_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,18]],"date-time":"2024-04-18T14:50:12Z","timestamp":1713451812000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-47705-8_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,6]]},"ISBN":["9783031477041","9783031477058"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-47705-8_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,11,6]]},"assertion":[{"value":"6 November 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"iFM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integrated Formal Methods","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Leiden","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":"13 November 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 November 2023","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":"ifm2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/liacs.leidenuniv.nl\/~bonsanguemm\/ifm23\/index.html","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":"51","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":"16","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":"2","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":"31% - 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":"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)"}}]}}