A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Verifying Self-stabilizing Population Protocols with Coq
2009
2009 Third IEEE International Symposium on Theoretical Aspects of Software Engineering
Population protocols are an elegant model recently introduced for distributed algorithms running in large and unreliable networks of tiny mobile agents. Correctness proofs of such protocols involve subtle arguments on infinite sequences of events. We propose a general formalization of self-stabilizing population protocols with the Coq proof assistant. It is used in reasoning about a concrete protocol for leader election in complete graphs. The protocol is formally proved to be correct for
doi:10.1109/tase.2009.9
dblp:conf/tase/DengM09
fatcat:3opvhcpeezadrnrat2r3bzkn4m