H. Attiya, A. Bar-noy, and D. Dolev, Sharing memory robustly in message-passing systems, Journal of the ACM (JACM), pp.42-124, 1995.
DOI : 10.1145/200836.200869

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.1, p.43, 2012.

P. Berman, J. A. Garay, P. , and K. J. , Towards optimal distributed consensus (extended abstract), 30th Annual Symposium on Foundations of Computer Science, pp.410-415, 1989.
DOI : 10.1109/sfcs.1989.63511

F. Bonnet, X. Défago, T. D. Nguyen, and M. Potop-butucaru, Tight bound on mobile byzantine agreement, 361. Available from, 2016.
DOI : 10.1016/j.tcs.2015.10.019
URL : https://hal.archives-ouvertes.fr/hal-01340236

S. Bonomi, A. Del-pozzo, and M. Potop-butucaru, Tight selfstabilizing mobile byzantine-tolerant atomic register, Proceedings of the 17th International Conference on Distributed Computing and Networking, pp.1-6, 2016.
DOI : 10.1145/2833312.2833320
URL : https://hal.archives-ouvertes.fr/hal-01340261

S. Bonomi, A. D. Pozzo, M. Potop-butucaru, and S. Tixeuil, Approximate agreement under mobile byzantine faults Available from: http, 36th IEEE International Conference on Distributed Computing Systems, ICDCS 2016, pp.727-728, 2016.
DOI : 10.1109/icdcs.2016.68
URL : http://arxiv.org/pdf/1604.03871

S. Bonomi, A. D. Pozzo, M. Potop-butucaru, and S. Tixeuil, Optimal Mobile Byzantine Fault Tolerant Distributed Storage, Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, PODC '16, 2016.
DOI : 10.1145/98163.98167
URL : https://hal.archives-ouvertes.fr/hal-01349064

Z. Bouzid, M. G. Potop-butucaru, and S. Tixeuil, Byzantine Convergence in Robot Networks: The Price of Asynchrony, Principles of Distributed Systems, 13th International Conference, pp.54-70978, 2009.
DOI : 10.1007/978-3-642-10877-8_7

Z. Bouzid, M. G. Potop-butucaru, and S. Tixeuil, Optimal Byzantine-resilient convergence in uni-dimensional robot networks, Theoretical Computer Science, vol.411, issue.34-36, p.3154, 2010.
DOI : 10.1016/j.tcs.2010.05.006
URL : https://doi.org/10.1016/j.tcs.2010.05.006

H. Buhrman, J. A. Garay, and J. 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

C. Cachin and S. Tessaro, Optimal resilience for erasure-coded byzantine distributed storage, International Conference on Dependable Systems and Networks (DSN'06), pp.115-124, 2006.
DOI : 10.1109/dsn.2006.56
URL : http://www.ssrc.ucsc.edu/PaperArchive/cachin-dsn06.pdf

B. Charron-bost, M. Függer, and T. Nowak, Approximate Consensus in Highly Dynamic Networks: The Role of Averaging Algorithms, Automata, Languages, and Programming -42nd International Colloquium, ICALP 2015 Proceedings, Part II, pp.528-539, 2015.
DOI : 10.1007/978-3-662-47666-6_42
URL : https://hal.archives-ouvertes.fr/hal-01107422

D. E. Denning, An intrusion-detection model, IEEE Transactions on software engineering, p.222, 1987.

D. Dolev, N. A. Lynch, S. S. Pinter, E. W. Stark, and W. Weihl, Reaching approximate agreement in the presence of faults, Journal of the ACM (JACM), pp.33-499, 1986.

S. Dolev, Self Stabilization, Journal of Aerospace Computing, Information, and Communication, vol.1, issue.6, 2000.
DOI : 10.1038/scientificamerican0603-54
URL : https://hal.archives-ouvertes.fr/inria-00627780

A. Fekete, Asymptotically optimal algorithms for approximate agreement, Distributed Computing, vol.27, issue.2, p.9, 1990.
DOI : 10.1007/BF01783662

A. Fekete, Asynchronous Approximate Agreement, Information and Computation, vol.115, issue.1, p.95, 1994.
DOI : 10.1006/inco.1994.1094
URL : https://doi.org/10.1006/inco.1994.1094

M. J. Fischer, N. A. Lynch, and M. Merritt, Easy impossibility proofs for distributed consensus problems, Distributed Computing, vol.27, issue.3, p.26, 1986.
DOI : 10.1007/BF01843568

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

R. M. Kieckhafer and M. H. Azadmanesh, Reaching approximate agreement with mixed-mode faults. Parallel and Distributed Systems, IEEE Transactions on, vol.5, p.53, 1994.
DOI : 10.1109/71.262588

L. Lamport, On interprocess communication. Distributed computing, p.86, 1986.
DOI : 10.1007/bf01786227

L. Lamport, On interprocess communication, Distributed Computing, vol.21, issue.2, p.77, 1986.
DOI : 10.1007/3-540-10235-3

L. Lamport, On interprocess communication. part ii, Algorithms. DC, vol.1, p.86, 1986.
DOI : 10.1007/bf01786227

L. Lamport, R. Shostak, and M. Pease, The Byzantine Generals Problem, ACM Transactions on Programming Languages and Systems, vol.4, issue.3, p.382, 1982.
DOI : 10.1145/357172.357176

C. Li, M. Hurfin, W. , and Y. , Approximate Byzantine consensus in sparse, mobile ad-hoc networks, Journal of Parallel and Distributed Computing, vol.74, issue.9, pp.74-2860, 2014.
DOI : 10.1016/j.jpdc.2014.05.005
URL : https://hal.archives-ouvertes.fr/hal-01083553

N. A. Lynch, Distributed Algorithms, 1996.

N. A. Lynch and A. A. Shvartsman, Robust emulation of shared memory using dynamic quorum-acknowledged broadcasts, Proceedings of IEEE 27th International Symposium on Fault Tolerant Computing, pp.272-281, 1997.
DOI : 10.1109/FTCS.1997.614100
URL : http://theory.lcs.mit.edu/tds/papers/Lynch/FTCS97.ps.gz

N. A. Lynch and M. R. Tuttle, An introduction to input/output automata Available from, CWI Quarterly, vol.2, issue.219, 1989.

D. Malkhi and M. K. Reiter, Secure and scalable replication in Phalanx, Proceedings Seventeenth IEEE Symposium on Reliable Distributed Systems (Cat. No.98CB36281), pp.51-58, 1998.
DOI : 10.1109/RELDIS.1998.740474
URL : http://www.research.att.com/~dalia/././pubs/srds-system.ps.gz

J. Martin, L. Alvisi, and M. Dahlin, Minimal Byzantine Storage, International Symposium on Distributed Computing, pp.311-325, 2002.
DOI : 10.1007/3-540-36108-1_21

H. Mendes and M. Herlihy, Multidimensional approximate agreement in Byzantine asynchronous systems, Proceedings of the 45th annual ACM symposium on Symposium on theory of computing, STOC '13, pp.391-400, 2013.
DOI : 10.1145/2488608.2488657

H. Mendes, M. Herlihy, N. H. Vaidya, and V. K. Garg, Multidimensional agreement in Byzantine systems, Distributed Computing, vol.1, issue.1, pp.28-423, 2015.
DOI : 10.1145/2484239.2484256

R. Ostrovsky and M. Yung, How to withstand mobile virus attacks, Proceedings of the tenth annual ACM symposium on Principles of distributed computing, pp.51-59, 1991.

E. Pierce and L. Alvisi, A recipe for atomic semantics for byzantine quorum systems, Tech. rep, 2000.

M. Platania, D. Obenshain, T. Tantillo, R. Sharma, and Y. Amir, Towards a Practical Survivable Intrusion Tolerant Replication System, 2014 IEEE 33rd International Symposium on Reliable Distributed Systems, pp.242-252, 2014.
DOI : 10.1109/SRDS.2014.16
URL : http://www.cnds.jhu.edu/pub/papers/cnds-2014-1.pdf

R. Reischuk, A new solution for the Byzantine generals problem, Information and Control, vol.64, issue.1-3, p.23, 1985.
DOI : 10.1016/S0019-9958(85)80042-5

T. Sasaki, Y. Yamauchi, S. Kijima, and M. Yamashita, Mobile Byzantine Agreement on Arbitrary Network, International Conference On Principles Of Distributed Systems, pp.236-250, 2013.
DOI : 10.1007/978-3-319-03850-6_17

I. G. Services, Improving systems availability, Tech. rep., IBM Global Services, 1998.

P. Sousa, A. N. Bessani, M. Correia, N. F. Neves, and P. Verissimo, Highly Available Intrusion-Tolerant Services with Proactive-Reactive Recovery, IEEE Transactions on Parallel and Distributed Systems, vol.21, issue.4, p.452, 2009.
DOI : 10.1109/TPDS.2009.83
URL : http://www.di.fc.ul.pt/~nuno/PAPERS/TPDS09.pdf

P. Sousa, N. F. Neves, and P. Verissimo, How Resilient are Distributed f Fault/Intrusion-Tolerant Systems?, 2005 International Conference on Dependable Systems and Networks (DSN'05), pp.98-107, 2005.
DOI : 10.1109/DSN.2005.55
URL : http://www.di.fc.ul.pt/~nuno/PAPERS/DSN05.pdf

P. Sousa, N. F. Neves, and P. Verissimo, Hidden problems of asynchronous proactive recovery, Proc. of the Workshop on Hot Topics in System Dependability (HotDep'07), 2007.

D. Stolz and R. Wattenhofer, Byzantine approximate agreement with median validity, to appear OPODIS'15, 2015.

L. Su and N. H. Vaidya, Reaching approximate byzantine consensus with multi-hop communication, Stabilization, Safety, and Security of Distributed Systems -17th International Symposium, SSS 2015 Proceedings, pp.21-35, 2015.
DOI : 10.1007/978-3-319-21741-3_2
URL : http://arxiv.org/pdf/1411.5282.pdf

L. Tseng and N. H. Vaidya, Iterative approximate byzantine consensus under a generalized fault model, Distributed Computing and Networking, 14th International Conference, pp.72-86, 2013.
DOI : 10.1007/978-3-642-35668-1_6
URL : http://arxiv.org/pdf/1205.4809.pdf

L. Tseng and N. H. Vaidya, Asynchronous convex hull consensus in the presence of crash faults, Proceedings of the 2014 ACM symposium on Principles of distributed computing, PODC '14, pp.396-405, 2014.
DOI : 10.1145/2611462.2611470

L. Tseng and N. H. Vaidya, Iterative Approximate Consensus in the Presence of Byzantine Link Failures, Networked Systems -Second International Conference, NETYS 2014, pp.84-98, 2014.
DOI : 10.1007/978-3-319-09581-3_7

N. H. Vaidya, L. Tseng, and G. Liang, Iterative approximate byzantine consensus in arbitrary directed graphs, Proceedings of the 2012 ACM symposium on Principles of distributed computing, PODC '12, pp.365-374, 2012.
DOI : 10.1145/2332432.2332505
URL : http://arxiv.org/pdf/1201.4183.pdf

P. M. Vitanyi and B. Awerbuch, Atomic shared register access by asynchronous hardware, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986), pp.233-243, 1986.
DOI : 10.1109/SFCS.1986.11
URL : http://www.cwi.nl/%7Epaulv/papers/asynchhardware.pdf

M. Yung and . The, Mobile Adversary Paradigm in Distributed Computation and Systems Available from, PODC, pp.171-172, 2015.
DOI : 10.1145/2767386.2767453