Distributed Computing

, Volume 1, Issue 2, pp 77–85 | Cite as

On interprocess communication

Part I: Basic formalism
  • Leslie Lamport


A formalism for specifying and reasoning about concurrent systems is described. Unlike more conventional formalisms, it is not based upon atomic actions. A definition of what it means for one system to implement a higher-level system is given and justified. In Part II, the formalism is used to specify several classes of interprocess communication mechanisms and to prove the correctness of algorithms for implementing them.

Key word

Concurrent reading and writing Nonatomic operations Shared data 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bernstein PA, Goodman N (1981) Concurrency control in distributed database systems. ACM Comput Surv 13:185–222Google Scholar
  2. 2.
    Brauer W (ed) (1980) Net Theory and Applications. Lect Notes Comput Sci 84, Springer-Verlag, Berlin Heidelberg New YorkGoogle Scholar
  3. 3.
    Lamport L (in press) The mutual exclusion problem. J ACMGoogle Scholar
  4. 4.
    Lamport L (1979) A new approach to proving the correctness of multiprocess programs. ACM Trans Program Lang Syst 1:84–97Google Scholar
  5. 5.
    Lamport L: On interprocess communication. Part II: Algorithms. Distributed Computing 1:85-101Google Scholar
  6. 6.
    Lamport L (1978) Time, clocks and the ordering of events in a distributed system. Commun ACM 21:558–565Google Scholar
  7. 7.
    Lamport L (1985) What it means for a concurrent program to satisfy a specification: why no one has specified priority. In: Proceedings of the Twelfth ACM Symposium on Principles of Programming Languages, ACM SIGACT-SIGPLAN, New OrleansGoogle Scholar
  8. 8.
    Lamport L (1985) Interprocess Communication. SRI Technical Report, March 1985Google Scholar
  9. 9.
    Lauer PE, Shields MW. Best E (1979) Formal Theory of the Basic COSY Notation. Technical Report TR143. Computing Laboratory. University of Newcastle upon TyneGoogle Scholar
  10. 10.
    Mazurkiewicz A (1984) Semantics of Concurrent Systems: A Modular Fixed Point Trace Approach. Technical Report 84-19. Institute of Applied Mathematics and Computer Science, University of LeidenGoogle Scholar
  11. 11.
    Milner R (1980) A Calculus of Communicating Systems. Lect Notes Comput Sci 92. Springer-Verlag, Berlin Heidelberg New YorkGoogle Scholar
  12. 12.
    Pnueli A (1977) The temporal logic of programs. In: Proc. of the 18th Symposium on the Foundations of Computer Science, ACM, November 1977Google Scholar
  13. 13.
    Winskel G (1980) Events in Computation. PhD thesis, Edinburgh UniversityGoogle Scholar

Copyright information

© Springer-Verlag 1986

Authors and Affiliations

  • Leslie Lamport
    • 1
  1. 1.Systems Research CenterDigital Equipment CorporationPalo AltoUSA

Personalised recommendations