article

Free access

A Modula-2 implementation of CSP

Authors:

M Collado,

R Morales,

J J MorenoAuthors Info & Claims

ACM SIGPLAN Notices, Volume 22, Issue 6

Pages 25 - 38

https://doi.org/10.1145/24900.24902

Published: 01 June 1987 Publication History

PDF eReader

Abstract

Recently, a series of process communication schemes based on message exchanges have been developed. Hoare's CSP is perhaps the most interesting one and is the base for concurrent features of modern languages (e.g. ADA, Occam, etc.).Several concurrency mechanisms have already been implemented in Modula-2 (signals, COBEGIN.COEND structure, message exchanges, etc.) but they have not completely fulfilled the Hoare's CSP scheme.In this paper a general implementation of CSP in Modula-2 is presented. Low level and modularity facilities of this language have been used to develop a kernel thus allowing the use of comunication primitives and nondeterministic selection.The original CSP scheme has been slightly modified by using port names instead of process names to specify communication.

References

[1]

[1] Brinch Hansen, P.: The Programming Language Concurrent Pascal. IEEE T. S. E. SE-1 (2), 199-207. 1975.

Google Scholar

[2]

[2] Cerrada, J. A., Collado, M.: Distributed System Programming in Extended Pascal. Euromicro 85. Brusseles. 1985.

Google Scholar

[3]

[3] Cerrada, J. A., Collado, M.: An Experimental Implementation of the Communicating Sequential Processes Scheme. Mimi'85. Sant Feliu. 1985.

Google Scholar

[4]

[4] Dijkstra E. W.: Guarded Commands, Nondeterminacy, and Formal Derivation of Programs. Communications of ACM. 18, 8, 453-457. 1975.

Digital Library

Google Scholar

[5]

[5] Gehani, N.: ADA, An Advanced Introduction. Prentice Hall. 1983.

Digital Library

Google Scholar

[6]

[6] Hoare, C. A. R.: Communicating Sequential Processes. Comm. ACM 21 (8) 666-677. 1978.

Digital Library

Google Scholar

[7]

[7] Hoare, C. A. R.: Communicating Sequential Processes. Prentice Hall. 1985.

Digital Library

Google Scholar

[8]

[8] INMOS Limited.: Occam Programming Manual. Prentice Hall. 1984.

Digital Library

Google Scholar

[9]

[9] Sewry, D. A.: Modula-2 Process Facilities. Sigplan Notices ACM, 19, 23-32. 1984.

Digital Library

Google Scholar

[10]

[10] United States Department of Defense.: MIL-STD-1815A-1983: Reference Manual for the Ada Programmlng Language. American National Standard Institute. 1983.

Digital Library

Google Scholar

[11]

[11] Wirth, N.: Programming in Modula-2 and Report of the Programming Language Modula-2. Springer-Verlag. 1982.

Digital Library

Google Scholar

[12]

[12] Wirth, N.: Schemes for Multiprogramming and their implementation in Modula-2. Tech. Rep. 59. Institut für Informatik. ETH Zürich. 1984.

Google Scholar

Cited By

View all

Krämer WZimmer MHofschuster W(2010)Using C-XSC for high performance verified computingProceedings of the 10th international conference on Applied Parallel and Scientific Computing - Volume 210.1007/978-3-642-28145-7_17(168-178)Online publication date: 6-Jun-2010
https://dl.acm.org/doi/10.1007/978-3-642-28145-7_17
Graillat SLamotte JHong D(2009)Error-Free Transformation in Rounding Mode toward ZeroNumerical Validation in Current Hardware Architectures10.1007/978-3-642-01591-5_14(217-229)Online publication date: 29-Apr-2009
https://dl.acm.org/doi/10.1007/978-3-642-01591-5_14
Chesneaux JGraillat SJézéquel F(2009)Rounding ErrorsWiley Encyclopedia of Computer Science and Engineering10.1002/9780470050118.ecse582(2480-2494)Online publication date: 16-Mar-2009
https://doi.org/10.1002/9780470050118.ecse582
Show More Cited By

Index Terms

Recommendations

A portable optimizing compiler for Modula-2
Proceedings of the SIGPLAN '84 symposium on compiler construction

A portable compiler for the Modula-2 programming language has been implemented with a simple, machine independent optimizer. The front end of the compiler generates a dialect of P-code, and the back end translates the P-code into machine language. The ...
Euclid and Modula

Both Euclid and Modula are programming languages based on Pascal and intended for writing system software such as operating system kernels. The further goals of each language, however, resulted in two rather different languages. Modula is meant to be ...
A portable optimizing compiler for Modula-2
SIGPLAN '84: Proceedings of the 1984 SIGPLAN symposium on Compiler construction

A portable compiler for the Modula-2 programming language has been implemented with a simple, machine independent optimizer. The front end of the compiler generates a dialect of P-code, and the back end translates the P-code into machine language. The ...

Comments

Information & Contributors

Information

Published In

ACM SIGPLAN Notices Volume 22, Issue 6

June 1987

93 pages

ISSN:0362-1340

EISSN:1558-1160

DOI:10.1145/24900

Editor:
Richard L Wexelblat

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 June 1987

Published in SIGPLAN Volume 22, Issue 6

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

10
Total Citations
View Citations
224
Total Downloads

Downloads (Last 12 months)50
Downloads (Last 6 weeks)4

Reflects downloads up to 12 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Krämer WZimmer MHofschuster W(2010)Using C-XSC for high performance verified computingProceedings of the 10th international conference on Applied Parallel and Scientific Computing - Volume 210.1007/978-3-642-28145-7_17(168-178)Online publication date: 6-Jun-2010
https://dl.acm.org/doi/10.1007/978-3-642-28145-7_17
Graillat SLamotte JHong D(2009)Error-Free Transformation in Rounding Mode toward ZeroNumerical Validation in Current Hardware Architectures10.1007/978-3-642-01591-5_14(217-229)Online publication date: 29-Apr-2009
https://dl.acm.org/doi/10.1007/978-3-642-01591-5_14
Chesneaux JGraillat SJézéquel F(2009)Rounding ErrorsWiley Encyclopedia of Computer Science and Engineering10.1002/9780470050118.ecse582(2480-2494)Online publication date: 16-Mar-2009
https://doi.org/10.1002/9780470050118.ecse582
Hernández JSanchez J(1992)RT-MODULA2ACM SIGPLAN Notices10.1145/130973.13097427:2(26-36)Online publication date: 1-Feb-1992
https://dl.acm.org/doi/10.1145/130973.130974
Vollmer JHoffart R(1992)Modula-P-a language for parallel programming definition and implementation on a transputer networkProceedings of the 1992 International Conference on Computer Languages10.1109/ICCL.1992.185468(54-64)Online publication date: 1992
https://doi.org/10.1109/ICCL.1992.185468
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
Morales-Fernandez RMoreno-Navarro J(1989)CC-modula: a modula-2 tool to teach concurrent programmingACM SIGCSE Bulletin10.1145/70593.7059821:3(19-25)Online publication date: 1-Sep-1989
https://dl.acm.org/doi/10.1145/70593.70598
Burns ADavies GWellings A(1988)A Modula-2 implementation of a real-time process abstractionACM SIGPLAN Notices10.1145/51607.5160823:10(49-58)Online publication date: 1-Oct-1988
https://dl.acm.org/doi/10.1145/51607.51608
Hemmendinger D(1988)Unfair process scheduling in Modula-2ACM SIGPLAN Notices10.1145/43895.4389623:3(7-12)Online publication date: 1-Mar-1988
https://dl.acm.org/doi/10.1145/43895.43896
Fujimoto RFeng H(1987)A shared memory algorithm and proof for the generalized alternative construct in CSPInternational Journal of Parallel Programming10.1007/BF0140793416:3(215-241)Online publication date: 1-Jun-1987
https://dl.acm.org/doi/10.1007/BF01407934

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

Index Terms

Recommendations

A portable optimizing compiler for Modula-2

Euclid and Modula

A portable optimizing compiler for Modula-2

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