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)
  • 1