Abstract
Methods for mechanically synthesizing concurrent programs from temporal logic specifications have been proposed (cf. [EC82, MW84, PR89, PR89b, AM94]). An important advantage of these synthesis methods is that they obviate the need to manually construct a program and compose a proof of its correctness. A serious drawback of these methods in practice, however, is that they produce concurrent programs for models of computation that are often unrealistic, involving highly centralized system architecture (cf. [MW84]) or processes with global information about the system state (cf. [EC82]). Even simple synchronization protocols based on atomic read / atomic write primitives such as Peterson's solution to the mutual exclusion problem have remained outside the scope of practical mechanical synthesis methods. In this paper, we show how to mechanically synthesize in more realistic computational models solutions to synchronization problems. We illustrate the method by synthesizing Peterson's solution to the mutual exclusion problem.
Original language | English (US) |
---|---|
Pages | 111-120 |
Number of pages | 10 |
DOIs | |
State | Published - 1996 |
Externally published | Yes |
Event | Proceedings of the 1996 15th Annual ACM Symposium on Principles of Distributed Computing - Philadelphia, PA, USA Duration: May 23 1996 → May 26 1996 |
Conference
Conference | Proceedings of the 1996 15th Annual ACM Symposium on Principles of Distributed Computing |
---|---|
City | Philadelphia, PA, USA |
Period | 5/23/96 → 5/26/96 |
ASJC Scopus subject areas
- Software
- Hardware and Architecture
- Computer Networks and Communications