HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

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.
Complete list of metadata

Cited literature [17 references]  Display  Hide  Download

Contributor : Yoann Marquer Connect in order to contact the contributor
Submitted on : Tuesday, March 20, 2018 - 9:17:20 PM
Last modification on : Tuesday, October 19, 2021 - 4:09:40 PM
Long-term archiving on: : Tuesday, September 11, 2018 - 11:00:53 PM


Files produced by the author(s)


  • HAL Id : hal-01739317, version 1


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⟩



Record views


Files downloads