Synthesis of fault-tolerant concurrent programs

Anish Arora, Paul C. Attie, E. Allen Emerson

Research output: Contribution to conferencePaper

22 Scopus citations

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 [EC82, MW84, PR89, PR89b, AM94]. 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, i.e., 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.

Original languageEnglish (US)
Pages173-182
Number of pages10
Publication statusPublished - Jan 1 1998
Externally publishedYes
EventProceedings of the 1998 17th Annual ACM Symposium on Principles of Distributed Computing - Puerto Vallarta, Mexico
Duration: Jun 28 1998Jul 2 1998

Conference

ConferenceProceedings of the 1998 17th Annual ACM Symposium on Principles of Distributed Computing
CityPuerto Vallarta, Mexico
Period6/28/987/2/98

    Fingerprint

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Cite this

Arora, A., Attie, P. C., & Emerson, E. A. (1998). Synthesis of fault-tolerant concurrent programs. 173-182. Paper presented at Proceedings of the 1998 17th Annual ACM Symposium on Principles of Distributed Computing, Puerto Vallarta, Mexico, .