{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T22:24:55Z","timestamp":1761949495029,"version":"build-2065373602"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2007,10,9]],"date-time":"2007-10-09T00:00:00Z","timestamp":1191888000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc\/2.0"},{"start":{"date-parts":[[2007,10,9]],"date-time":"2007-10-09T00:00:00Z","timestamp":1191888000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc\/2.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2008,2]]},"DOI":"10.1007\/s00446-007-0043-z","type":"journal-article","created":{"date-parts":[[2007,10,8]],"date-time":"2007-10-08T07:45:28Z","timestamp":1191829528000},"page":"343-358","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Failure detectors as type boosters"],"prefix":"10.1007","volume":"20","author":[{"given":"Rachid","family":"Guerraoui","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Petr","family":"Kouznetsov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,10,9]]},"reference":[{"issue":"4","key":"43_CR1","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1145\/153724.153741","volume":"40","author":"Y. Afek","year":"1993","unstructured":"Afek Y., Attiya H., Dolev D., Gafni E., Merrit M. and Shavit N. (1993). Atomic snapshots of shared memory. J. ACM 40(4): 873\u2013890","journal-title":"J. ACM"},{"key":"43_CR2","unstructured":"Attie, P., Lynch, N.A., Rajsbaum, S.: Boosting fault-tolerance in asynchronous message passing systems is impossible. Technical report. MIT Laboratory for Computer Science, MIT-LCS-TR-877, (2002)"},{"key":"43_CR3","unstructured":"Attie, P.C., Guerraoui, R., Kouznetsov, P., Lynch, N.A., Rajsbaum, S.: The impossibility of boosting distributed service resilience. In: Proceedings of the 25th IEEE International Conference on Distributed Computing Systems (ICDCS\u201905), June (2005)"},{"key":"43_CR4","doi-asserted-by":"crossref","DOI":"10.1002\/0471478210","volume-title":"Distributed Computing: Fundamentals, Simulations and Advanced Topics, 2nd edn","author":"H. Attiya","year":"2004","unstructured":"Attiya H. and Welch J.L. (2004). Distributed Computing: Fundamentals, Simulations and Advanced Topics, 2nd edn. Wiley, New York"},{"key":"43_CR5","doi-asserted-by":"crossref","unstructured":"Borowsky, E., Gafni, E., Afek, Y.: Consensus power makes (some) sense! In: Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 363\u2013372, August (1994)","DOI":"10.1145\/197917.198126"},{"issue":"2","key":"43_CR6","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1137\/S0097539798344367","volume":"34","author":"T.D. Chandra","year":"2004","unstructured":"Chandra T.D., Hadzilacos V., Jayanti P. and Toueg S. (2004). Generalized irreducibility of consensus and the equivalence of t-resilient and wait-free implementations of consensus. SIAM J. Comput. 34(2): 333\u2013357","journal-title":"SIAM J. Comput."},{"issue":"4","key":"43_CR7","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1145\/234533.234549","volume":"43","author":"T.D. Chandra","year":"1996","unstructured":"Chandra T.D., Hadzilacos V. and Toueg S. (1996). The weakest failure detector for solving consensus. J. ACM 43(4): 685\u2013722","journal-title":"J. ACM"},{"issue":"2","key":"43_CR8","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1145\/226643.226647","volume":"43","author":"T.D. Chandra","year":"1996","unstructured":"Chandra T.D. and Toueg S. (1996). Unreliable failure detectors for reliable distributed systems. J. ACM 43(2): 225\u2013267","journal-title":"J. ACM"},{"issue":"1","key":"43_CR9","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1145\/7531.7533","volume":"34","author":"D. Dolev","year":"1987","unstructured":"Dolev D., Dwork C. and Stockmeyer L.J. (1987). On the minimal synchronism needed for distributed consensus. J. ACM 34(1): 77\u201397","journal-title":"J. ACM"},{"issue":"2","key":"43_CR10","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1145\/42282.42283","volume":"35","author":"C. Dwork","year":"1988","unstructured":"Dwork C., Lynch N.A. and Stockmeyer L.J. (1988). Consensus in the presence of partial synchrony. J. ACM 35(2): 288\u2013323","journal-title":"J. ACM"},{"issue":"3","key":"43_CR11","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"M.J. Fischer","year":"1985","unstructured":"Fischer M.J., Lynch N.A. and Paterson M.S. (1985). Impossibility of distributed consensus with one faulty process. J. ACM 32(3): 374\u2013382","journal-title":"J. ACM"},{"key":"43_CR12","unstructured":"Guerraoui, R., Herlihy, M., Kouznetsov, P., Lynch, N., Newport, C.: On the weakest failure detector ever. Technical report, Max Planck Institute for Software Systems"},{"key":"43_CR13","doi-asserted-by":"crossref","unstructured":"Guerraoui, R., Kouznetsov, P.: On failure detectors and type boosters. In: Proceedings of the 17th International Symposium on Distributed Computing (DISC\u201903), October (2003)","DOI":"10.1007\/978-3-540-39989-6_21"},{"issue":"1","key":"43_CR14","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1145\/114005.102808","volume":"13","author":"M. Herlihy","year":"1991","unstructured":"Herlihy M. (1991). Wait-free synchronization. ACM Trans. Program. Lang. Syst. 13(1): 124\u2013149","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"43_CR15","doi-asserted-by":"crossref","unstructured":"Herlihy, M., Ruppert, E.: On the existence of booster types. In: Proceedings of the 41st IEEE Symposium on Foundations of Computer Science (FOCS), pp 653\u2013663 (2000)","DOI":"10.1109\/SFCS.2000.892333"},{"issue":"3","key":"43_CR16","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/78969.78972","volume":"12","author":"M. Herlihy","year":"1990","unstructured":"Herlihy M. and Wing J.M. (1990). Linearizability: a correctness condition for concurrent objects. ACM Trans. Program. Lang. Syst. 12(3): 463\u2013492","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"4","key":"43_CR17","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1145\/263867.263888","volume":"44","author":"P. Jayanti","year":"1997","unstructured":"Jayanti P. (1997). Robust wait-free hierarchies. J. ACM 44(4): 592\u2013614","journal-title":"J. ACM"},{"key":"43_CR18","doi-asserted-by":"crossref","unstructured":"Jayanti, P., Toueg, S.: Some results on the impossibility, universality and decidability of consensus. In: Proceedings of the 6th International Workshop on Distributed Algorithms (WDAG\u201992). LNCS, vol 647. Springer, Heidelberg (1992)","DOI":"10.1007\/3-540-56188-9_5"},{"key":"43_CR19","doi-asserted-by":"crossref","unstructured":"Lo, W.-K., Hadzilacos, V.: Using failure detectors to solve consensus in asynchronous shared-memory systems. In: Proceedings of the 8th International Workshop on Distributed Algorithms (WDAG\u201994). LNCS, vol. 857, pp. 280\u2013295. Springer, Heidelberg (1994)","DOI":"10.1007\/BFb0020440"},{"issue":"3","key":"43_CR20","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1137\/S0097539798335766","volume":"30","author":"W.-K. Lo","year":"2000","unstructured":"Lo W.-K. and Hadzilacos V. (2000). All of us are smarter than any of us: Nondeterministic wait-free hierarchies are not robust. SIAM J. Comput. 30(3): 689\u2013728","journal-title":"SIAM J. Comput."},{"key":"43_CR21","unstructured":"Loui, M.C., Abu-Amara, H.H.: Memory requirements for agreement among unreliable asynchronous processes. Adv. Comput. Res., pp. 163\u2013183 (1987)"},{"key":"43_CR22","volume-title":"Distributed Algorithms","author":"N.A. Lynch","year":"1996","unstructured":"Lynch N.A. (1996). Distributed Algorithms. Morgan Kaufmann Publishers, San Francisco"},{"key":"43_CR23","doi-asserted-by":"crossref","unstructured":"Neiger, G.: Failure detectors and the wait-free hierarchy. In: Proceedings of the 14th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 100\u2013109, August (1995)","DOI":"10.1145\/224964.224976"},{"issue":"4","key":"43_CR24","doi-asserted-by":"publisher","first-page":"1156","DOI":"10.1137\/S0097539797329439","volume":"30","author":"E. Ruppert","year":"2000","unstructured":"Ruppert E. (2000). Determining consensus numbers. SIAM J. Comput. 30(4): 1156\u20131168","journal-title":"SIAM J. Comput."}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-007-0043-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00446-007-0043-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-007-0043-z.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-007-0043-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T12:52:05Z","timestamp":1737463925000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00446-007-0043-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,10,9]]},"references-count":24,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2008,2]]}},"alternative-id":["43"],"URL":"https:\/\/doi.org\/10.1007\/s00446-007-0043-z","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"type":"print","value":"0178-2770"},{"type":"electronic","value":"1432-0452"}],"subject":[],"published":{"date-parts":[[2007,10,9]]},"assertion":[{"value":"1 June 2004","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 July 2007","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 October 2007","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}