{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T18:46:20Z","timestamp":1743014780522,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540411437"},{"type":"electronic","value":"9783540400264"}],"license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-40026-5_23","type":"book-chapter","created":{"date-parts":[[2007,6,12]],"date-time":"2007-06-12T23:59:07Z","timestamp":1181692747000},"page":"345-359","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Objects Shared by Byzantine Processes"],"prefix":"10.1007","author":[{"given":"Dahlia","family":"Malkhi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Merritt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Reiter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gadi","family":"Taubenfeld","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,3,15]]},"reference":[{"key":"23_CR1","unstructured":"P.C. Attie Wait-free Byzantine Agreement. Technical ReportNU-CCS-00-02, College of Computer Science, Northeastern University, May 2000."},{"issue":"6","key":"23_CR2","doi-asserted-by":"publisher","first-page":"1231","DOI":"10.1145\/227683.227688","volume":"42","author":"Y. Afek","year":"1995","unstructured":"Y. Afek, D. Greenberg, M. Merritt, and G. Taubenfeld. Computing with faulty shared memory. Journal of the ACM, 42(6):1231\u20131274, November 1995.","journal-title":"Journal of the ACM"},{"issue":"8","key":"23_CR3","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1145\/135226.135227","volume":"35","author":"G. Bell","year":"1992","unstructured":"G. Bell. Ultracomputers: A teraflop before its time. Communications of the ACM, 35(8):27\u201347, August 1992.","journal-title":"Communications of the ACM"},{"key":"23_CR4","unstructured":"M. Castro and B. Liskov. Practical Byzantine fault tolerance. In Proceedings of the 3rd Symposium on Operating Systems Design and Implementation-OSDI\u201999, February, 1999, New Orleans, LA."},{"issue":"1","key":"23_CR5","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1006\/inco.1993.1043","volume":"105","author":"S. Chaudhuri","year":"1993","unstructured":"S. Chaudhuri. More choices allow more faults: set consensus problems in totally asynchronous systems. Information and Computation, 105(1): 132\u2013158, July 1993.","journal-title":"Information and Computation"},{"issue":"4","key":"23_CR6","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1145\/63334.63337","volume":"32","author":"N. Carriero","year":"1989","unstructured":"N. Carriero and D. Gelernter. Linda in context. Communications of the ACM, 32(4):444\u2013458, April 1989.","journal-title":"Communications of the ACM"},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"M. Fischer, N. Lynch, and M. Paterson. Impossibility of distributed consensus with one faulty process. Journal of the ACM, 32:374\u2013382, April1985.","DOI":"10.1145\/3149.214121"},{"issue":"1","key":"23_CR8","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1145\/114005.102808","volume":"11","author":"M. Herlihy","year":"1991","unstructured":"M. Herlihy. Wait-free synchronization. A CM Transactions on Programming Languages and Systems 11(1): 124\u2013149, January 1991.","journal-title":"A CM Transactions on Programming Languages and Systems"},{"issue":"3","key":"23_CR9","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1145\/278298.278305","volume":"45","author":"P. Jayanti","year":"1998","unstructured":"P. Jayanti, T. Chandra, and S. Toueg. Fault-tolerant wait-free shared objects. Journal of the ACM, 45(3):451\u2013500, May 1998.","journal-title":"Journal of the ACM"},{"key":"23_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/3-540-56188-9_5","volume-title":"Proc. of the 6th Int. Workshop on Distributed Algorithms","author":"P. Jayanti","year":"1992","unstructured":"P. Jayanti, and S. Toueg. Some results on the impossibility, universality, and decidability of consensus. Proc. of the 6th Int. Workshop on Distributed Algorithms: LNCS, 647, pages 69\u201384. Springer Verlag, Nov. 1992."},{"issue":"3","key":"23_CR11","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/78969.78972","volume":"12","author":"M. P. Herlihy","year":"1990","unstructured":"M. P. Herlihy and J. M. Wing. Linearizability: A correctness condition for concurrent objects. A CM Transactions on Programming Languages and Systems 12(3):463\u2013492, July 1990.","journal-title":"A CM Transactions on Programming Languages and Systems"},{"key":"23_CR12","doi-asserted-by":"crossref","unstructured":"K. P. Kihlstrom, L. E. Moser and P. M. Melliar-Smith. The SecureRing protocols for securing group communication. In Proceedings of the 31st IEEE Hawaii Int. Conf. on System Sciences, pages 317\u2013326, January 1998.","DOI":"10.1109\/HICSS.1998.656294"},{"key":"23_CR13","first-page":"163","volume":"4","author":"M. C. Loui","year":"1987","unstructured":"M. C. Loui and H. H. Abu-Amara. Memory requirements for agreement among unreliable asynchronous processes. Advances in Computing Research, JAI Press, 4:163\u2013183, 1987.","journal-title":"Advances in Computing Research"},{"issue":"4","key":"23_CR14","first-page":"321","volume":"7","author":"K. Li","year":"1989","unstructured":"K. Li and P. Hudak. Memory coherence in shared virtual memory systems. ACM Trans, on Programming Languages and Systems, 7(4):321\u2013359, 1989.","journal-title":"ACM Trans, on Programming Languages and Systems"},{"issue":"2","key":"23_CR15","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1109\/69.842262","volume":"12","author":"D. Malkhi","year":"2000","unstructured":"D. Malkhi and M. K. Reiter. An architecture for survivable coordination in large distributed systems. IEEE Transactions on Knowledge and Data Engineering 12(2):187\u2013202, March\/April 2000.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"23_CR16","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0020-0190(87)90052-4","volume":"26","author":"S. Moran","year":"1987","unstructured":"S. Moran and Y. Wolfsthal. An extended impossibility result for asynchronous complete networks. Info. Processing Letters, 26:141\u2013151, 1987.","journal-title":"Info. Processing Letters"},{"issue":"l","key":"23_CR17","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1145\/58564.59294","volume":"7","author":"F. M. Pittelli","year":"1989","unstructured":"F. M. Pittelli and H. Garcia-Molina. Reliable scheduling in a TMR database system. ACM Transactions on Computer Systems, 7(l):25\u201360, February 1989.","journal-title":"ACM Transactions on Computer Systems"},{"key":"23_CR18","doi-asserted-by":"crossref","unstructured":"S. A. Plotkin. Sticky bits and universality of consensus. In Proc. 8th ACM Symp. on Principles of Distributed Computing, pages 159\u2013175, August 1989.","DOI":"10.1145\/72981.72992"},{"issue":"4","key":"23_CR19","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1145\/227210.227228","volume":"39","author":"M. K. Reiter","year":"1996","unstructured":"M. K. Reiter. Distributing trust with the Rampart toolkit. Communications of the A CM 39(4):71\u201374, April 1996.","journal-title":"Communications of the A CM"},{"issue":"5","key":"23_CR20","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1109\/12.142680","volume":"41","author":"S. K. Shrivastava","year":"1992","unstructured":"S. K. Shrivastava, P. D. Ezhilchelvan, N. A. Speirs, S. Tao, and A. Tully. Principal features of the VOLTAN family of reliable node architectures for distributed systems. IEEE Trans, on Computers, 41(5):542\u2013549, May 1992.","journal-title":"IEEE Trans, on Computers"},{"key":"23_CR21","doi-asserted-by":"crossref","unstructured":"A. S. Tannenbaum, M. F. Kaashoek, and H. E. Balvrije. Parallel programming using shared objects. IEEE Computer, pages 10\u201319, August 1992.","DOI":"10.1109\/2.153276"},{"issue":"1","key":"23_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s002360050034","volume":"33","author":"G. Taubenfeld","year":"1996","unstructured":"G. Taubenfeld and S. Moran. Possibility and impossibility results in a shared memory environment. Ada Informatica, 33(1): 1\u201320, 1996.","journal-title":"Ada Informatica"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-40026-5_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T06:42:23Z","timestamp":1737096143000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-40026-5_23"}},"subtitle":["(Extended Abstract)"],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540411437","9783540400264"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-40026-5_23","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]},"assertion":[{"value":"15 March 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}