ACM Home Page
Please provide us with feedback. Feedback
Analyzing synchronization problems by using event histories as languages
Full text PdfPdf (589 KB)
Source ACM Annual Computer Science Conference archive
Proceedings of the 1986 ACM fourteenth annual conference on Computer science table of contents
Cincinnati, Ohio, United States
Pages: 183 - 188  
Year of Publication: 1986
ISBN:0-89791-177-6
Authors
Robert D. Dixon  Department of Computer Science, Wright State University
David Hemmendinger  Department of Computer Science, Wright State University
Sponsor
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 0,   Downloads (12 Months): 2,   Citation Count: 0
Additional Information:

references   collaborative colleagues   peer to peer  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/324634.325237
What is a DOI?

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
 
2
P. Brinch Hansen (1972), "A Comparison of Two Synchronizing Concepts", Acta Informatica 1, pp. 190-199.
 
3
-- (1973), "A Reply to Comments on 'A Comparison of Two Synchronizing Concepts' ", Acta Informatica 2, pp 189-190.
4
 
5
6
 
7
-- (1972) "Comments on 'A Comparison of Two Synchronizing Concepts' ", Acta Informatica 1, pp 375-376.
 
8
A.N. Habermann (1975), "Path ~xpressions", Technical Report, Dept. of Computer Science, Carnegie Mellon Univ, Pittsburg, PA.
 
9
C. Hewitt and R. Atkinson (1979), "Specification and Proof Techniques for Serializers" IEEE Trans on Software Engineering SE-5, pp. 10-23.
10
 
11
 
12
Collaborative Colleagues:
Robert D. Dixon: colleagues
David Hemmendinger: colleagues

Peer to Peer - Readers of this Article have also read: