Synthesis of fault-tolerant concurrent programs

  • Authors:
  • Paul C. Attie;Anish Arora;E. Allen Emerson

  • Affiliations:
  • Northeastern University and MIT Computer Science and Artificial Intelligence Laboratory, Boston, MA;The Ohio State University, Columbus, OH;The University of Texas at Austin, Austin, TX

  • Venue:
  • ACM Transactions on Programming Languages and Systems (TOPLAS)
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.