N. Alon, H. Attiya, S. Dolev, S. Dubois, M. Potop-butucaru et al., Practically stabilizing SWMR atomic memory in message-passing systems, Journal of Computer and System Sciences, vol.81, issue.4, pp.692-701, 2015.
DOI : 10.1016/j.jcss.2014.11.014
URL : https://hal.archives-ouvertes.fr/hal-01123697

N. Banu, S. Souissi, T. Izumi, and K. Wada, An improved byzantine agreement algorithm for synchronous systems with mobile faults, International Journal of Computer Applications, vol.43, issue.22, pp.1-7, 2012.

R. A. Bazzi, Synchronous Byzantine quorum systems, Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing , PODC '97, pp.45-52, 2000.
DOI : 10.1145/259380.259454
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.140.8575

F. Bonnet, X. Défago, T. D. Nguyen, and M. Potop-butucaru, Tight bound on mobile byzantine agreement, Distributed Computing -28th International Symposium, DISC 2014 Proceedings. pp, pp.76-90, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01340236

S. Bonomi, M. Potop-butucaru, and S. Tixeuil, Byzantine tolerant storage, In: IEEE IPDPS, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01206290

H. Buhrman, J. A. Garay, and J. H. Hoepman, Optimal resiliency against mobile faults, Twenty-Fifth International Symposium on Fault-Tolerant Computing. Digest of Papers, pp.83-88, 1995.
DOI : 10.1109/FTCS.1995.466995

S. Dolev, S. Dubois, M. G. Potop-butucaru, and S. Tixeuil, Crash resilient and pseudostabilizing atomic registers, pp.135-150, 2012.
DOI : 10.1007/978-3-642-35476-2_10
URL : https://hal.archives-ouvertes.fr/hal-00934144

J. A. Garay, Reaching (and maintaining) agreement in the presence of mobile faults, Proceedings of the 8th International Workshop on Distributed Algorithms, pp.253-264, 1994.
DOI : 10.1007/BFb0020438

L. Lamport, On interprocess communication, Distributed Computing, vol.21, issue.2, pp.77-85, 1986.
DOI : 10.1007/BF01786227
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.33.1038

D. Malkhi and M. Reiter, Byzantine quorum systems, Distributed Computing, vol.11, issue.4, pp.203-213, 1998.
DOI : 10.1007/s004460050050
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.113.7381

J. P. Martin, L. Alvisi, and M. Dahlin, Minimal Byzantine Storage, Proceedings of the 16th International Conference on Distributed Computing. pp. 311?325. DISC '02, 2002.
DOI : 10.1007/3-540-36108-1_21
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.12.6445

R. Ostrovsky and M. Yung, How to withstand mobile virus attacks (extended abstract), Proceedings of the tenth annual ACM symposium on Principles of distributed computing , PODC '91, pp.51-59, 1991.
DOI : 10.1145/112600.112605

R. Reischuk, A new solution for the byzantine generals problem, Information and Control, vol.6413, pp.23-42, 1985.

T. Sasaki, Y. Yamauchi, S. Kijima, and M. Yamashita, Mobile Byzantine Agreement on Arbitrary Network, Proceedings of the 17th International Conference on Principles of Distributed Systems (OPODIS'13, pp.236-250, 2013.
DOI : 10.1007/978-3-319-03850-6_17

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