{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T07:01:12Z","timestamp":1779087672505,"version":"3.51.4"},"publisher-location":"Cham","reference-count":40,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031711619","type":"print"},{"value":"9783031711626","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T00:00:00Z","timestamp":1726012800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T00:00:00Z","timestamp":1726012800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Concurrency verification for weak memory models\u00a0is inherently complex. Several deductive techniques based on\u00a0proof calculi have recently been developed, but these are typically tailored towards a single memory model through specialised assertions and associated proof rules. In this paper, we propose\u00a0an extension to the logic <jats:inline-formula><jats:alternatives><jats:tex-math>$${\\textsf{Piccolo}}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mi>Piccolo<\/mml:mi>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> to generalise reasoning across different memory models. <jats:inline-formula><jats:alternatives><jats:tex-math>$${\\textsf{Piccolo}}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mi>Piccolo<\/mml:mi>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> is interpreted on the semantic domain of thread <jats:italic>potentials<\/jats:italic>. By deriving potentials from weak memory\u00a0model states, we can define the validity of <jats:inline-formula><jats:alternatives><jats:tex-math>$${\\textsf{Piccolo}}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mi>Piccolo<\/mml:mi>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> formulae for multiple memory models. We moreover propose unified proof rules\u00a0for verification on top of <jats:inline-formula><jats:alternatives><jats:tex-math>$${\\textsf{Piccolo}}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mi>Piccolo<\/mml:mi>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>. Once (a set of) such rules has\u00a0been shown to be sound with respect to a memory model <jats:inline-formula><jats:alternatives><jats:tex-math>$${\\textsf{MM}} $$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mi>MM<\/mml:mi>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, all correctness proofs employing this rule set are valid for <jats:inline-formula><jats:alternatives><jats:tex-math>$${\\textsf{MM}}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mi>MM<\/mml:mi>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>. We exemplify\u00a0our approach on the memory models <jats:inline-formula><jats:alternatives><jats:tex-math>$${\\textsf{SC}}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mi>SC<\/mml:mi>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, <jats:inline-formula><jats:alternatives><jats:tex-math>$${\\textsf{TSO}}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mi>TSO<\/mml:mi>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> and <jats:inline-formula><jats:alternatives><jats:tex-math>$${\\textsf{SRA}}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mi>SRA<\/mml:mi>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> using\u00a0the standard litmus tests Message-Passing and IRIW.<\/jats:p>","DOI":"10.1007\/978-3-031-71162-6_27","type":"book-chapter","created":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T02:02:27Z","timestamp":1725933747000},"page":"519-537","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Unifying Weak Memory Verification Using Potentials"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-8778-9098","authenticated-orcid":false,"given":"Lara","family":"Bargmann","sequence":"first","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"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2385-7512","authenticated-orcid":false,"given":"Heike","family":"Wehrheim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,9,11]]},"reference":[{"key":"27_CR1","doi-asserted-by":"publisher","unstructured":"dve, S.V., Boehm, H.J.: Memory Models. In: Padua, D. (eds.) Encyclopedia of Parallel Computing, pp. 1107\u20131110. Springer (2011). https:\/\/doi.org\/10.1007\/978-0-387-09766-4_419","DOI":"10.1007\/978-0-387-09766-4_419"},{"issue":"12","key":"27_CR2","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":"27_CR3","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":"27_CR4","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-7:74 (2014). https:\/\/doi.org\/10.1145\/2627752","DOI":"10.1145\/2627752"},{"key":"27_CR5","doi-asserted-by":"crossref","unstructured":"Apt, K.R., de\u00a0Boer, F.S., Olderog, E.-R.: Verification of Sequential and Concurrent Programs. Texts in Computer Science. Springer (2009)","DOI":"10.1007\/978-1-84882-745-5"},{"key":"27_CR6","doi-asserted-by":"publisher","unstructured":"Bargmann, L., Wehrheim, H.: Lifting the reasoning level in generic weak memory verification. In: Herber, P., Wijs, A. (eds.) Integrated Formal Methods. iFM 2023. Lecture Notes in Computer Science, vol 14300. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-47705-8_10","DOI":"10.1007\/978-3-031-47705-8_10"},{"key":"27_CR7","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"},{"issue":"5","key":"27_CR8","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/0020-0190(91)90122-X","volume":"40","author":"Z Chaochen","year":"1991","unstructured":"Chaochen, Z., Hoare, C.A.R., Ravn, A.P.: A calculus of durations. Inf. Process. Lett. 40(5), 269\u2013276 (1991). https:\/\/doi.org\/10.1016\/0020-0190(91)90122-X","journal-title":"Inf. Process. Lett."},{"key":"27_CR9","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":"27_CR10","doi-asserted-by":"publisher","unstructured":"Coughlin, N., Winter, K., Smith, G.: Compositional reasoning for non-multicopy atomic architectures. Formal Aspects Comput. 35(2), 8:1-8:0 (2023). https:\/\/doi.org\/10.1145\/3574137","DOI":"10.1145\/3574137"},{"key":"27_CR11","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, pp. 11:1\u201311:26. 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":"27_CR12","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":"27_CR13","doi-asserted-by":"publisher","unstructured":"Dang, H.-H., Jourdan, J.-H., Kaiser, J.-O., Dreyer, D.: Rustbelt meets relaxed memory. Proc. ACM Program. Lang. 4(POPL), 34:1\u201334:29 (2020). https:\/\/doi.org\/10.1145\/3371102","DOI":"10.1145\/3371102"},{"key":"27_CR14","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":"27_CR15","doi-asserted-by":"publisher","unstructured":"Flur, S., et al.: Modelling the ARMv8 architecture, operationally: Concurrency and ISA. In: Bod\u00edk, R., Majumdar, R. (eds.) POPL, pp. 608\u2013621. ACM (2016). https:\/\/doi.org\/10.1145\/2837614.2837615","DOI":"10.1145\/2837614.2837615"},{"key":"27_CR16","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":"27_CR17","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"},{"issue":"4","key":"27_CR18","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1145\/69575.69577","volume":"5","author":"CB Jones","year":"1983","unstructured":"Jones, C.B.: Tentative steps toward a development method for interfering programs. ACM Trans. Program. Lang. Syst. 5(4), 596\u2013619 (1983). https:\/\/doi.org\/10.1145\/69575.69577","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"27_CR19","doi-asserted-by":"publisher","unstructured":"Kaiser, J.-O., Dang, H.-H., Dreyer, D., Lahav, O., Vafeiadis, V.: Strong Logic for Weak Memory: Reasoning About Release-Acquire Consistency in Iris. In: M\u00fcller, P. (eds.) ECOOP, vol. 74. LIPIcs, pp. 17:1\u201317:29. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2017). https:\/\/doi.org\/10.4230\/LIPICS.ECOOP.2017.17","DOI":"10.4230\/LIPICS.ECOOP.2017.17"},{"key":"27_CR20","doi-asserted-by":"publisher","unstructured":"Kang, J., Hur, C.-K., 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"},{"key":"27_CR21","doi-asserted-by":"publisher","unstructured":"Kokologiannakis, M., Lahav, O., Vafeiadis, V.: Kater: Automating weak memory model metatheory and consistency checking. Proc. ACM Program. Lang. 7(POPL), 544\u2013572 (2023). https:\/\/doi.org\/10.1145\/3571212","DOI":"10.1145\/3571212"},{"key":"27_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/978-3-030-81685-8_20","volume-title":"Computer Aided Verification","author":"M Kokologiannakis","year":"2021","unstructured":"Kokologiannakis, M., Vafeiadis, V.: GenMC: a model checker for weak memory models. In: Silva, A., Leino, K.R.M. (eds.) CAV 2021. LNCS, vol. 12759, pp. 427\u2013440. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-81685-8_20"},{"key":"27_CR23","doi-asserted-by":"publisher","unstructured":"Lahav, O., Boker, U.: Decidable verification under a causally consistent shared memory. In: Donaldson, A.F., Torlak, E. (eds.) PLDI, pp. 211\u2013226. ACM (2020). https:\/\/doi.org\/10.1145\/3385412.3385966","DOI":"10.1145\/3385412.3385966"},{"key":"27_CR24","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":"27_CR25","doi-asserted-by":"publisher","unstructured":"Lahav, O., Dongol, B., Wehrheim, H.: Rely-guarantee reasoning for causally consistent shared memory. In: Enea, C., Lal, A. (eds.) CAV, vol. 13964. LNCS, pp. 206\u2013229. Springer (2023). https:\/\/doi.org\/10.1007\/978-3-031-37706-8_11","DOI":"10.1007\/978-3-031-37706-8_11"},{"key":"27_CR26","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":"27_CR27","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":"27_CR28","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. Computers 28(9), 690\u2013691 (1979). https:\/\/doi.org\/10.1109\/TC.1979.1675439","journal-title":"IEEE Trans. Computers"},{"key":"27_CR29","doi-asserted-by":"publisher","unstructured":"Moszkowski, B.C.: A complete axiom system for propositional interval temporal logic with infinite time. Log. Methods Comput. Sci. 8(3) (2012). https:\/\/doi.org\/10.2168\/LMCS-8(3:10)2012","DOI":"10.2168\/LMCS-8(3:10)2012"},{"key":"27_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/978-3-540-49020-3_13","volume-title":"Fundamental Approaches to Software Engineering","author":"T Nipkow","year":"1999","unstructured":"Nipkow, T., Nieto, L.P.: Owicki\/Gries in Isabelle\/HOL. In: Finance, J.-P. (ed.) FASE 1999. LNCS, vol. 1577, pp. 188\u2013203. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/978-3-540-49020-3_13"},{"key":"27_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/978-3-642-03359-9_27","volume-title":"Theorem Proving in Higher Order Logics","author":"S Owens","year":"2009","unstructured":"Owens, S., Sarkar, S., Sewell, P.: A better x86 memory model: x86-TSO. In: Berghofer, S., Nipkow, T., Urban, C., Wenzel, M. (eds.) TPHOLs 2009. LNCS, vol. 5674, pp. 391\u2013407. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03359-9_27"},{"key":"27_CR32","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":"27_CR33","doi-asserted-by":"publisher","unstructured":"Raad, A., Lahav, O., Wickerson, J., Balcer, P., Dongol, B.: Intel PMDK transactions: specification, validation and concurrency. In: Weirich, S. (eds.) ESOP, vol. 14577 LNCS, pp.150\u2013179. Springer (2024). https:\/\/doi.org\/10.1007\/978-3-031-57267-8_6","DOI":"10.1007\/978-3-031-57267-8_6"},{"key":"27_CR34","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"},{"issue":"7","key":"27_CR35","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1145\/1785414.1785443","volume":"53","author":"P Sewell","year":"2010","unstructured":"Sewell, P., Sarkar, S., Owens, S., Nardelli, F.Z., Myreen, M.O.: x86-TSO: a rigorous and usable programmer\u2019s model for x86 multiprocessors. Commun. ACM 53(7), 89\u201397 (2010). https:\/\/doi.org\/10.1145\/1785414.1785443","journal-title":"Commun. ACM"},{"key":"27_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/978-3-319-89884-1_13","volume-title":"Programming Languages and Systems","author":"K Svendsen","year":"2018","unstructured":"Svendsen, K., Pichon-Pharabod, J., Doko, M., Lahav, O., Vafeiadis, V.: A separation logic for a promising semantics. In: Ahmed, A. (ed.) ESOP 2018. LNCS, vol. 10801, pp. 357\u2013384. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-89884-1_13"},{"issue":"OOPSLA2","key":"27_CR37","doi-asserted-by":"publisher","first-page":"632","DOI":"10.1145\/3622820","volume":"7","author":"Simon Friis Vindum and Lars Birkedal","year":"2023","unstructured":"Simon Friis Vindum and Lars Birkedal: Spirea: a mechanized concurrent separation logic for weak persistent memory. Proc. ACM Program. Lang. 7(OOPSLA2), 632\u2013657 (2023). https:\/\/doi.org\/10.1145\/3622820","journal-title":"Proc. ACM Program. Lang."},{"key":"27_CR38","doi-asserted-by":"publisher","unstructured":"Wickerson, J., Batty, M., Sorensen, T., Constantinides, G.A.: Automatically comparing memory consistency models. In: Castagna, G., Gordon, A.D (eds.) POPL, pp. 190\u2013204. ACM (2017). https:\/\/doi.org\/10.1145\/3009837.3009838","DOI":"10.1145\/3009837.3009838"},{"key":"27_CR39","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":"27_CR40","doi-asserted-by":"crossref","unstructured":"Xu, Q., de\u00a0Roever, 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","DOI":"10.1007\/BF01211617"}],"container-title":["Lecture Notes in Computer Science","Formal Methods"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-71162-6_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T02:07:46Z","timestamp":1725934066000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-71162-6_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9,11]]},"ISBN":["9783031711619","9783031711626"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-71162-6_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,9,11]]},"assertion":[{"value":"11 September 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Formal Methods","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Milan","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":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fm2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.fm24.polimi.it\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}