Synthesizing round based fault-tolerant programs using genetic programming

Abstract

In this paper, we present an approach to synthesize round based distributed fault-tolerant programs using stack based genetic programming. Our approach evolves a fault-tolerant program based on a round based structure and the program specification. To permit such evolution, we use a multi-objective fitness function that characterizes the correctness of the program in the absence of faults, in the presence of a single fault and in the presence of multiple faults. This multi-objective fitness function attempts to synthesize a program that works equally well in all these scenarios. We demonstrate the effectiveness of our approach using two case studies: a byzantine agreement problem and a token ring problem. © Springer International Publishing 2013.