BibTeX
@MISC{_polynomialtime,
author = {},
title = {Polynomial Time Synthesis of Byzantine Agreement},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
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 suffices to synthesize an agreement program that tolerates a byzantine fault. Keywords: Fault-tolerance, Formal methods, Program synthesis, Program transformation, Distributed programs
Keyphrases
byzantine agreement polynomial time synthesis agreement program polynomial time algorithm byzantine fault algorithm suffices automatic synthesis algorithm relies formal method program synthesis fault-tolerant distributed program program transformation fault-intolerant version synthesis problem
