{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T14:14:54Z","timestamp":1761920094798,"version":"build-2065373602"},"reference-count":14,"publisher":"Association for Computing Machinery (ACM)","issue":"4","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Form. Asp. Comput."],"published-print":{"date-parts":[[2025,12,31]]},"abstract":"<jats:p>\n                    Linearizability is the standard correctness condition for concurrent data structures. Linearizability is often shown via refinement, i.e., a data structure implementation is shown to refine a so-called\n                    <jats:italic toggle=\"yes\">canonical<\/jats:italic>\n                    abstract automaton specifying the intented behavior. For non-volatile memory (NVM) with novel consistency constraints, the notion of linearizability has been extended to provide persistence guarantees. The results are several notions of \u201cpersistent linearizability\u201d. In this paper, we provide canonical automata for two such conditions: strict and durable linearizability, thereby providing abstract specifications for refinement proofs. We thus correct an error in the article Verifying correctness of persistent concurrent data structures: a sound and complete method [\n                    <jats:xref ref-type=\"bibr\">8<\/jats:xref>\n                    ].\n                  <\/jats:p>","DOI":"10.1145\/3715162","type":"journal-article","created":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T06:25:16Z","timestamp":1738304716000},"page":"1-9","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Canonical Automata for Persistent Linearizability - A Corrigendum"],"prefix":"10.1145","volume":"37","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2385-7512","authenticated-orcid":false,"given":"Heike","family":"Wehrheim","sequence":"first","affiliation":[{"name":"Carl von Ossietzky Universit\u00e4t Oldenburg","place":["Oldenburg, Germany"]}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,10,31]]},"reference":[{"key":"e_1_3_2_2_2","volume-title":"Strict Linearizability and the Power of Aborting","author":"Aguilera Marcos K.","year":"2003","unstructured":"Marcos K. Aguilera and Svend Fr\u00f8lund. 2003. Strict Linearizability and the Power of Aborting. Technical Report HPL-2003-241."},{"key":"e_1_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.DISC.2022.41"},{"key":"e_1_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.OPODIS.2015.20"},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-50521-8_2"},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-63390-9_28"},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2005.04.026"},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-30942-8_12"},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1007\/S00165-021-00541-8"},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1145\/78969.78972"},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53426-7_23"},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-99336-8_10"},{"key":"e_1_3_2_13_2","first-page":"137","volume-title":"PODC","author":"Lynch N. A.","year":"1987","unstructured":"N. A. Lynch and M. R. Tuttle. 1987. Hierarchical correctness proofs for distributed algorithms. In PODC. ACM, New York, NY, USA, 137\u2013151."},{"key":"e_1_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31424-7_21"},{"key":"e_1_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.1145\/3465084.3467944"}],"container-title":["Formal Aspects of Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3715162","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T14:07:36Z","timestamp":1761919656000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3715162"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,31]]},"references-count":14,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,12,31]]}},"alternative-id":["10.1145\/3715162"],"URL":"https:\/\/doi.org\/10.1145\/3715162","relation":{},"ISSN":["0934-5043","1433-299X"],"issn-type":[{"type":"print","value":"0934-5043"},{"type":"electronic","value":"1433-299X"}],"subject":[],"published":{"date-parts":[[2025,10,31]]},"assertion":[{"value":"2024-11-06","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-01-22","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-10-31","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}