Skip to main content
SpringerLink
Log in

Distributed termination with interval assertions

  • Communications
  • Conference paper
  • First Online:
Formalization of Programming Concepts (ICFPC 1981)

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

Included in the following conference series:

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. K.R. Apt, N. Francez, W.P. deRoever: A proof system for communicating sequential processes. ACM-TOPLAS, 2,3 (July 1980), pp. 359–385.

    Google Scholar 

  2. E.W. Dijkstra: An elephant inspired by the Dutch national flag. EWD — 608, Nuenen, (1977).

    Google Scholar 

  3. E.W. Dijkstra: A special sorting elephant. EWD — 642, Nuenen.

    Google Scholar 

  4. E.W. Dijkstra, C.S. Scholten: Termination detection for diffusing computation. Information Processing letters 11, 1 (August 1980), pp. 1–4.

    Article  Google Scholar 

  5. N. Francez: Distributed Termination. ACM-TOPLAS 2, 1 (January 1980), pp. 42–55.

    Google Scholar 

  6. N. Francez, M. Rodeh: Achieving Distributed Termination without Freezing. TR-72, IBM Israel Scientific Center (1979). To appear in IEEE-TSE.

    Google Scholar 

  7. C.A.R. Hoare: Communicating Sequential Processes. CACM 21, 8, (August 1978), pp. 666–677.

    Google Scholar 

  8. P. Merlin, A. Segall: A failsafe distributed routing protocol. IEEE Trans. Comm. 27 (September 1979), pp. 1230–1237.

    Google Scholar 

  9. M. Sintzoff: Three problems in the design of distributed programs. Working Note presented at IFIP W.G. 2.3, April 1978.

    Google Scholar 

  10. M. Sintzoff: On language design for program construction. Algol Bulletin 42 (1978), pp. 74–84.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Dept., Technion-Israel Institute of Technology, Haifa, Israel

    N. Francez

  2. IBM Israel Scientific Center, Technion City, Haifa, Israel

    M. Rodeh

  3. Philips Research Laboratory, Brussels, Belgium

    M. Sintzoff

Authors
  1. N. Francez
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. Rodeh
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. M. Sintzoff
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. Díaz I. Ramos

Rights and permissions

Reprints and permissions

Copyright information

© 1981 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Francez, N., Rodeh, M., Sintzoff, M. (1981). Distributed termination with interval assertions. In: Díaz, J., Ramos, I. (eds) Formalization of Programming Concepts. ICFPC 1981. Lecture Notes in Computer Science, vol 107. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10699-5_105

Download citation

  • DOI: https://doi.org/10.1007/3-540-10699-5_105

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10699-9

  • Online ISBN: 978-3-540-38654-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation