Tasks, types and tactics for local computation systems
Résumé
We present a formalization in Coq of local computations, a model for distributed computing based on graph relabeling. This formalization allows one to prove the correctness of distributed algorithms, as well as to compare various synchronization and termination detection modes. We illustrate our approach by two impossibility proofs, and by a certified algorithm transformation.