Gracefully degrading consensus and k-set agreement in directed dynamic networks, Theor. Comput. Sci, vol.726, pp.41-77, 2018. ,
Formal verification of consensus algorithms tolerating malicious faults, 2011. ,
URL : https://hal.archives-ouvertes.fr/hal-00639048
, LNCS, vol.6976, pp.120-134, 2011.
Approximate consensus in highly dynamic networks: the role of averaging algorithms, ICALP 2015, vol.9135, pp.528-539, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-01107422
The heard-of model: computing in distributed systems with benign faults, Distrib. Comput, vol.22, issue.1, pp.49-71, 2009. ,
A characterization of oblivious message adversaries for which consensus is solvable, Theor. Comput. Sci, vol.584, pp.80-90, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-01198794
PSync: a partially synchronous language for fault-tolerant distributed algorithms, SIGPLAN Not, vol.51, issue.1, pp.400-415, 2016. ,
Decomposition of distributed programs into communicationclosedlayers, Sci. Comput. Program, vol.2, issue.3, pp.90013-90021, 1982. ,
Round-by-round fault detectors (extended abstract): unifying synchrony and asynchrony, 17th ACM Symposium on Principles of Distributed Computing, PODC 1998, pp.143-152, 1998. ,
Cutoff bounds for consensus algorithms, CAV 2017, vol.10427, pp.217-237 ,
, , 2017.
Topological characterization of consensus under general message adversaries, 2019 ACM Symposium on Principles of Distributed Computing, PODC 2019, 2019. ,
Time is not a healer, STACS 1989, vol.349, pp.304-313, 1989. ,
Characterizing asynchronous message-passing models through rounds, 22nd International Conference on Principles of Distributed Systems (OPODIS 2018), p.18, 2018. ,
Derivation of heard-of predicates from elementary behavioral patterns, 2020. ,
URL : https://hal.archives-ouvertes.fr/hal-02947787