{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,4]],"date-time":"2026-10-04T19:59:26Z","timestamp":1791143966168,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540363217","type":"print"},{"value":"9783540363224","type":"electronic"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11795490_8","type":"book-chapter","created":{"date-parts":[[2007,1,23]],"date-time":"2007-01-23T12:25:18Z","timestamp":1169555118000},"page":"73-87","source":"Crossref","is-referenced-by-count":13,"title":["Two Abstractions for Implementing Atomic Objects in Dynamic Systems"],"prefix":"10.1007","author":[{"given":"Roy","family":"Friedman","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michel","family":"Raynal","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Corentin","family":"Travers","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"2","key":"8_CR1","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1145\/992287.992298","volume":"35","author":"M.K. Aguilera","year":"2004","unstructured":"Aguilera, M.K.: A Pleasant Stroll Through the Land of Infinitely Many Creatures. ACM SIGACT News, Distributed Computing Column\u00a035(2), 36\u201359 (2004)","journal-title":"ACM SIGACT News, Distributed Computing Column"},{"key":"8_CR2","first-page":"315","volume-title":"Proc. 21th ACM PODC","author":"M.K. Aguilera","year":"2003","unstructured":"Aguilera, M.K., Gafni, E.: On Using Network Attached Disks as Shared Memory. In: Proc. 21th ACM PODC, pp. 315\u2013324. ACM Press, New York (2003)"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Alvisi, L., Malkhi, D., Pierce, E., Reiter, M., Wright, R.N.: Dynamic Byzantine Quorum Systems. In: Proc. IEEE Conf. on Depend. Syst. and Networks (DSN 2000), pp. 283\u2013392 (2000)","DOI":"10.1109\/ICDSN.2000.857551"},{"key":"8_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1445","DOI":"10.1007\/978-3-540-30469-2_39","volume-title":"On the Move to Meaningful Internet Systems 2004: CoopIS, DOA, and ODBASE","author":"E. Anceaume","year":"2004","unstructured":"Anceaume, E., Friedman, R., Gradinariu, M., Roy, M.: An Architecture for Dynamic Scalable Self-managed Transactions. In: Meersman, R., Tari, Z. (eds.) OTM 2004. LNCS, vol.\u00a03291, pp. 1445\u20131462. Springer, Heidelberg (2004)"},{"issue":"1","key":"8_CR5","doi-asserted-by":"publisher","first-page":"121","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), 121\u2013132 (1995)","journal-title":"Journal of the ACM"},{"issue":"2","key":"8_CR6","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1145\/226643.226647","volume":"43","author":"T.D. Chandra","year":"1996","unstructured":"Chandra, T.D., Toueg, S.: Unreliable Failure Detectors for Reliable Distributed Systems. Journal of the ACM\u00a043(2), 225\u2013267 (1996)","journal-title":"Journal of the ACM"},{"key":"8_CR7","unstructured":"Delporte-Gallet, C., Fauconnier, H., Guerraoui, R.: Shared memory vs Message Passing. Tech Report IC\/2003\/77, EPFL, Lausanne (December 2003)"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Delporte-Gallet, C., Fauconnier, H., Guerraoui, R., Hadzilacos, V., Kouznetsov, P., Toueg, S.: The Weakest Failure Detectors to Solve Certain Fundamental Problems in Distributed Computing. In: Proc. 23rd ACM PODC, pp. 338\u2013346 (2004)","DOI":"10.1145\/1011767.1011818"},{"key":"8_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1007\/3-540-44681-8_70","volume-title":"Euro-Par 2001 Parallel Processing","author":"P. Ezhilchelvan","year":"2001","unstructured":"Ezhilchelvan, P., Helary, J.-M., Raynal, M.: Building TMR-Based Reliable Servers Despite Bounded Input Lifetime. In: Sakellariou, R., Keane, J.A., Gurd, J.R., Freeman, L. (eds.) Euro-Par 2001. LNCS, vol.\u00a02150, pp. 482\u2013485. Springer, Heidelberg (2001)"},{"key":"8_CR10","unstructured":"Friedman, R.: Using Virtual Synchrony to Develop Efficient Fault Tolerant Distributed Shared Memories. Technical Report 95-1506, Dept. of Computer Science, Cornell University (1995)"},{"key":"8_CR11","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.ipl.2004.12.011","volume":"94","author":"R. Friedman","year":"2005","unstructured":"Friedman, R., Mostefaoui, A., Raynal, M.: Asynchronous Bounded Lifetime Failure Detectors. Information Processing Letters\u00a094, 85\u201391 (2005)","journal-title":"Information Processing Letters"},{"key":"8_CR12","first-page":"1","volume-title":"Proc. SRDS 2004 IEEE satellite Workshop on Dependable Distributed Data Management (WDDDM 2004)","author":"R. Friedman","year":"2004","unstructured":"Friedman, R., Raynal, M.: On the Benefits of the Functional Modular Approach in Distributed Data Management Systems. In: Proc. SRDS 2004 IEEE satellite Workshop on Dependable Distributed Data Management (WDDDM 2004), pp. 1\u20136. IEEE Computer Society Press, Los Alamitos (2004)"},{"key":"8_CR13","unstructured":"Friedman, R., Raynal, M., Travers, C.: Two Abstractions for Implementing Atomic Objects in Dynamic Systems. Tech. Report #1692, IRISA, University of Rennes 1 (France) (2005)"},{"issue":"4","key":"8_CR14","doi-asserted-by":"publisher","first-page":"841","DOI":"10.1145\/4221.4223","volume":"32","author":"H. Garcia-Molina","year":"1985","unstructured":"Garcia-Molina, H., Barbara, D.: How to Assign Votes in a Distributed System. Journal of the ACM\u00a032(4), 841\u2013860 (1985)","journal-title":"Journal of the ACM"},{"key":"8_CR15","first-page":"150","volume-title":"Proc. 7th ACM Symposium on Operating Systems Principles (SOSP 1979)","author":"D.K. Gifford","year":"1979","unstructured":"Gifford, D.K.: Weighted Voting for Replicated Data. In: Proc. 7th ACM Symposium on Operating Systems Principles (SOSP 1979), pp. 150\u2013162. ACM Press, New York (1979)"},{"key":"8_CR16","unstructured":"Guerraoui, R., Raynal, M.: Fault-Tolerance Techniques for Concurrent Objects. Tech Report # 1667, 22 pages, IRISA, Universit\u00e9 de Rennes 1 (France) (December 2004)"},{"key":"8_CR17","first-page":"97","volume-title":"Distributed Systems","author":"V. Hadzilacos","year":"1993","unstructured":"Hadzilacos, V., Toueg, S.: Reliable Broadcast and Related Problems. In: Mullender, S. (ed.) Distributed Systems, pp. 97\u2013145. ACM Press, New York (1993)"},{"issue":"2","key":"8_CR18","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1006\/jcss.2001.1819","volume":"64","author":"J.-M. Helary","year":"2002","unstructured":"Helary, J.-M., Mostefaoui, A., Raynal, M.: Interval Consistency of Asynchronous Distributed Computations. Journal of Computer and System Sciences\u00a064(2), 329\u2013349 (2002)","journal-title":"Journal of Computer and System Sciences"},{"issue":"2","key":"8_CR19","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1145\/22952.22953","volume":"12","author":"M.P. Herlihy","year":"1987","unstructured":"Herlihy, M.P.: Dynamic Quorum Adjustment for Partitioned Data. ACM Transactions on Database Systems\u00a012(2), 170\u2013194 (1987)","journal-title":"ACM Transactions on Database Systems"},{"issue":"1","key":"8_CR20","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1145\/114005.102808","volume":"13","author":"M.P. Herlihy","year":"1991","unstructured":"Herlihy, M.P.: Wait-Free Synchronization. ACM TOPLAS\u00a013(1), 124\u2013149 (1991)","journal-title":"ACM TOPLAS"},{"issue":"3","key":"8_CR21","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/78969.78972","volume":"12","author":"M.P. Herlihy","year":"1990","unstructured":"Herlihy, M.P., Wing, J.L.: Linearizability: a Correctness Condition for Concurrent Objects. ACM Transactions on Programming Languages and Systems\u00a012(3), 463\u2013492 (1990)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"7","key":"8_CR22","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1145\/359545.359563","volume":"21","author":"L. Lamport","year":"1978","unstructured":"Lamport, L.: Time, Clocks and the Ordering of Events in a Distributed System. Communications of the ACM\u00a021(7), 558\u2013565 (1978)","journal-title":"Communications of the ACM"},{"issue":"2","key":"8_CR23","first-page":"87","volume":"1-2","author":"L. Lamport","year":"1986","unstructured":"Lamport, L.: On Interprocess communication. Part I: Formalism. Part II: Algorithms. Distributed Computing\u00a01-2(2), 87\u2013103 (1986)","journal-title":"Distributed Computing"},{"key":"8_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/3-540-36108-1_12","volume-title":"Distributed Computing","author":"N.A. Lynch","year":"2002","unstructured":"Lynch, N.A., Shvartsman, A.A.: Rambo: a Reconfigurable Atomic Memory Service for Dynamic Networks. In: Malkhi, D. (ed.) DISC 2002. LNCS, vol.\u00a02508, pp. 173\u2013190. Springer, Heidelberg (2002)"},{"issue":"4","key":"8_CR25","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s004460050050","volume":"11","author":"D. Malkhi","year":"1998","unstructured":"Malkhi, D., Reiter, M.: Byzantine Quorums Systems. Dist. Comp.\u00a011(4), 203\u2013213 (1998)","journal-title":"Dist. Comp."},{"key":"8_CR26","doi-asserted-by":"crossref","unstructured":"Martin, J.-P., Alvisi, L.: A Framework for Dynamic Byzantine Storage. In: Proc. IEEE Conf. on Dependable Systems and Networks (DSN 2004), pp. 325\u2013334 (2004)","DOI":"10.1109\/DSN.2004.1311902"},{"key":"8_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/3-540-40026-5_11","volume-title":"Distributed Computing","author":"M. Merritt","year":"2000","unstructured":"Merritt, M., Taubenfeld, G.: Computing Using Infinitely Many Processes. In: Herlihy, M.P. (ed.) DISC 2000. LNCS, vol.\u00a01914, pp. 164\u2013178. Springer, Heidelberg (2000)"},{"key":"8_CR28","first-page":"161","volume-title":"Proc. ACM SIGCOMM Conf. on Applications, Technologies, Architectures, and Protocols for Computer Communication","author":"S. Ratnasamy","year":"2001","unstructured":"Ratnasamy, S., Handley, M., Francis, P., Karp, R.: A Scalable content-Addressable Network. In: Proc. ACM SIGCOMM Conf. on Applications, Technologies, Architectures, and Protocols for Computer Communication, pp. 161\u2013172. ACM Press, New York (2001)"},{"key":"8_CR29","first-page":"386","volume-title":"Proc. 24th ACM PODC","author":"R.. Rodrigues","year":"2004","unstructured":"Rodrigues, R., Liskov, B.: Reconfigurable Byzantine Fault-tolerant Atomic Memory. In: Proc. 24th ACM PODC, p. 386. ACM Press, New York (2004)"},{"key":"8_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/3-540-45518-3_18","volume-title":"Middleware 2001","author":"A. Rowstron","year":"2001","unstructured":"Rowstron, A., Druschel, P.: Pastry: Scalable, Distributed Object Location and Routing for Large Scale peer-to-Peer Systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol.\u00a02218, pp. 329\u2013350. Springer, Heidelberg (2001)"},{"issue":"1","key":"8_CR31","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1109\/TNET.2002.808407","volume":"11","author":"I. Stoica","year":"2003","unstructured":"Stoica, I., Morris, R., Liben-Nowell, D., Karger, D., Kaashoek, M.F., Dabek, F., Balakrishnan, H.: Chord: A Scalable Peer-to-Peer Lookup Protocol for Internet Applications. ACM\/IEEE Transactions on Networking\u00a011(1), 17\u201332 (2003)","journal-title":"ACM\/IEEE Transactions on Networking"},{"issue":"2","key":"8_CR32","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1145\/320071.320076","volume":"4","author":"R.H. Thomas","year":"1979","unstructured":"Thomas, R.H.: A Majority Consensus Approach to Concurrency Control for Multiple Copy Database. ACM Transactions on Database Systems\u00a04(2), 180\u2013229 (1979)","journal-title":"ACM Transactions on Database Systems"},{"key":"8_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-540-39989-6_7","volume-title":"Distributed Computing","author":"R. Vitenberg","year":"2003","unstructured":"Vitenberg, R., Friedman, R.: On the Locality of Consistency Conditions. In: Fich, F.E. (ed.) DISC 2003. LNCS, vol.\u00a02848, pp. 92\u2013105. Springer, Heidelberg (2003)"},{"key":"8_CR34","unstructured":"Zhao, B., Kubiatowicz, J., Joseph, A.: Tapestry: An Infrastructure for Fault-Tolerant Wide-area Location and Routing. Technical Report UCB\/CSD-01-1141, U.C. Berkeley (2001)"}],"container-title":["Lecture Notes in Computer Science","Principles of Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11795490_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,12]],"date-time":"2019-03-12T03:10:00Z","timestamp":1552360200000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11795490_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540363217","9783540363224"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/11795490_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}