{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T03:51:16Z","timestamp":1794369076412,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642108761","type":"print"},{"value":"9783642108778","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-10877-8_21","type":"book-chapter","created":{"date-parts":[[2009,12,2]],"date-time":"2009-12-02T02:11:04Z","timestamp":1259719864000},"page":"255-269","source":"Crossref","is-referenced-by-count":10,"title":["Abortable Fork-Linearizable Storage"],"prefix":"10.1007","author":[{"given":"Matthias","family":"Majuntke","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dan","family":"Dobre","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marco","family":"Serafini","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Neeraj","family":"Suri","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"21_CR1","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1145\/571825.571840","volume-title":"PODC","author":"D. Mazi\u00e8res","year":"2002","unstructured":"Mazi\u00e8res, D., Shasha, D.: Building Secure File Systems out of Byzantine Storage. In: PODC, pp. 108\u2013117. ACM, New York (2002)"},{"key":"21_CR2","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1145\/1281100.1281121","volume-title":"PODC","author":"C. Cachin","year":"2007","unstructured":"Cachin, C., Shelat, A., Shraer, A.: Efficient Fork-Linearizable Access to Untrusted Shared Memory. In: PODC, pp. 129\u2013138. ACM, New York (2007)"},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"Cachin, C., Keidar, I., Shraer, A.: Trusting the Cloud. ACM SIGACT News, Distributed Computing in the Clouds 40(2), 81\u201386 (2009)","DOI":"10.1145\/1556154.1556173"},{"key":"21_CR4","unstructured":"CVS: Concurrent Versions System (visited) (June 2009), http:\/\/www.nongnu.org\/cvs\/"},{"key":"21_CR5","unstructured":"SVN: Subversion (visited) (June 2009), http:\/\/subversion.tigris.org\/"},{"issue":"1","key":"21_CR6","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/253452.253458","volume":"5","author":"E.J. Whitehead Jr.","year":"1997","unstructured":"Whitehead Jr., E.J.: World Wide Web Distributed Authoring and Versioning (WebDAV): An Introduction. Standard View\u00a05(1), 3\u20138 (1997)","journal-title":"Standard View"},{"key":"21_CR7","doi-asserted-by":"publisher","first-page":"725","DOI":"10.1145\/1367497.1367595","volume-title":"WWW","author":"J. Yang","year":"2008","unstructured":"Yang, J., Wang, H., Gu, N., Liu, Y., Wang, C., Zhang, Q.: Lock-free Consistency Control for Web 2.0 Applications. In: WWW, pp. 725\u2013734. ACM, New York (2008)"},{"key":"21_CR8","unstructured":"Google Inc.: Google docs (visited) (June 2009), at http:\/\/docs.google.com"},{"key":"21_CR9","unstructured":"Wikipedia: List of file systems, distributed file systems (visited) (June 2009), at http:\/\/en.wikipedia.org\/wiki\/List_of_file_systems"},{"issue":"1","key":"21_CR10","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1145\/114005.102808","volume":"13","author":"M. Herlihy","year":"1991","unstructured":"Herlihy, M.: Wait-Free Synchronization. ACM Trans. Program. Lang. Syst.\u00a013(1), 124\u2013149 (1991)","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"3","key":"21_CR11","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/78969.78972","volume":"12","author":"M.P. Herlihy","year":"1990","unstructured":"Herlihy, M.P., Wing, J.M.: Linearizability: A Correctness Condition for Concurrent Objects. ACM Trans. Program. Lang. Syst.\u00a012(3), 463\u2013492 (1990)","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"4","key":"21_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1538902.1538908","volume":"56","author":"H. Attiya","year":"2009","unstructured":"Attiya, H., Guerraoui, R., Hendler, D., Kuznetsov, P.: The Complexity of Obstruction-Free Implementations. J. ACM\u00a056(4), 1\u201333 (2009)","journal-title":"J. ACM"},{"key":"21_CR13","first-page":"522","volume-title":"ICDCS","author":"M. Herlihy","year":"2003","unstructured":"Herlihy, M., Luchangco, V., Moir, M.: Obstruction-Free Synchronization: Double-Ended Queues as an Example. In: ICDCS, Washington, DC, USA, p. 522. IEEE Computer Society Press, Los Alamitos (2003)"},{"key":"21_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/11864219_18","volume-title":"Distributed Computing","author":"A. Oprea","year":"2006","unstructured":"Oprea, A., Reiter, M.K.: On consistency of encrypted files. In: Dolev, S. (ed.) DISC 2006. LNCS, vol.\u00a04167, pp. 254\u2013268. Springer, Heidelberg (2006)"},{"issue":"7","key":"21_CR15","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1016\/j.ipl.2008.12.004","volume":"109","author":"C. Cachin","year":"2009","unstructured":"Cachin, C., Keidar, I., Shraer, A.: Fork Sequential Consistency is Blocking. Inf. Process. Lett.\u00a0109(7), 360\u2013364 (2009)","journal-title":"Inf. Process. Lett."},{"key":"21_CR16","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1145\/1281100.1281107","volume-title":"PODC: Principles of distributed computing","author":"M.K. Aguilera","year":"2007","unstructured":"Aguilera, M.K., Frolund, S., Hadzilacos, V., Horn, S.L., Toueg, S.: Abortable and Query-Abortable Objects and Their Efficient Implementation. In: PODC: Principles of distributed computing, pp. 23\u201332. ACM, New York (2007)"},{"key":"21_CR17","doi-asserted-by":"crossref","unstructured":"Cachin, C., Keidar, I., Shraer, A.: Fail-Aware Untrusted Storage. In: DSN (2009)","DOI":"10.1109\/DSN.2009.5270299"},{"key":"21_CR18","unstructured":"Li, J., Mazi\u00e8res, D.: Beyond One-Third Faulty Replicas in Byzantine Fault Tolerant Systems. In: NSDI (2007)"},{"key":"21_CR19","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1145\/1400751.1400792","volume-title":"PODC 2008: Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing","author":"M.K. Aguilera","year":"2008","unstructured":"Aguilera, M.K., Toueg, S.: Timeliness-Based Wait-Freedom: A Gracefully Degrading Progress Condition. In: PODC 2008: Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing, pp. 305\u2013314. ACM, New York (2008)"},{"issue":"3","key":"21_CR20","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1145\/278298.278305","volume":"45","author":"P. Jayanti","year":"1998","unstructured":"Jayanti, P., Chandra, T.D., Toueg, S.: Fault-tolerant Wait-free Shared Objects. J. ACM\u00a045(3), 451\u2013500 (1998)","journal-title":"J. ACM"},{"issue":"2","key":"21_CR21","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"M. Pease","year":"1980","unstructured":"Pease, M., Shostak, R., Lamport, L.: Reaching Agreement in the Presence of Faults. J. ACM\u00a027(2), 228\u2013234 (1980)","journal-title":"J. ACM"},{"key":"21_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/11561927_11","volume-title":"Distributed Computing","author":"H. Attiya","year":"2005","unstructured":"Attiya, H., Guerraoui, R., Kouznetsov, P.: Computing with Reads and Writes in the Absence of Step Contention. In: Fraigniaud, P. (ed.) DISC 2005. LNCS, vol.\u00a03724, pp. 122\u2013136. Springer, Heidelberg (2005)"},{"key":"21_CR23","doi-asserted-by":"crossref","unstructured":"Dobre, D., Majuntke, M., Serafini, M., Suri, N.: Abortable Fork-Linearizable Storage. Technical Report TR-TUD-DEEDS-07-03-2009 (July 2009), http:\/\/www.deeds.informatik.tu-darmstadt.de\/matze\/afcs.pdf","DOI":"10.1007\/978-3-642-10877-8_21"}],"container-title":["Lecture Notes in Computer Science","Principles of Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10877-8_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,27]],"date-time":"2023-05-27T15:08:34Z","timestamp":1685200114000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10877-8_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642108761","9783642108778"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10877-8_21","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-642-10877-8","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}