Proving Formally a Field-Based FSSP Solution

Abstract : In the research domain of cellular automata algorithmics, the firing squad synchronization problem is a famous problem that has been solved in many ways. However, very few of these solutions have a detailed formal proof suitable for proof assistant and for human understanding. The reason is that the correctness of those solutions is more easily seen from a high level point of view and from the way the solution has been constructed than from the actual formal description of the constructed solution. The field-based approach consists in giving a formal description of a new high-level and modular description and the reduction process down to the final low-level solution. The decomposition in modules are natural from a design point of view and is a precise counterpart of the previous informal high-level description. This research report aims to present an understandable proof of correctness of the high-level field-based solution suitable for an implementation in Coq.
Type de document :
Rapport
[Technical Report] Laboratoire d'Informatique Algorithmique: Fondements et Applications, Université Paris Diderot - Paris 7. 2018, pp.1-58
Liste complète des métadonnées

Littérature citée [17 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-01739317
Contributeur : Yoann Marquer <>
Soumis le : mardi 20 mars 2018 - 21:17:20
Dernière modification le : jeudi 13 décembre 2018 - 15:26:38
Document(s) archivé(s) le : mardi 11 septembre 2018 - 23:00:53

Fichier

FSSP_1.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-01739317, version 1

Collections

Citation

Yoann Marquer, Luidnel Maignan, Jean-Baptiste Yunès. Proving Formally a Field-Based FSSP Solution. [Technical Report] Laboratoire d'Informatique Algorithmique: Fondements et Applications, Université Paris Diderot - Paris 7. 2018, pp.1-58. 〈hal-01739317〉

Partager

Métriques

Consultations de la notice

172

Téléchargements de fichiers

39