Formal Proofs of Local Computation Systems - Archive ouverte HAL Access content directly
Other Publications Year : 2009

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.
Fichier principal
Vignette du fichier
description.pdf (283.97 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00371705 , version 1 (30-03-2009)

Identifiers

  • HAL Id : hal-00371705 , version 1

Cite

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

Collections

CNRS ANR
100 View
218 Download

Share

Gmail Facebook X LinkedIn More