CASTERAN-2011-596712
Pierre Castéran, Vincent Filou. Tasks, types and tactics for local computation systems. Studia Informatica Universalis, http://studia.complexica.net/Art/RI090102.pdf, 9.1:39-86, 2011.
Download
Download paper:
Follow the link
Copyright notice:This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.
Abstract
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
Contact
BibTex Reference
@article{CASTERAN-2011-596712,
Author = {Castéran, Pierre and Filou, Vincent},
Title = {Tasks, types and tactics for local computation systems},
Journal = {Studia Informatica Universalis},
Volume = {9.1},
Pages = {39--86},
Year = {2011}
}
EndNote Reference [help]
Get EndNote Reference (.ref)