Distributed Synthesis of Fault-Tolerant Programs in the High Atomicity Model

In this paper, we concentrate on distributed algorithms for automated synthesis of fault-tolerant programs in the high atomicity model, where all processes can read and write all program variables in one atomic step. Although there has recently been an increasing interest in using parallel and distributed techniques in the model checking community, these technique have not been investigated in program synthesis. Developing such techniques is crucial as a means to cope with the state explosion problem in the context of program synthesis and transformation as well. We propose two distributed multithreaded algorithms for adding two levels of fault-tolerance, namely failsafe and masking, to existing fault-intolerant programs whose state space is distributed over a network or cluster of workstations.

• Type: Conference
• Year: 2007
• Where: SSS
• Authors: Borzoo Bonakdarpour, Sandeep S. Kulkarni, Fuad Abujarad
• Keywords: Distributed Algorithms, Distributed Multithreaded Algorithms, Program Synthesis, SSS 2007