%0 Conference Proceedings %F METIVIER_2002-ProvingDistributed %A Métivier, Yves %A Mosbah, Mohamed %A Sellami, Affif %T Proving Distributed Algorithms by Graph Relabelling Systems: Examples of Trees in Networks with Processor Identities %B AGT2002, ETAPS %C Grenoble, France %X In this paper, we argue that graph relabelling systems are well suited for the representation of distributed algorithms as well as for correctness and termination proofs. Various algorithms for computing distributed spanning trees serve as examples. The proofs use techniques that benefit from the high level encoding of distributed algorithms in form of rewriting systems. The result is a formal approach to describe and study distributed algorithms in a unified and simple way. %U ../../articles/Proving.ps.gz %8 April %D 2002