ACM Home Page
Please provide us with feedback. Feedback
Synchronization of communicating processes
Full text PdfPdf (534 KB)
Source
Communications of the ACM archive
Volume 15 ,  Issue 3  (March 1972) table of contents
Pages: 171 - 176  
Year of Publication: 1972
ISSN:0001-0782
Author
A. Nico Habermann  Carnegie-Mellon Univ., Pittsburgh, PA
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 32,   Citation Count: 49
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/361268.361277
What is a DOI?

ABSTRACT

Formalization of a well-defined synchronization mechanism can be used to prove that concurrently running processes of a system communicate correctly. This is demonstrated for a system consisting of many sending processes which deposit messages in a buffer and many receiving processes which remove messages from that buffer. The formal description of the synchronization mechanism makes it very easy to prove that the buffer will neither overflow nor underflow, that senders and receivers will never operate on the same message frame in the buffer nor will they run into a deadlock.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Dijkstra, E.W. Cooperating sequential processes. In Programming Languages, F. Genuys, Ed., Academic Press, New York, 1968, pp. 43-112.
2
 
3
Parnas, D.L Information distribution aspects of design methodology. Report, Dep. Computer Sci., Carnegie-Mellon U., Pittsburgh, Pa., Feb. 1971.
 
4
5
6
7
 
8
Habermann, A.N. An operating system modeled as a set of interacting processes. Ann. Princeton Conf. on Computer Sci. and Syst., March 1971.

CITED BY  49