Certified Impossibility Results and Analyses in Coq of Some Randomised Distributed Algorithms - HAL Accéder directement au contenu
Communication dans un congrès Année : 2016

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

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.
Loading...
Fichier non déposé

Dates et versions

hal-01463441, version 1 (09-02-2017)

Identifiants

Citer

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. pp.69-81, ⟨10.1007/978-3-319-46750-4_5⟩. ⟨hal-01463441⟩
75 Consultations
0 Téléchargements
Dernière date de mise à jour le 07/04/2024
comment ces indicateurs sont-ils produits

Altmetric

Partager

Gmail Facebook Twitter LinkedIn Plus