On the Construction of Distributed Programs

  • Conference paper
Distributed Operating Systems

Part of the book series: NATO ASI Series ((NATO ASI F,volume 28))

  • 112 Accesses

Abstract

The construction of correct sequential programs requires generally that two main objectives have to be achieved.

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

Access this chapter

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free ship** 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.

Similar content being viewed by others

Bibliography

  1. Bernstein P.A., Goodman N. Concurrency Control in Distributed Database Systems, ACM, Computing Surveys, Vol. 13, 2 (June 1981), pp. 185–201.

    Article  MathSciNet  Google Scholar 

  2. Carvalho O., Roucairol G. On the distribution of an assertion. In “Proc. ACM-SIGACT-SIGOPS Symposium on Principles of Distributed Computing”. Ottawa, Canada. 1982.

    Google Scholar 

  3. Carvalho O., Roucairol G. On mutual exclusion in Computer Network. Comm. ACM Vol. 26,2. 1983 pp. 146–147.

    Article  Google Scholar 

  4. Carvalho O., Roucairol G. Assertion Decomposition and Partial Correctness of Distributed Control Algorithms. Distributed Computed Systems. Paker and Verjus eds. Academic Press London. 1983. pp. 67 –pp. 92.

    Google Scholar 

  5. Carvalho O. Une contribution à la programmation des systèmes distribués (Thèse d’Etat). Internal Report L.R.I. 224, Université Paris 11 Orsay. 1985.

    Google Scholar 

  6. Dijkstra E.W., Feijen W.H.J., Van Gasteren A.J.M. Derivation of a Termination Detection Algorithm for Distributed Computation, Inf. Proc. Letters, Vol. 16, (June 1983), pp. 217–219.

    Article  Google Scholar 

  7. Francez N. Distributed Termination, ACM Toplas, Vol. 2,1, (January 1980), pp. 42–55.

    Article  MATH  Google Scholar 

  8. Lamport L. Time, clocks and the ordering of events in distributed systems. Comm. ACM 21,7. 1978.

    Google Scholar 

  9. Lavallée I., Roucairol G. A fully distributed (minimal) spanning tree algorithm. Inf. Proc. Letters to appear in 1986.

    Google Scholar 

  10. Misra J., Chandy K.M. Termination Detection of Diffusing Computation Using Markers, Proc. of the 2nd annual ACM Symposium on Principles of DC, Montreal, (August 1983), pp. 290–294.

    Google Scholar 

  11. Raynal M. Algorithmes Distribués et Protocoles. Eyrolles Publ. Paris. 1985.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Roucairol, G. (1987). On the Construction of Distributed Programs. In: Paker, Y., Banatre, JP., Bozyiğit, M. (eds) Distributed Operating Systems. NATO ASI Series, vol 28. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-46604-5_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-46604-5_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-46606-9

  • Online ISBN: 978-3-642-46604-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Navigation