Make your enemies transparent

  • Tanga Vos
  • Doaitse Swierstra
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1335)


We design a distributed program that sorts a connected network of processes in an unstable environment. We show two techniques that enable us to factor out dynamic changes to the topology of the network in the specification of the program.


distributed programs unstable environments UNITY convergence transparency law 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [CM88]
    K.M. Chandy and J. Misra. Parallel Program Design — A Foundation. Addison-Wesley, 1988.Google Scholar
  2. [GM93]
    Mike J.C. Gordon and Tom F. Melham. Introduction to HOL. Cambridge University Press, 1993.Google Scholar
  3. [Pra95]
    W Prasetya.Mechanically Supported Design of Self-stabilizing Algorithms. PhD thesis, UU, Oct 1995.Google Scholar
  4. [RW92]
    K.A. Ross and C. R. B. Wright. Discrete Mathematics. Prentice-Hall, 1992.Google Scholar
  5. [VSP96]
    T.E.J. Vos, S.D. Swierstra, and I.S.W.B. Prasetya. Formal Methods and Mechanical Verification Applied to the development of a Convergent Distributed Sorting Program. Technical report, UU, 1996.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Tanga Vos
    • 1
  • Doaitse Swierstra
    • 1
  1. 1.Department of Computer scienceUtrecht UniversityTB UtrechtNetherlands

Personalised recommendations