Certified Impossibility Results and Analyses in Coq of Some Randomised Distributed Algorithms
Allyx Fontaine
(1, 2)
,
Akka Zemmari
(3)
Allyx Fontaine
- Fonction : Auteur
- PersonId : 13898
- IdHAL : allyx
- ORCID : 0009-0006-8926-5153
- IdRef : 183380533
Résumé
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.
Domaines
Informatique [cs]Format du dépôt | Notice |
---|---|
Type de dépôt | Communication dans un congrès |
Titre |
en
Certified Impossibility Results and Analyses in Coq of Some Randomised Distributed Algorithms
|
Résumé |
en
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.
|
Auteur(s) |
Allyx Fontaine
1, 2
, Akka Zemmari
3
1
UG -
Université de Guyane
( 424370 )
- Campus de Troubiran - BP 20792- 97337 Cayenne Cedex - Guyane
- Guyane française
2
UMR 228 Espace-Dev, Espace pour le développement
( 196623 )
- IRD - Maison de la Télédétection - 500 rue Jean-François Breton - 34093 Montpellier
- France
3
LaBRI -
Laboratoire Bordelais de Recherche en Informatique
( 3102 )
- Domaine Universitaire 351, cours de la Libération 33405 Talence Cedex
- France
|
Langue du document |
Anglais
|
Date de production/écriture |
2016-10-24
|
Source |
Lecture Notes in Computer Science (LNCS)
|
Vulgarisation |
Non
|
Comité de lecture |
Oui
|
Invité |
Non
|
Audience |
Internationale
|
Actes |
Oui
|
Date de publication |
2016-09-22
|
Titre de la collection |
International Colloquium on Theoretical Aspects of Computing
|
Volume |
9965
|
Page/Identifiant |
69-81
|
Titre du congrès |
13th International Colloquium on Theoretical Aspects of Computing
|
Date début congrès |
2016-10-24
|
Date fin congrès |
2016-10-30
|
Ville |
Taipei
|
Pays |
Taïwan
|
Domaine(s) |
|
Éditeur commercial |
|
Mots-clés |
en
Randomized Algorithms, Distributed Algorithms, Coq
|
DOI | 10.1007/978-3-319-46750-4_5 |
Loading...