Title :
Polynomial time synthesis of Byzantine agreement
Author :
Kulkarni, Sandeep S. ; Arora, Abhishek ; Chippada, Arun
Author_Institution :
Dept. of Comput. Sci. & Eng., Michigan State Univ., East Lansing, MI, USA
Abstract :
We present a polynomial time algorithm for automatic synthesis of fault-tolerant distributed programs, starting from fault-intolerant versions of those programs. Since this synthesis problem is known to be NP-hard, our algorithm relies on heuristics to reduce the complexity. We demonstrate that our algorithm is able to synthesize an agreement program that tolerates a Byzantine fault
Keywords :
automatic programming; computational complexity; distributed programming; heuristic programming; software fault tolerance; Byzantine agreement; Byzantine fault; NP-hard; agreement program; automatic synthesis; complexity; fault-intolerant versions; fault-tolerant distributed programs; formal methods; heuristics; polynomial time algorithm; polynomial time synthesis; Algorithm design and analysis; Computer science; Contracts; Distributed computing; Engineering profession; Fault tolerance; Information science; Java; Polynomials; State-space methods;
Conference_Titel :
Reliable Distributed Systems, 2001. Proceedings. 20th IEEE Symposium on
Conference_Location :
New Orleans, LA
Print_ISBN :
0-7695-1366-2
DOI :
10.1109/RELDIS.2001.969767
