{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T00:57:52Z","timestamp":1768006672863,"version":"3.49.0"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032107930","type":"print"},{"value":"9783032107947","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,11,16]],"date-time":"2025-11-16T00:00:00Z","timestamp":1763251200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,16]],"date-time":"2025-11-16T00:00:00Z","timestamp":1763251200000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-10794-7_7","type":"book-chapter","created":{"date-parts":[[2025,11,15]],"date-time":"2025-11-15T06:43:06Z","timestamp":1763188986000},"page":"120-139","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Model Checking Buffered Durable Linearizability in\u00a0CSP"],"prefix":"10.1007","author":[{"given":"Chelsea","family":"Edmonds","sequence":"first","affiliation":[]},{"given":"John","family":"Derrick","sequence":"additional","affiliation":[]},{"given":"Brijesh","family":"Dongol","sequence":"additional","affiliation":[]},{"given":"Gerhard","family":"Schellhorn","sequence":"additional","affiliation":[]},{"given":"Heike","family":"Wehrheim","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,11,16]]},"reference":[{"key":"7_CR1","unstructured":"Ballenghien, B., Taha, S., Wolff, B., Ye, L.: Hol-csp version 2.0. Archive of Formal Proofs (2019). https:\/\/isa-afp.org\/entries\/HOL-CSP.html, Formal proof development"},{"key":"7_CR2","unstructured":"Ben-David, N., Friedman, M., Wei, Y.: Brief announcement: Survey of persistent memory correctness conditions. In: DISC. LIPIcs, vol.\u00a0246, pp. 41:1\u201341:4. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2022)"},{"key":"7_CR3","doi-asserted-by":"publisher","unstructured":"Bila, E., Doherty, S., Dongol, B., Derrick, J., Schellhorn, G., Wehrheim, H.: Defining and verifying durable opacity: correctness for persistent software transactional memory. In: Gotsman, A., Sokolova, A. (eds.) FORTE 2020. LNCS, vol. 12136, pp. 39\u201358. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-50086-3_3","DOI":"10.1007\/978-3-030-50086-3_3"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Bila, E., Derrick, J., Doherty, S., Dongol, B., Schellhorn, G., Wehrheim, H.: Modularising verification of durable opacity. Log. Methods Comput. Sci. 18(3) (2022)","DOI":"10.46298\/lmcs-18(3:7)2022"},{"key":"7_CR5","unstructured":"Bila, E.V.: Specifying and verifying persistent transactional memory. Ph.D. thesis, University of Surrey (2023)"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Bodenm\u00fcller, S., Derrick, J., Dongol, B., Schellhorn, G., Wehrheim, H.: A fully verified persistency library. In: Dimitrova, R., Lahav, O., Wolff, S. (eds.) VMCAI. LNCS, vol. 14500, pp. 26\u201347. Springer (2024). https:\/\/doi.org\/10.1007\/978-3-031-50521-8_2","DOI":"10.1007\/978-3-031-50521-8_2"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Brookes, S.D., Hoare, C.A.R., Roscoe, A.W.: A theory of communicating sequential processes. J. ACM 31(3), 560\u2013599 (1984). https:\/\/doi.org\/10.1145\/828.833","DOI":"10.1145\/828.833"},{"key":"7_CR8","unstructured":"Cai, W., Wen, H., Maksimovski, V., Du, M., Sanna, R., Abdallah, S., Scott, M.L.: Fast nonblocking persistence for concurrent data structures. In: Gilbert, S. (ed.) DISC. LIPIcs, vol.\u00a0209, pp. 14:1\u201314:20. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021). https:\/\/doi.org\/10.4230\/LIPIcs.DISC.2021.14"},{"key":"7_CR9","unstructured":"Choe, J.: Review and things to know: flash memory summit 2022. TechInsights (2022). https:\/\/www.techinsights.com\/blog\/review-and-things-know-flash-memory-summit-2022"},{"key":"7_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/978-3-030-30942-8_12","volume-title":"Formal Methods \u2013 The Next 30 Years","author":"J Derrick","year":"2019","unstructured":"Derrick, J., Doherty, S., Dongol, B., Schellhorn, G., Wehrheim, H.: Verifying correctness of persistent concurrent data structures. In: ter Beek, M.H., McIver, A., Oliveira, J.N. (eds.) FM 2019. LNCS, vol. 11800, pp. 179\u2013195. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-30942-8_12"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Dongol, B., Derrick, J.: Verifying linearisability: a comparative survey. ACM Comput. Surv. 48(2), 19:1\u201319:43 (2015). https:\/\/doi.org\/10.1145\/2796550","DOI":"10.1145\/2796550"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Dongol, B., Le-Papin, J.: Checking opacity and durable opacity with FDR. In: Calinescu, R., Pasareanu, C.S. (eds.) SEFM. LNCS, vol. 13085, pp. 222\u2013242. Springer (2021). https:\/\/doi.org\/10.1007\/978-3-030-92124-8_13","DOI":"10.1007\/978-3-030-92124-8_13"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"D\u2019Osualdo, E., Raad, A., Vafeiadis, V.: The path to durable linearizability. Proc. ACM Program. Lang. 7(POPL), 748\u2013774 (2023)","DOI":"10.1145\/3571219"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Edmonds, C., Dongol, B., Derrick, J., Wehrheim, H., Schellhorn, G.: CSP artifact for model checking buffered durable linearizability (2025). https:\/\/doi.org\/10.5281\/zenodo.14902055","DOI":"10.1007\/978-3-032-10794-7_7"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Friedman, M., Herlihy, M., Marathe, V.J., Petrank, E.: A persistent lock-free queue for non-volatile memory. In: Krall, A., Gross, T.R. (eds.) PPoPP, pp. 28\u201340. ACM (2018). http:\/\/doi.acm.org\/10.1145\/3178487.3178490","DOI":"10.1145\/3178487.3178490"},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"Friedman, M., Petrank, E., Ramalhete, P.: Mirror: making lock-free data structures persistent. In: PLDI, pp. 1218\u20131232. ACM (2021)","DOI":"10.1145\/3453483.3454105"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"Gibson-Robinson, T., Armstrong, P., Boulgakov, A., Roscoe, A.W.: FDR3 \u2013 A Modern Refinement Checker for CSP. In: \u00c1brah\u00e1m, E., Havelund, K. (eds.) Tools and Algorithms for the Construction and Analysis of Systems, pp. 187\u2013201. Springer, Berlin (2014)","DOI":"10.1007\/978-3-642-54862-8_13"},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"Herlihy, M., Wing, J.M.: Linearizability: a correctness condition for concurrent objects. ACM Trans. Program. Lang. Syst. 12(3), 463\u2013492 (1990)","DOI":"10.1145\/78969.78972"},{"key":"7_CR19","doi-asserted-by":"publisher","unstructured":"Izraelevitz, J., Mendes, H., Scott, M.L.: Linearizability of Persistent Memory Objects Under a Full-System-Crash Failure Model. In: Gavoille, C., Ilcinkas, D. (eds.) DISC 2016. LNCS, vol. 9888, pp. 313\u2013327. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53426-7_23","DOI":"10.1007\/978-3-662-53426-7_23"},{"key":"7_CR20","doi-asserted-by":"publisher","unstructured":"Khyzha, A., Lahav, O.: Abstraction for crash-resilient objects. In: DISC 2016. LNCS, vol. 9888, pp. 262\u2013289. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-99336-8_10","DOI":"10.1007\/978-3-030-99336-8_10"},{"key":"7_CR21","doi-asserted-by":"publisher","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","DOI":"10.1007\/978-3-642-05089-3_21"},{"key":"7_CR22","doi-asserted-by":"publisher","unstructured":"Lowe, G.: Analysing lock-free linearizable datatypes using CSP. In: Gibson-Robinson, T., Hopcroft, P., Lazi\u0107, R. (eds.) Concurrency, Security, and Puzzles. LNCS, vol. 10160, pp. 162\u2013184. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-51046-0_9","DOI":"10.1007\/978-3-319-51046-0_9"},{"key":"7_CR23","doi-asserted-by":"publisher","unstructured":"WDAG 1996. LNCS, vol. 1151. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-61769-8_9","DOI":"10.1007\/3-540-61769-8_9"},{"key":"7_CR24","doi-asserted-by":"crossref","unstructured":"Nawab, F., Izraelevitz, J., Kelly, T., III, C.B.M., Chakrabarti, D.R., Scott, M.L.: Dal\u00ed: A periodically persistent hash map. In: Richa, A.W. (ed.) DISC. LIPIcs, vol.\u00a091, pp. 37:1\u201337:16. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2017). https:\/\/doi.org\/10.4230\/LIPIcs.DISC.2017.37","DOI":"10.1145\/3040220"},{"key":"7_CR25","doi-asserted-by":"crossref","unstructured":"Raad, A., Lahav, O., Wickerson, J., Balcer, P., Dongol, B.: Artifact report: intel PMDK transactions: specification, validation and concurrency. In: Weirich, S. (ed.) ESOP. LNCS, vol. 14577, pp. 180\u2013184. Springer (2024). https:\/\/doi.org\/10.1007\/978-3-031-57267-8_7","DOI":"10.1007\/978-3-031-57267-8_7"},{"key":"7_CR26","doi-asserted-by":"crossref","unstructured":"Raad, A., Lahav, O., Wickerson, J., Balcer, P., Dongol, B.: Intel PMDK transactions: specification, validation and concurrency. In: Weirich, S. (ed.) ESOP. LNCS, vol. 14577, 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":"7_CR27","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84882-258-0","volume-title":"Understanding Concurrent Systems","author":"A Roscoe","year":"2010","unstructured":"Roscoe, A.: Understanding Concurrent Systems, 1st edn. Springer-Verlag, Berlin, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-1-84882-258-0","edition":"1"},{"key":"7_CR28","unstructured":"Samsung Electronics: Samsung electronics unveils far-reaching, next-generation memory solutions at flash memory summit 2022 (2022)"},{"key":"7_CR29","doi-asserted-by":"publisher","unstructured":"Stefanesco, L., Raad, A., Vafeiadis, V.: Specifying and verifying persistent libraries. In: ESOP (2). LNCS, vol. 14577, pp. 185\u2013211. Springer (2024). https:\/\/doi.org\/10.1007\/978-3-031-57267-8_8","DOI":"10.1007\/978-3-031-57267-8_8"},{"key":"7_CR30","doi-asserted-by":"crossref","unstructured":"Vafeiadi\u00a0Bila, E., Dongol, B.: A verified durable transactional mutex lock for persistent x86-TSO. Form Methods Syst. Des. (2024). https:\/\/doi.org\/10.1007\/s10703-024-00462-1","DOI":"10.1007\/s10703-024-00462-1"},{"key":"7_CR31","doi-asserted-by":"crossref","unstructured":"Wei, Y., Ben-David, N., Friedman, M., Blelloch, G.E., Petrank, E.: Flit: a library for simple and efficient persistent algorithms. In: PPoPP, pp. 309\u2013321. ACM (2022)","DOI":"10.1145\/3503221.3508436"},{"key":"7_CR32","doi-asserted-by":"crossref","unstructured":"Wen, H., Cai, W., Du, M., Jenkins, L., Valpey, B., Scott, M.L.: A fast, general system for buffered persistent data structures. In: ICPP, pp. 73:1\u201373:11. ACM (2021)","DOI":"10.1145\/3472456.3472458"}],"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-032-10794-7_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T13:59:20Z","timestamp":1767967160000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-10794-7_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,16]]},"ISBN":["9783032107930","9783032107947"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-10794-7_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11,16]]},"assertion":[{"value":"16 November 2025","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":"Paris","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 November 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 November 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ifm2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ifm2025.ens.psl.eu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}