Skip to Main content Skip to Navigation
Other publications

Formal Proofs of Local Computation Systems

Abstract : This paper describes the structure of a library for certifying distributed algorithms, contributed by Pierre Castéran and Vincent Filou. We formalize in the Coq proof assistant the behaviour of a subclass of local computation systems, namely the LC0 graph relabeling systems. We show how this formalization allows not only to build certified LC0 systems, but also study the limitations of their control structure.
Complete list of metadatas

Cited literature [19 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00371705
Contributor : Mohamed Mosbah <>
Submitted on : Monday, March 30, 2009 - 12:15:55 PM
Last modification on : Saturday, March 14, 2020 - 5:50:12 PM
Document(s) archivé(s) le : Friday, October 12, 2012 - 2:30:51 PM

File

description.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00371705, version 1

Collections

Citation

Pierre Castéran, Vincent Filou, Mohamed Mosbah. Formal Proofs of Local Computation Systems. 2009. ⟨hal-00371705⟩

Share

Metrics

Record views

211

Files downloads

295