{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,30]],"date-time":"2026-09-30T23:58:04Z","timestamp":1790812684491,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"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_10","type":"book-chapter","created":{"date-parts":[[2009,12,2]],"date-time":"2009-12-02T07:11:04Z","timestamp":1259737864000},"page":"99-114","source":"Crossref","is-referenced-by-count":36,"title":["The Fault Detection Problem"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Haeberlen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Petr","family":"Kuznetsov","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"9","key":"10_CR1","doi-asserted-by":"publisher","first-page":"996","DOI":"10.1109\/71.954640","volume":"12","author":"L. Alvisi","year":"2001","unstructured":"Alvisi, L., Malkhi, D., Pierce, E.T., Reiter, M.K.: Fault detection for Byzantine quorum systems. IEEE Trans. Parallel Distrib. Syst.\u00a012(9), 996\u20131007 (2001)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Bar-Noy, A., Dolev, D., Dwork, C., Strong, H.R.: Shifting gears: changing algorithms on the fly to expedite Byzantine agreement. In: PODC, pp. 42\u201351 (1987)","DOI":"10.1145\/41840.41844"},{"issue":"2","key":"10_CR3","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/0890-5401(87)90054-X","volume":"75","author":"G. Bracha","year":"1987","unstructured":"Bracha, G.: Asynchronous Byzantine agreement protocols. Information and Computation\u00a075(2), 130\u2013143 (1987)","journal-title":"Information and Computation"},{"issue":"4","key":"10_CR4","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1145\/571637.571640","volume":"20","author":"M. Castro","year":"2002","unstructured":"Castro, M., Liskov, B.: Practical Byzantine fault tolerance and proactive recovery. ACM Transactions on Computer Systems\u00a020(4), 398\u2013461 (2002)","journal-title":"ACM Transactions on Computer Systems"},{"issue":"4","key":"10_CR5","first-page":"685","volume":"43","author":"T.D. Chandra","year":"1996","unstructured":"Chandra, T.D., Hadzilacos, V., Toueg, S.: The weakest failure detector for solving consensus. J.\u00a0ACM\u00a043(4), 685\u2013722 (1996)","journal-title":"J.\u00a0ACM"},{"issue":"2","key":"10_CR6","first-page":"225","volume":"43","author":"T.D. Chandra","year":"1996","unstructured":"Chandra, T.D., Toueg, S.: Unreliable failure detectors for reliable distributed systems. J.\u00a0ACM\u00a043(2), 225\u2013267 (1996)","journal-title":"J.\u00a0ACM"},{"issue":"2","key":"10_CR7","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1109\/TSE.1987.232894","volume":"13","author":"D.E. Denning","year":"1987","unstructured":"Denning, D.E.: An intrusion-detection model. IEEE Transactions on Software Engineering\u00a013(2), 222\u2013232 (1987)","journal-title":"IEEE Transactions on Software Engineering"},{"issue":"1","key":"10_CR8","first-page":"77","volume":"34","author":"D. Dolev","year":"1987","unstructured":"Dolev, D., Dwork, C., Stockmeyer, L.: On the minimal synchronism needed for distributed consensus. J.\u00a0ACM\u00a034(1), 77\u201397 (1987)","journal-title":"J.\u00a0ACM"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Haeberlen, A., Kuznetsov, P.: The fault detection problem, Technical Report MPI-SWS-2009-005, Max Planck Institute for Software Systems (October 2009)","DOI":"10.1007\/978-3-642-10877-8_10"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Haeberlen, A., Kuznetsov, P., Druschel, P.: PeerReview: Practical accountability for distributed systems. In: SOSP, October 2007, pp. 175\u2013188 (2007)","DOI":"10.1145\/1323293.1294279"},{"issue":"3","key":"10_CR11","first-page":"549","volume":"37","author":"J.Y. Halpern","year":"1990","unstructured":"Halpern, J.Y., Moses, Y.: Knowledge and common knowledge in a distributed environment. J.\u00a0ACM\u00a037(3), 549\u2013587 (1990)","journal-title":"J.\u00a0ACM"},{"issue":"1","key":"10_CR12","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1093\/comjnl\/46.1.16","volume":"46","author":"K.P. Kihlstrom","year":"2003","unstructured":"Kihlstrom, K.P., Moser, L.E., Melliar-Smith, P.M.: Byzantine fault detectors for solving consensus. The Computer Journal\u00a046(1), 16\u201335 (2003)","journal-title":"The Computer Journal"},{"key":"10_CR13","doi-asserted-by":"crossref","unstructured":"Ko, C., Fink, G., Levitt, K.: Automated detection of vulnerabilities in privileged programs using execution monitoring. In: Proceedings of the 10th Annual Computer Security Application Conference (December 1994)","DOI":"10.1109\/CSAC.1994.367313"},{"issue":"2","key":"10_CR14","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1145\/279227.279229","volume":"16","author":"L. Lamport","year":"1998","unstructured":"Lamport, L.: The part-time parliament. ACM Trans. Comput. Syst.\u00a016(2), 133\u2013169 (1998)","journal-title":"ACM Trans. Comput. Syst."},{"issue":"3","key":"10_CR15","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L. Lamport","year":"1982","unstructured":"Lamport, L., Shostak, R., Pease, M.: The Byzantine generals problem. ACM Trans. Progr. Lang. Syst.\u00a04(3), 382\u2013401 (1982)","journal-title":"ACM Trans. Progr. Lang. Syst."},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"Li, J., Krohn, M., Mazi\u00e8res, D., Sasha, D.: Secure untrusted data repository (SUNDR). In: OSDI (December 2004)","DOI":"10.21236\/ADA445862"},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"Vandiver, B., Balakrishnan, H., Liskov, B., Madden, S.: Tolerating Byzantine faults in transaction processing systems using commit barrier scheduling. In: SOSP (October 2007)","DOI":"10.1145\/1294261.1294268"}],"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_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:36:18Z","timestamp":1606185378000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10877-8_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642108761","9783642108778"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10877-8_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}