Top-down considerations on distributed computing

  • Ron van der Meyden
  • Yoram Moses
Keynote Lectures
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1499)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Chou, C., Gafni, E.: Understanding and verifying distributed algorithms using stratified decomposition. Proc. 7th ACM PODC (1988) 44–65Google Scholar
  2. 2.
    Gallager, R., Humblet, P., Spira, P.: A distributed algorithm for minimum-weight spanning trees. ACM Trans. on Prog. Lang. and Syst., 5(1) (1983) 66–77MATHCrossRefGoogle Scholar
  3. 3.
    Elrad, T., Francez, N.: Decomposition of distributed programs into communication-closed layers. Sci. Comp. Prog., 2(3) (1982) 155–173MATHCrossRefGoogle Scholar
  4. 4.
    Havelund, K., Larsen, K.G.: The fork calculus. Proc. 20th ICALP, LNCS 700 (1993) 544–557Google Scholar
  5. 5.
    Koo, R., Toueg, S.: Effects of message loss on termination of distributed protocols. Inf. Proc, Letters, 27 (1988) 181–188MathSciNetCrossRefGoogle Scholar
  6. 6.
    Stomp, F., de Roever, W.P.: A principle for sequential reasoning about distributed systems. Form. Asp. Comp., 6(6) (1994) 716–737MATHGoogle Scholar
  7. 7.
    Zweirs, J., Janssen, W.: Partial-order based design of concurrent systems. Proc. REX Symp. “A decade of concurrency”, J. de Bakker, W. P. de Roever, G. Rozenberg eds., LNCS 803 (1994) 622–684Google Scholar

Copyright information

© Springer-Verlag 1998

Authors and Affiliations

  • Ron van der Meyden
    • 1
  • Yoram Moses
    • 2
  1. 1.University of Technology SydneyBroadwayAustralia
  2. 2.Faculty of Electrical EngineeringThe TechnionHaifaIsrael

Personalised recommendations