Skip to main content
SpringerLink
Log in
Book cover

International Conference on Concurrency Theory

CONCUR 1992: CONCUR '92 pp 317–324Cite as

At-most-once message delivery A case study in algorithm verification

  • Conference paper
  • First Online:

  • 158 Accesses

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

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Abadi and L. Lamport. The existence of refinement mappings. In Proceedings of the 3rd Annual Symposium on Logic in Computer, pages 165–175, Edinburgh, Scotland, July 1988.

    Google Scholar 

  2. D. Belsnes. Single message communication. IEEE Transactions on Communications, Com-24(2), February 1976.

    Google Scholar 

  3. B. Liskov, L. Shrira, and J. Wroclawski. Efficient at-most-once messages based on synchronized clocks. Technical Report MIT/LCS/TR-476, Laboratory for Computer Science, Massachusetts Institute of Technology, April 1990.

    Google Scholar 

  4. N. Lynch and I. Saias. Distributed Algorithms. Fall 1990 Lecture Notes for 6.852. MIT/LCS/RSS 16, Massachusetts Institute of Technology, February 1992.

    Google Scholar 

  5. N. Lynch and M. Tuttle. Hierarchical correctness proofs for distributed algorithms. Techical Report MIT/LCS/TR-387, Laboratory for Computer Science, Massachusetts Institute Technology, Cambridge, MA, 02139, April 1987.

    Google Scholar 

  6. N. Lynch and M. Tuttle. An introduction to Input/Output automata. CWI-Quarterly, 2(3):219–246, September 1989.

    MATH  MathSciNet  Google Scholar 

  7. N. Lynch and F. Vaandrager. Forward and backward simulations for timing-based systems. In Proceedings of REX Workshop “Real-Time: Theory in Practice”, Mook, The Netherland, 1992. Springer-Verlag, LNCS 600.

    Google Scholar 

  8. F. Modugno, M. Merritt, and M. Tuttle. Time constrained automata. In CONCUR'91 Proceedings Workshop on Theories of Concurrency: Unification and Extension, Amsterdam, August 1991.

    Google Scholar 

  9. S. Owicki and D. Gries. An axiomatic proof technique for parallel programs I. Acta Informatica, 6(4):319–340, 1976.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Digital Equipment Corp., Denmark

    Butler Lampson

  2. MIT, USA

    Nancy Lynch & Jørgen Søgaard-Andersen

  3. Department of Computer Science, Technical University of Denmark, Denmark

    Jørgen Søgaard-Andersen

Authors
  1. Butler Lampson
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nancy Lynch
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jørgen Søgaard-Andersen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

W.R. Cleaveland

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lampson, B., Lynch, N., Søgaard-Andersen, J. (1992). At-most-once message delivery A case study in algorithm verification. In: Cleaveland, W. (eds) CONCUR '92. CONCUR 1992. Lecture Notes in Computer Science, vol 630. Springer, Berlin, Heidelberg . https://doi.org/10.1007/BFb0084800

Download citation

  • DOI: https://doi.org/10.1007/BFb0084800

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55822-4

  • Online ISBN: 978-3-540-47293-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation