{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,12]],"date-time":"2025-01-12T05:08:46Z","timestamp":1736658526348,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540472377"},{"type":"electronic","value":"9783540472384"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11901914_29","type":"book-chapter","created":{"date-parts":[[2006,10,10]],"date-time":"2006-10-10T05:21:43Z","timestamp":1160457703000},"page":"384-398","source":"Crossref","is-referenced-by-count":0,"title":["Proactive Leader Election in Asynchronous Shared Memory Systems"],"prefix":"10.1007","author":[{"given":"M. C.","family":"Dharmadeep","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Gopinath","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Gafni, E., Lamport, L.: Disk Paxos. In: Proceedings of the International Symposium on Distributed Computing, pp. 330\u2013344 (2000)","key":"29_CR1","DOI":"10.1007\/3-540-40026-5_22"},{"key":"29_CR2","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 Transactions on Computer systems\u00a016, 133\u2013169 (1998)","journal-title":"ACM Transactions on Computer systems"},{"key":"29_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-45949-9","volume-title":"\u2018Isabelle\/HOL \u2013 A Proof Assistant for Higher-Order Logic","author":"T. Nipkow","year":"2002","unstructured":"Nipkow, T., Paulson, L.C., Wenzel, M.T.: Isabelle\/HOL. LNCS, vol.\u00a02283. Springer, Heidelberg (2002)"},{"unstructured":"http:\/\/afp.sourceforge.net\/browser_info\/current\/HOL\/DiskPaxos\/","key":"29_CR4"},{"doi-asserted-by":"crossref","unstructured":"Jayanti, P., Chandra, T.D., Toueg, S.: Fault-tolerant wait-free shared objects. In: Proceedings of the 33 rd Annual Symposium on Foundations of Computer Science (1992)","key":"29_CR5","DOI":"10.1109\/SFCS.1992.267776"},{"unstructured":"Chockler, G., Malkhi, D.: Light-Weight Leases for Storage-Centric Coordination. MIT-LCS-TR-934 Publication Date: 4-22-2004","key":"29_CR6"},{"doi-asserted-by":"crossref","unstructured":"Aquilera, M.K., Delporte-Gallet, C., Fauconnier, H., Toueg, S.: Stable Leader Election. In: Proceedings of the 15th International Conference on Distributed Computing, pp. 108\u2013122 (2001)","key":"29_CR7","DOI":"10.1007\/3-540-45414-4_8"},{"key":"29_CR8","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Distributed Algorithms","author":"B. Lampson","year":"1996","unstructured":"Lampson, B.: How to build a highly available system using consensus. In: Babao\u011flu, \u00d6., Marzullo, K. (eds.) WDAG 1996. LNCS, vol.\u00a01151, pp. 1\u201317. Springer, Heidelberg (1996)"},{"doi-asserted-by":"crossref","unstructured":"De Prisco, R., Lampson, B., Lynch, N.: Revisiting the Paxos algorithm. In: Proceedings of the 11 th Workshop on Distributed Algorithms (WDAG), Saarbr\u00fccken, September 1997, pp. 11\u2013125 (1997)","key":"29_CR9","DOI":"10.1007\/BFb0030679"},{"doi-asserted-by":"crossref","unstructured":"Larrea, M., Fern\u00e1ndez, A., Ar\u00e9valo, S.: Optimal implementation of the weakest failure detector for solving consensus. In: Proceedings of the 19 th IEEE Symposium on Reliable Distributed Systems, SRDS 2000, Nurenberg, Germany, October 2000, pp. 52\u201359 (2000)","key":"29_CR10","DOI":"10.1109\/RELDI.2000.885392"},{"issue":"6","key":"29_CR11","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/S0020-0190(98)00122-7","volume":"67","author":"F. Chu","year":"1998","unstructured":"Chu, F.: Reducing \u03a9 to \u22c4\u2009W. Information Processing Letters\u00a067(6), 293\u2013298 (1998)","journal-title":"Information Processing Letters"},{"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 8 th International Workshop in Distributed Algorithms, pp. 280\u2013295 (1994)","key":"29_CR12","DOI":"10.1007\/BFb0020440"},{"issue":"2","key":"29_CR13","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"M.J. Fischer","year":"1985","unstructured":"Fischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of distributed consensus with one faulty process. Journal of the Association for Computing Machinery\u00a032(2), 374\u2013382 (1985)","journal-title":"Journal of the Association for Computing Machinery"},{"issue":"1","key":"29_CR14","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1145\/7531.7533","volume":"34","author":"D. Dolev","year":"1987","unstructured":"Dolev, D., Dwork, C., Stockmeyer, L.: On the minimal synchronism needed for distributed consensus. Journal of the ACM\u00a034(1), 77\u201397 (1987)","journal-title":"Journal of the ACM"},{"key":"29_CR15","first-page":"163","volume":"4","author":"M.C. Loui","year":"1987","unstructured":"Loui, M.C., Abu-Amara, H.H.: Memory requirements for agreement among unreliable asynchronous processes. advances in Computer Research\u00a04, 163\u2013183 (1987)","journal-title":"advances in Computer Research"},{"doi-asserted-by":"crossref","unstructured":"Chockler, G., Malkhi, D.: Active Disk Paxos with Infinitely Many Processes. In: Proceedings of the 21 st ACM Symposium on Principles of Distributed Computing (PODC) (August 2002)","key":"29_CR16","DOI":"10.1145\/571825.571837"},{"unstructured":"http:\/\/agni.csa.iisc.ernet.in\/~dharma\/ATVA06\/document.pdf","key":"29_CR17"},{"doi-asserted-by":"crossref","unstructured":"Cristian, F., Fetzer, C.: The timed asynchronous system model. In: Proceedings of the 28 th Annual International Symposium on Fault-Tolerant Computing, Munich, Germany, June 1998, pp. 140\u2013149 (1998)","key":"29_CR18","DOI":"10.1109\/FTCS.1998.689463"}],"container-title":["Lecture Notes in Computer Science","Automated Technology for Verification and Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11901914_29.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,11]],"date-time":"2025-01-11T09:47:58Z","timestamp":1736588878000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11901914_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540472377","9783540472384"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/11901914_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}