Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Synthesis of Fault-Tolerant Concurrent Programs
 

Summary: Synthesis of Fault-Tolerant
Concurrent Programs
PAUL C. ATTIE
Northeastern University and MIT Computer Science and Artificial Intelligence
Laboratory
ANISH ARORA
The Ohio State University
and
E. ALLEN EMERSON
The University of Texas at Austin
Methods for mechanically synthesizing concurrent programs from temporal logic specifications
obviate the need to manually construct a program and compose a proof of its correctness. A serious
drawback of extant synthesis methods, however, is that they produce concurrent programs for
models of computation that are often unrealistic. In particular, these methods assume completely
fault-free operation, that is, the programs they produce are fault-intolerant. In this paper, we show
how to mechanically synthesize fault-tolerant concurrent programs for various fault classes. We
illustrate our method by synthesizing fault-tolerant solutions to the mutual exclusion and barrier
synchronization problems.
Categories and Subject Descriptors: C.2.4 [Computer-Communication Networks]: Distributed
Systems; C.4 [Performance of Systems]: Fault Tolerance; D.1.2 [Programming Techniques]:

  

Source: Attie, Paul - Department of Computer Science, American University of Beirut

 

Collections: Computer Technologies and Information Sciences