{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T15:39:40Z","timestamp":1753889980847,"version":"3.41.2"},"reference-count":1,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2013,9,9]],"date-time":"2013-09-09T00:00:00Z","timestamp":1378684800000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>Linearizability is a commonly accepted notion of correctness for libraries of\nconcurrent algorithms. Unfortunately, it assumes a complete isolation between a\nlibrary and its client, with interactions limited to passing values of a given\ndata type. This is inappropriate for common programming languages, where\nlibraries and their clients can communicate via the heap, transferring the\nownership of data structures, and can even run in a shared address space\nwithout any memory protection. In this paper, we present the first definition\nof linearizability that lifts this limitation and establish an Abstraction\nTheorem: while proving a property of a client of a concurrent library, we can\nsoundly replace the library by its abstract implementation related to the\noriginal one by our generalisation of linearizability. This allows abstracting\nfrom the details of the library implementation while reasoning about the\nclient. We also prove that linearizability with ownership transfer can be\nderived from the classical one if the library does not access some of data\nstructures transferred to it by the client.<\/jats:p>","DOI":"10.2168\/lmcs-9(3:12)2013","type":"journal-article","created":{"date-parts":[[2013,11,29]],"date-time":"2013-11-29T13:44:29Z","timestamp":1385732669000},"source":"Crossref","is-referenced-by-count":4,"title":["Linearizability with Ownership Transfer"],"prefix":"10.46298","volume":"Volume 9, Issue 3","author":[{"given":"Alexey","family":"Gotsman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongseok","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"25203","published-online":{"date-parts":[[2013,9,9]]},"reference":[{"key":"852:not-found"}],"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/931\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/931\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,11]],"date-time":"2023-04-11T19:59:18Z","timestamp":1681243158000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/931"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9,9]]},"references-count":1,"URL":"https:\/\/doi.org\/10.2168\/lmcs-9(3:12)2013","relation":{"is-same-as":[{"id-type":"arxiv","id":"1308.2507","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1308.2507","asserted-by":"subject"}],"is-referenced-by":[{"id-type":"doi","id":"10.1145\/2796550","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"type":"electronic","value":"1860-5974"}],"subject":[],"published":{"date-parts":[[2013,9,9]]},"article-number":"931"}}