Skip to main content
SpringerLink
Log in

Concurrency in Modula-2: Properties of the Language Primitives

  • Conference paper
Specification and Verification of Concurrent Systems

Part of the book series: Workshops in Computing ((WORKSHOPS COMP.))

  • 54 Accesses

Abstract

The programming language Modula-2 provides two levels of support for concurrent programming, differing primarily in the level of abstraction at which programs can be written. We describe these two levels of concurrency in an algebraic style and show how this decription can be used to reason about the behaviour of concurrent programs in Modula-2. An intermediate level of “anonymous coroutines” is introduced to show the connection between these two levels. A number of alternative interpretations are given for those parts of the language where the precise semantics is not clear.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. C.A.R. Hoare, Communicating Sequential Processes, Prentice-Hall Int’l., 1985.

    MATH  Google Scholar 

  2. C.A.R. Hoare et al., “Laws of Programming”, Comm. ACM 30, 8 (Aug. 1987), 672–686.

    Article  MathSciNet  MATH  Google Scholar 

  3. Modula-2/86 Software Development System, 3rd Ed., Logitech Inc., 1986.

    Google Scholar 

  4. R.A. Nicholl, “A Specification of Modula-2 Process (Coroutine) Management”, to appear in Journal of Pascal, Ada and Modula-2, 1988.

    Google Scholar 

  5. P. Rovner, R. Levin and J. Wick, “On Extending Modula-2 for Building Large, Integrated Systems”, Report No. 3, DEC Systems Research Center, 1985.

    Google Scholar 

  6. N. Wirth, Programming in Modula-2, Springer-Verlag, 1982.

    Book  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Western Ontario, London, N6A 5B7, Canada

    Robin A. Nicholl

Authors
  1. Robin A. Nicholl
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computing Science, University of Stirling, Stirling, FK9 4LA, UK

    C. Rattray MSc

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag London

About this paper

Cite this paper

Nicholl, R.A. (1990). Concurrency in Modula-2: Properties of the Language Primitives. In: Rattray, C. (eds) Specification and Verification of Concurrent Systems. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3534-0_22

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-3534-0_22

  • Publisher Name: Springer, London

  • Print ISBN: 978-3-540-19581-8

  • Online ISBN: 978-1-4471-3534-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation