Certified Impossibility Results and Analyses in Coq of Some Randomised Distributed Algorithms

Abstract : Randomised algorithms are generally simple to formulate. However, their analysis can become very complex, especially in the field of distributed computing. In this paper, we formally model in Coq a class of randomised distributed algorithms. We develop some tools to help proving impossibility results about classical problems and analysing this class of algorithms. As case studies, we examine the handshake and maximal matching problems. We show how to use our tools to formally prove properties about algorithms solving those problems.
Type de document :
Communication dans un congrès
13th International Colloquium on Theoretical Aspects of Computing, Oct 2016, Taipei, Taiwan. Springer, Lecture Notes in Computer Science (LNCS), 9965, pp.69-81, 2016, International Colloquium on Theoretical Aspects of Computing. 〈10.1007/978-3-319-46750-4_5〉
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01463441
Contributeur : Akka Zemmari <>
Soumis le : jeudi 9 février 2017 - 15:35:03
Dernière modification le : mercredi 10 octobre 2018 - 10:09:40

Identifiants

Citation

Allyx Fontaine, Akka Zemmari. Certified Impossibility Results and Analyses in Coq of Some Randomised Distributed Algorithms. 13th International Colloquium on Theoretical Aspects of Computing, Oct 2016, Taipei, Taiwan. Springer, Lecture Notes in Computer Science (LNCS), 9965, pp.69-81, 2016, International Colloquium on Theoretical Aspects of Computing. 〈10.1007/978-3-319-46750-4_5〉. 〈hal-01463441〉

Partager

Métriques

Consultations de la notice

84