Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Polynomial Time Synthesis of Byzantine Agreement Sandeep S. Kulkarni Anish Arora y Arun Chippada
 

Summary: Polynomial Time Synthesis of Byzantine Agreement
Sandeep S. Kulkarni  Anish Arora y Arun Chippada 
 Department of Computer y Department of Computer
Science and Engineering and Information Science
Michigan State University Ohio State University
East Lansing MI 48824 USA Columbus Ohio 43210 USA
Abstract
In this paper, we present a polynomial time algorithm for automating the synthesis of a fault-tolerant
distributed program from a fault-intolerant distributed program. Since the problem of synthesizing fault-
tolerant distributed program is NP-hard, we present heuristics that allow us to reduce the complexity.
We demonstrate our algorithm by automating the synthesis of the byzantine agreement program where
there is one byzantine process. We also show how our algorithm can be used for the case where one
process su ers from the byzantine fault and another su ers from the failstop fault. Finally, we also
describe the tool that implements the heuristics.
Keywords : Fault-tolerance, Formal methods, Program Synthesis
Program transformation, Concurrent programs, Low Atomicity
1 Email: sandeep@cse.msu.edu, anish@cis.ohio-state.edu, chippada@cse.msu.edu
Web: http://www.cse.msu.edu/~sandeep, http://www.cis.ohio-state.edu/~anish, http://www.cse.msu.edu/~chippada
Tel: +1-517-355-2387
This work was partially sponsored by NSA Grant MDA904-96-1-0111, NSF Grant NSF-CCR-9972368, NSF CAREER

  

Source: Arora, Anish - Department of Computer Science and Engineering, Ohio State University

 

Collections: Computer Technologies and Information Sciences