A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
Polynomial time synthesis of Byzantine agreement
Proceedings 20th IEEE Symposium on Reliable Distributed Systems
Preserved Fulltext
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.
doi:10.1109/reldis.2001.969767
dblp:conf/srds/KulkarniAC01
fatcat:n4dtcidz65b7blaqawldl3hgou