Synthesis of fault-tolerant concurrent programs

22Citations
Citations of this article
16Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Arora, A., Attie, P. C., & Emerson, E. A. (1998). Synthesis of fault-tolerant concurrent programs. In Proceedings of the Annual ACM Symposium on Principles of Distributed Computing (pp. 173–182). ACM. https://doi.org/10.1145/277697.277729

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free