article

Free access

A note on deadlock-free proofs of network of processes

Author:

H. ZedanAuthors Info & Claims

ACM SIGPLAN Notices, Volume 19, Issue 10

Pages 58 - 62

https://doi.org/10.1145/948290.948297

Published: 01 October 1984 Publication History

PDF eReader

Abstract

The processes in a network are categorized according to their functionalities at a given stage in the computation. A simple criterion for total correctness of a set of communicating processes is also given along with a necessary and sufficient condition to prove the absence of deadlock.

References

[1]

Hoare C. A. R. {1978} "Communicating Sequential Processes". Comm. ACM, vol 21, No. 8.

Digital Library

Google Scholar

[2]

INMOS {1982} "Programming Manual: OCCAM".

Google Scholar

[3]

Owicki S. and Gries D. {1976} "An Axiomatic Proof Technique For Parallel Programms I". Acta Informatica, vol 6.

Google Scholar

Cited By

View all

Huang XSteigner C(1993)Dynamische Deadlockerkennung für ParallelprogrammeParallele Datenverarbeitung mit dem Transputer10.1007/978-3-642-78123-0_9(83-92)Online publication date: 1993
https://doi.org/10.1007/978-3-642-78123-0_9
Zedan H(1990)Key references in distributed computer systems 1959–1989Distributed Computer Systems10.1016/B978-0-408-02938-4.50016-4(193-295)Online publication date: 1990
https://doi.org/10.1016/B978-0-408-02938-4.50016-4
Zedan H(1989)Time-closed layer: a design principle for time-critical applications[1989] Proceedings. EUROMICRO Workshop on Real Time10.1109/EMWRT.1989.43452(138-145)Online publication date: 1989
https://doi.org/10.1109/EMWRT.1989.43452

Recommendations

Deadlock-Free channels and locks
ESOP'10: Proceedings of the 19th European conference on Programming Languages and Systems

The combination of message passing and locking to protect shared state is a useful concurrency pattern. However, programs that employ this pattern are susceptible to deadlock. That is, the execution may reach a state where each thread in a set waits for ...
Efficient, deterministic and deadlock-free concurrency
Jthread, a deadlock-free mutex library
PPDP '15: Proceedings of the 17th International Symposium on Principles and Practice of Declarative Programming

We design a mutex library for Hop -- a dialect of Scheme which supports preemptive multithreading and shared memory -- that mixes deadlock prevention and deadlock avoidance to provide an easy to use, expressive, and safe locking function. This requires ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

ACM SIGPLAN Notices Volume 19, Issue 10

October 1984

51 pages

ISSN:0362-1340

EISSN:1558-1160

DOI:10.1145/948290

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 October 1984

Published in SIGPLAN Volume 19, Issue 10

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
151
Total Downloads

Downloads (Last 12 months)16
Downloads (Last 6 weeks)7

Reflects downloads up to 19 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Huang XSteigner C(1993)Dynamische Deadlockerkennung für ParallelprogrammeParallele Datenverarbeitung mit dem Transputer10.1007/978-3-642-78123-0_9(83-92)Online publication date: 1993
https://doi.org/10.1007/978-3-642-78123-0_9
Zedan H(1990)Key references in distributed computer systems 1959–1989Distributed Computer Systems10.1016/B978-0-408-02938-4.50016-4(193-295)Online publication date: 1990
https://doi.org/10.1016/B978-0-408-02938-4.50016-4
Zedan H(1989)Time-closed layer: a design principle for time-critical applications[1989] Proceedings. EUROMICRO Workshop on Real Time10.1109/EMWRT.1989.43452(138-145)Online publication date: 1989
https://doi.org/10.1109/EMWRT.1989.43452

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Recommendations

Deadlock-Free channels and locks

Efficient, deterministic and deadlock-free concurrency

Jthread, a deadlock-free mutex library

Comments

Information

Published In

Publisher

Publication History

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations