Vincent Filou

Learn More
We present a formalization in Coq of local computations, a model for distributed computing based on graph relabelling. This formalization allows one to prove the correctness of distributed algorithms, as well as to compare various synchronisation and termination detection modes. We illustrate our approach by two impossibility proofs, and by a certified(More)
calculs. Cette comparaison est illustrée par des exemples d'impossibilité de réaliser certaines spécifications, ou des preuves d'inclusion entre modes de détection de la terminaison via des transformations d'algorithmes. ABSTRACT. We present a formalization in Coq of local computations, a model for distributed computing based on graph relabelings. This(More)
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(More)
  • 1