Y. Afek, H. Attiya, D. Dolev, E. Gafni, M. Merritt et al., Atomic snapshots of 125 shared memory, J. ACM, vol.40, issue.4, pp.873-890, 1993.

M. K. Aguilera, I. Keidar, D. Malkhi, and A. Shraer, Dynamic atomic storage without 127 consensus, J. ACM, vol.58, issue.2, 2011.

E. Alchieri, A. Bessani, F. Greve, and J. Da-silva-fraga, Efficient and modular consensus-129 free reconfiguration for fault-tolerant storage, 21st International Conference on Princi-130 ples of Distributed Systems, vol.26, p.17, 2017.

J. Aspnes, H. Attiya, and K. Censor, Max registers, counters, and monotone circuits, 133 ACM Symposium on Principles of Distributed Computing, PODC, pp.36-45, 2009.

J. Aspnes and F. Ellen, Tight bounds for adopt-commit objects. Theory of Computing 135 Systems, vol.55, pp.451-474, 2014.

H. Attiya, A. Bar-noy, and D. Dolev, Sharing memory robustly in message passing systems

J. Acm, , vol.42, pp.124-142, 1995.

H. Attiya, H. C. Chung, F. Ellen, S. Kumar, and J. L. Welch, Emulating a shared register 139 in a system that never stops changing, IEEE Trans. Parallel Distrib. Syst, vol.30, issue.3, p.140

H. Attiya, M. Herlihy, and O. Rachman, Atomic snapshots using lattice agreement. Dis-142 tributed Computing, vol.8, pp.121-132, 1995.

R. Baldoni, S. Bonomi, A. Kermarrec, and M. Raynal, Implementing a register in a dynamic 144 distributed system, ICDCS, pp.639-647, 2009.

P. Berman and A. A. Bharali, Quick atomic broadcast, vol.93, p.146

C. Cachin, R. Guerraoui, and L. Rodrigues, Introduction to reliable and secure distributed 147 programming, 2011.

A. Castañeda, S. Rajsbaum, and M. Raynal, Unifying concurrent objects and distributed 149 tasks: Interval-linearizability, J. ACM, vol.65, issue.6, 2018.

M. Castro and B. Liskov, Practical byzantine fault tolerance and proactive recovery, ACM 151 Transactions on Computer Systems (TOCS), vol.20, issue.4, pp.398-461, 2002.

G. V. Chockler, R. Guerraoui, I. Keidar, and M. Vukolic, Reliable distributed storage, 153 IEEE Computer, vol.42, issue.4, pp.60-67, 2009.

J. Faleiro, S. Rajamani, K. Rajan, G. Ramalingam, and K. Vaswani, Generalized lattice 155 agreement, PODC, pp.125-134, 2012.

M. J. Fischer, N. A. Lynch, and M. S. Paterson, Impossibility of distributed consensus 157 with one faulty process, J. ACM, vol.32, issue.2, pp.374-382, 1985.

E. Gafni, Round-by-round fault detectors (extended abstract): Unifying synchrony and 159 asynchrony, PODC, 1998.

E. Gafni and D. Malkhi, Elastic configuration maintenance via a parsimonious speculating 161 snapshot solution, DISC, pp.140-153, 2015.

D. K. Gifford, Weighted voting for replicated data, SOSP, p.163, 1979.

S. Gilbert, N. A. Lynch, and A. A. Shvartsman, Rambo: a robust, reconfigurable atomic 164 memory service for dynamic networks, ACM Trans. Program. Lang. Syst, vol.23, issue.4, pp.463-492, 1990.

L. Jehl, R. Vitenberg, and H. Meling, Smartmerge: A new approach to reconfiguration for 169 atomic storage, DISC, pp.154-169, 2015.

L. Lamport, The Part-Time parliament, ACM Transactions on Computer Systems, vol.171, issue.2, pp.133-169, 1998.

L. Lamport, D. Malkhi, and L. Zhou, Reconfiguring a state machine, SIGACT News, vol.173, issue.1, pp.63-73, 2010.

M. Perrin, Concurrency and consistency, Distributed Systems, p.175, 2017.

F. B. Schneider, Implementing fault-tolerant services using the state machine approach: A 176 tutorial, ACM Computing Surveys, vol.22, issue.4, pp.299-319, 1990.

M. Shapiro, N. M. Preguiça, C. Baquero, and M. Zawirski, Conflict-free replicated data 178 types, SSS, pp.386-400, 2011.

J. Skrzypczak, F. Schintke, and T. Schütt, Linearizable state machine replication of state-180 based crdts without logs, 2019.

A. Spiegelman, I. Keidar, and D. Malkhi, Dynamic reconfiguration: Abstraction and 182 optimal asynchronous solution, DISC, vol.40, 2017.