Proof of a concurrent program finding Euler paths

Part of the Lecture Notes in Computer Science book series (LNCS, volume 88)


A concurrent program finding Euler paths in a graph is described, proved and analysed. The importance of atomic actions is particularly stressed.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [BES80]
    Best, E.: Atomicity of Activities. In: Proceedings of the Advanced Course in General Net Theory, Springer Lecture Notes in Computer Science, to appear in 1980.Google Scholar
  2. [DIJ76]
    Di jkstra, E.W.: A Discipline of Programming. Prentice Hall 1976.Google Scholar
  3. [DIJ78]
    iDijkstra, E.W.: Finding the Correctness Proof of a Concurrent Program. Proc. of the Koninklijke Nederlandse Akademie van Wetenschappen, Amsterdam, Series A, Vol. 81(2), June 1978.Google Scholar
  4. [DLM78]
    Dijkstra, E.W., Lamport, L., Martin, A.J., Scholten, C.S. and Steffens, E.F.M.: On-the-Fly Garbage Collection: An Exercise in Co-operation. CACM 21/11, November 1978, pp. 966–975.Google Scholar
  5. [ORE62]
    Ore, O.: Theory of Graphs. American Mathematical Society, Colloquium Publications, Vol. XXXVIII, Rhode Island 1962.Google Scholar
  6. [OWG76]
    Owicki, S. and Gries, D.: An Axiomatic Proof Technique for Parallel Programs I. Acta Informatica 6/1976, pp. 319–340.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1980

Authors and Affiliations

  • E. Best
    • 1
  1. 1.Computing LaboratoryUniversity of Newcastle upon TyneEngland

Personalised recommendations