{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T12:32:33Z","timestamp":1648729953344},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"5-6","license":[{"start":{"date-parts":[[2010,6,25]],"date-time":"2010-06-25T00:00:00Z","timestamp":1277424000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2010,8]]},"DOI":"10.1007\/s00446-010-0106-4","type":"journal-article","created":{"date-parts":[[2010,6,24]],"date-time":"2010-06-24T10:40:10Z","timestamp":1277376010000},"page":"303-334","source":"Crossref","is-referenced-by-count":3,"title":["Adaptive progress: a gracefully-degrading liveness property"],"prefix":"10.1007","volume":"22","author":[{"given":"Marcos K.","family":"Aguilera","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sam","family":"Toueg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,6,25]]},"reference":[{"key":"106_CR1","unstructured":"Aguilera, M.K., Delporte-Gallet, C., Fauconnier, H., Toueg, S.: On implementing Omega in systems with weak reliability and synchrony assumptions. Distrib. Comput. 21(4), 239\u2013314 (2008). A preliminary version of this work appeared in the Proceedings of the 22nd ACM Symposium on Principles of Distributed Computing, pp. 306\u2013314. ACM, New York (2003)"},{"key":"106_CR2","doi-asserted-by":"crossref","unstructured":"Aguilera, M.K., Frolund, S., Hadzilacos, V., Horn, S.L., Toueg, S.: Abortable and query-abortable objects and their efficient implementation. In: Proceedings of the 26th ACM Symposium on Principles of Distributed Computing, pp. 23\u201332. ACM, New York (2007)","DOI":"10.1145\/1281100.1281107"},{"key":"106_CR3","doi-asserted-by":"crossref","unstructured":"Aguilera, M.K., Toueg, S.: Timeliness-based wait-freedom: a gracefully degrading progress condition. In: Proceedings of the 27th ACM Symposium on Principles of Distributed Computing, pp. 305\u2013314. ACM, New York (2008)","DOI":"10.1145\/1400751.1400792"},{"issue":"4","key":"106_CR4","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1145\/234533.234549","volume":"43","author":"T.D. Chandra","year":"1996","unstructured":"Chandra T.D., Hadzilacos V., Toueg S.: The weakest failure detector for solving consensus. J. ACM 43(4), 685\u2013722 (1996)","journal-title":"J. ACM"},{"issue":"2","key":"106_CR5","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1145\/226643.226647","volume":"43","author":"T.D. Chandra","year":"1996","unstructured":"Chandra T.D., Toueg S.: Unreliable failure detectors for reliable distributed systems. J. ACM 43(2), 225\u2013267 (1996)","journal-title":"J. ACM"},{"issue":"2","key":"106_CR6","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1145\/42282.42283","volume":"35","author":"C. Dwork","year":"1988","unstructured":"Dwork C., Lynch N.A., Stockmeyer L.: Consensus in the presence of partial synchrony. J. ACM 35(2), 288\u2013323 (1988)","journal-title":"J. ACM"},{"key":"106_CR7","doi-asserted-by":"crossref","unstructured":"Fich, F.E., Luchangco, V., Moir, M., Shavit, N.: Obstruction-free algorithms can be practically wait-free. In: Proceedings of the 19th International Symposium on Distributed Computing, vol. 3724 of LNCS, pp. 78\u201392. Springer, Heidelberg (2005)","DOI":"10.1007\/11561927_8"},{"key":"106_CR8","doi-asserted-by":"crossref","unstructured":"Guerraoui, R., Herlihy, M., Pochon, B.: Toward a theory of transactional contention managers. In: Proceedings of the 24th ACM Symposium on Principles of Distributed Computing, pp. 258\u2013264. ACM, New York (2005)","DOI":"10.1145\/1073814.1073863"},{"issue":"6","key":"106_CR9","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1007\/s00446-007-0046-9","volume":"20","author":"R. Guerraoui","year":"2008","unstructured":"Guerraoui R., Kapalka M., Kouznetsov P.: The weakest failure detectors to boost obstruction-freedom. Distrib. Comput. 20(6), 415\u2013433 (2008)","journal-title":"Distrib. Comput."},{"issue":"1","key":"106_CR10","doi-asserted-by":"crossref","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. 13(1), 124\u2013149 (1991)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"106_CR11","doi-asserted-by":"crossref","unstructured":"Herlihy, M., Luchangco, V., Moir, M.: Obstruction-free synchronization: Double-ended queues as an example. In: Proceedings of the 23rd International Conference on Distributed Computing Systems, pp. 522\u2013529. IEEE Computer Society, New York (2003)","DOI":"10.1109\/ICDCS.2003.1203503"},{"issue":"3","key":"106_CR12","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1145\/78969.78972","volume":"12","author":"M. Herlihy","year":"1990","unstructured":"Herlihy M., Wing J.: Linearizability: a correctness condition for concurrent objects. Trans. Program. Lang. Syst. 12(3), 463\u2013492 (1990)","journal-title":"Trans. Program. Lang. Syst."},{"issue":"2","key":"106_CR13","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/BF01786227","volume":"1","author":"L. Lamport","year":"1986","unstructured":"Lamport L.: On interprocess communication; part I: basic formalism. Distrib. Comput. 1(2), 77\u201385 (1986)","journal-title":"Distrib. Comput."},{"issue":"2","key":"106_CR14","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1007\/BF01786228","volume":"1","author":"L. Lamport","year":"1986","unstructured":"Lamport L.: On interprocess communication; part II: algorithms. Distrib. Comput. 1(2), 86\u2013101 (1986)","journal-title":"Distrib. Comput."},{"key":"106_CR15","doi-asserted-by":"crossref","unstructured":"Taubenfeld, G.: Efficient transformations of obstruction-free algorithms into non-blocking algorithms. In: Proceedings of the 21st International Symposium on Distributed Computing, vol. 4731 of LNCS, pp. 450\u2013464. Springer, Heidelberg (2007)","DOI":"10.1007\/978-3-540-75142-7_34"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-010-0106-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-010-0106-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-010-0106-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T07:23:17Z","timestamp":1559200997000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-010-0106-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6,25]]},"references-count":15,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[2010,8]]}},"alternative-id":["106"],"URL":"https:\/\/doi.org\/10.1007\/s00446-010-0106-4","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,6,25]]}}}