{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:52:44Z","timestamp":1725893564993},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642354755"},{"type":"electronic","value":"9783642354762"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-35476-2_10","type":"book-chapter","created":{"date-parts":[[2012,12,13]],"date-time":"2012-12-13T15:48:14Z","timestamp":1355413694000},"page":"135-150","source":"Crossref","is-referenced-by-count":4,"title":["Crash Resilient and Pseudo-Stabilizing Atomic Registers"],"prefix":"10.1007","author":[{"given":"Shlomi","family":"Dolev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Swan","family":"Dubois","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maria","family":"Gradinariu Potop-Butucaru","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S\u00e9bastien","family":"Tixeuil","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1-3","key":"10_CR1","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1016\/S0304-3975(03)00130-0","volume":"308","author":"U. Abraham","year":"2003","unstructured":"Abraham, U.: Self-stabilizing timestamps. Theoretical Computer Science\u00a0308(1-3), 449\u2013515 (2003)","journal-title":"Theoretical Computer Science"},{"key":"10_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/978-3-642-24550-3_4","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"N. Alon","year":"2011","unstructured":"Alon, N., Attiya, H., Dolev, S., Dubois, S., Potop-Butucaru, M., Tixeuil, S.: Pragmatic Self-stabilization of Atomic Memory in Message-Passing Systems. In: D\u00e9fago, X., Petit, F., Villain, V. (eds.) SSS 2011. LNCS, vol.\u00a06976, pp. 19\u201331. Springer, Heidelberg (2011)"},{"key":"10_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/3-540-57271-6_35","volume-title":"Distributed Algorithms","author":"E. Anagnostou","year":"1993","unstructured":"Anagnostou, E., Hadzilacos, V.: Tolerating Transient and Permanent Failures (Extended Abstract). In: Schiper, A. (ed.) WDAG 1993. LNCS, vol.\u00a0725, pp. 174\u2013188. Springer, Heidelberg (1993)"},{"issue":"1","key":"10_CR4","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1145\/200836.200869","volume":"42","author":"H. Attiya","year":"1995","unstructured":"Attiya, H., Bar-Noy, A., Dolev, D.: Sharing memory robustly in message-passing systems. Journal of the ACM\u00a042(1), 124\u2013142 (1995)","journal-title":"Journal of the ACM"},{"issue":"11","key":"10_CR5","first-page":"1177","volume":"28","author":"J. Beauquier","year":"1997","unstructured":"Beauquier, J., Kekkonen-Moneta, S.: Fault-tolerance and self stabilization: impossibility results and solutions using self-stabilizing failure detectors. IJSS\u00a028(11), 1177\u20131187 (1997)","journal-title":"IJSS"},{"issue":"1","key":"10_CR6","first-page":"35","volume":"7","author":"J.E. Burns","year":"1993","unstructured":"Burns, J.E., Gouda, M.G., Miller, R.E.: Stabilization and pseudo-stabilization. DC\u00a07(1), 35\u201342 (1993)","journal-title":"DC"},{"issue":"1","key":"10_CR7","first-page":"45","volume":"70","author":"C. Delporte-Gallet","year":"2010","unstructured":"Delporte-Gallet, C., Devismes, S., Fauconnier, H.: Stabilizing leader election in partial synchronous systems with crash failures. JPDC\u00a070(1), 45\u201358 (2010)","journal-title":"JPDC"},{"issue":"11","key":"10_CR8","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1145\/361179.361202","volume":"17","author":"E.W. Dijkstra","year":"1974","unstructured":"Dijkstra, E.W.: Self-stabilizing systems in spite of distributed control. CACM\u00a017(11), 643\u2013644 (1974)","journal-title":"CACM"},{"issue":"2","key":"10_CR9","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1137\/S0097539790192647","volume":"26","author":"D. Dolev","year":"1997","unstructured":"Dolev, D., Shavit, N.: Bounded concurrent time-stamping. SIAM J. on Comp.\u00a026(2), 418\u2013455 (1997)","journal-title":"SIAM J. on Comp."},{"issue":"18","key":"10_CR10","doi-asserted-by":"publisher","first-page":"912","DOI":"10.1016\/j.ipl.2011.06.010","volume":"111","author":"S. Dolev","year":"2011","unstructured":"Dolev, S., Dubois, S., Potop-Butucaru, M., Tixeuil, S.: Stabilizing data-link over non-fifo channels with optimal fault-resilience. IPL\u00a0111(18), 912\u2013920 (2011)","journal-title":"IPL"},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/3-540-45438-1_5","volume-title":"Self-Stabilizing Systems","author":"S. Dolev","year":"2001","unstructured":"Dolev, S., Herman, T.: Dijkstra\u2019s Self-Stabilizing Algorithm in Unsupportive Environments. In: Datta, A.K., Herman, T. (eds.) WSS 2001. LNCS, vol.\u00a02194, pp. 67\u201381. Springer, Heidelberg (2001)"},{"issue":"4","key":"10_CR12","first-page":"424","volume":"8","author":"S. Dolev","year":"1997","unstructured":"Dolev, S., Israeli, A., Moran, S.: Uniform dynamic self-stabilizing leader election. IEEE TPDS\u00a08(4), 424\u2013440 (1997)","journal-title":"IEEE TPDS"},{"issue":"8","key":"10_CR13","first-page":"884","volume":"76","author":"S. Dolev","year":"2010","unstructured":"Dolev, S., Kat, R.I., Schiller, E.M.: When consensus meets self-stabilization. JCSC\u00a076(8), 884\u2013900 (2010)","journal-title":"JCSC"},{"issue":"1","key":"10_CR14","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/S0304-3975(98)00239-4","volume":"220","author":"A. Fekete","year":"1999","unstructured":"Fekete, A., Gupta, D., Luchangco, V., Lynch, N., Shvartsman, A.: Eventually-serializable data services. TCS\u00a0220(1), 113\u2013156 (1999)","journal-title":"TCS"},{"issue":"2","key":"10_CR15","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., Paterson, M.: Impossibility of distributed consensus with one faulty process. Journal of ACM\u00a032(2), 374\u2013382 (1985)","journal-title":"Journal of ACM"},{"key":"10_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/BFb0035176","volume-title":"Theory of Computing and Systems","author":"R. Gawlick","year":"1992","unstructured":"Gawlick, R., Lynch, N., Shavit, N.: Concurrent Timestamping Made Simple. In: Dolev, D., Rodeh, M., Galil, Z. (eds.) ISTCS 1992. LNCS, vol.\u00a0601, pp. 171\u2013183. Springer, Heidelberg (1992)"},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"Gopal, A.S., Perry, K.J.: Unifying self-stabilization and fault-tolerance (preliminary version). In: PODC 1993, pp. 195\u2013206 (1993)","DOI":"10.1145\/164051.164074"},{"issue":"4","key":"10_CR18","first-page":"205","volume":"6","author":"A. Israeli","year":"1993","unstructured":"Israeli, A., Li, M.: Bounded time-stamps. DC\u00a06(4), 205\u2013209 (1993)","journal-title":"DC"},{"key":"10_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-540-92295-7_41","volume-title":"Distributed Computing and Networking","author":"C. Johnen","year":"2008","unstructured":"Johnen, C., Higham, L.: Fault-Tolerant Implementations of Regular Registers by Safe Registers with Applications to Networks. In: Garg, V., Wattenhofer, R., Kothapalli, K. (eds.) ICDCN 2009. LNCS, vol.\u00a05408, pp. 337\u2013348. Springer, Heidelberg (2008)"},{"issue":"2","key":"10_CR20","first-page":"77","volume":"1","author":"L. Lamport","year":"1986","unstructured":"Lamport, L.: On interprocess communication. Part i: Basic formalism. DC\u00a01(2), 77\u201385 (1986)","journal-title":"DC"},{"issue":"2","key":"10_CR21","first-page":"86","volume":"1","author":"L. Lamport","year":"1986","unstructured":"Lamport, L.: On interprocess communication. Part ii: Algorithms. DC\u00a01(2), 86\u2013101 (1986)","journal-title":"DC"},{"key":"10_CR22","unstructured":"Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann Publishers Inc. (1996)"},{"key":"10_CR23","doi-asserted-by":"crossref","unstructured":"Serafini, M., Dobre, D., Majuntke, M., Bokor, P., Suri, N.: Eventually linearizable shared objects. In: PODC 2010, pp. 95\u2013104 (2010)","DOI":"10.1145\/1835698.1835723"}],"container-title":["Lecture Notes in Computer Science","Principles of Distributed Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-35476-2_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T21:30:42Z","timestamp":1558301442000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-35476-2_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642354755","9783642354762"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-35476-2_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}