Leader Election in the Presence of Link Failures
IEEE Transactions on Parallel and Distributed Systems
Trace analysis of Erlang programs
Proceedings of the 2002 ACM SIGPLAN workshop on Erlang
Semi-formal development of a fault-tolerant leader election protocol in erlang
FATES'04 Proceedings of the 4th international conference on Formal Approaches to Software Testing
Extended process registry for erlang
ERLANG '07 Proceedings of the 2007 SIGPLAN workshop on ERLANG Workshop
Finding counter examples in induction proofs
TAP'08 Proceedings of the 2nd international conference on Tests and proofs
Bounded phase analysis of message-passing programs
TACAS'12 Proceedings of the 18th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Finding non-terminating executions in distributed asynchronous programs
SAS'12 Proceedings of the 19th international conference on Static Analysis
Riak PG: distributed process groups on dynamo-style distributed storage
Proceedings of the twelfth ACM SIGPLAN workshop on Erlang
| Hi-index | 0.00 |
In this article we introduce a new implementation of a leader election algorithm used in the generic leader behavior known as gen_leader.erl. The first open source release of the generic leader [6] contains a few errors. The new implementation is based on a different algorithm, which has been adopted to fulfill the existing requirements. The testing techniques used to identify the errors in the first implementation have also been used to check the implementation we propose here. We even extended the amount of testing and used an additional new testing technique to increase our confidence in the implementation of this very tricky algorithm. The new implementation passed all tests successfully. In this paper we describe the algorithm and we discuss the testing techniques used during the implementation.