Automated Fast-Track Reconfiguration of Group Communication Systems

  • Christoph Kreitz
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1579)


We present formal techniques for improving the performance of modular communication systems. For common sequences of operations we identify a fast-path through a stack of communication protocols and reconfigure the system’s code accordingly. Our techniques are implemented by tactics and theorems of the NuPRL proof development system and have been used successfully for the reconfiguration of application systems built with the Ensemble group communication toolkit.


Protocol Layer Program Transformation Event Handler Expansion Theorem Case Expression 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    K. Birman. Building Secure and Reliable Network Applications. Manning Publishing Company and Prentice Hall, 1997.Google Scholar
  2. 2.
    K. Birman & R. van Renesse. Reliable Distributed Computing with the Isis Toolkit. IEEE Computer Society Press, 1994.Google Scholar
  3. 3.
    R. Constable, et. al., Implementing Mathematics with the NuPRL proof development system. Prentice Hall, 1986.Google Scholar
  4. 4.
    O. Hafızogulları & C. Kreitz. A Type-based Framework for Automatic Debugging. Technical Report, Cornell University, 1998.Google Scholar
  5. 5.
    M. Hayden. Distributed communication in ML. Technical Report TR97-1652, Cornell University, 1997.Google Scholar
  6. 6.
    The Ensemble distributed communication system. System distribution and documentation.
  7. 7.
    M. Hayden. The Ensemble System. PhD thesis, Cornell University, 1998.Google Scholar
  8. 8.
    M. Hayden & R. van Renesse. Optimizing layered communication protocols. Technical Report TR 96-1613, Cornell University, 1996.Google Scholar
  9. 9.
    J. Hickey, N. Lynch, R. van Renesse. Specifications and Proofs for Ensemble Layers. TACAS’99. This volumeGoogle Scholar
  10. 10.
    C. Kreitz, M. Hayden, J. Hickey. A proof environment for the development of group communication systems. CADE-15, LNAI 1421, pp. 317–332, Springer, 1998.Google Scholar
  11. 11.
    C. Kreitz. Formal reasoning about communication systems I: Embedding ML into type theory. Technical Report TR97-1637, Cornell University, 1997.Google Scholar
  12. 12.
    C. Kreitz. Formal reasoning about communication systems II: Automated Fast-Track Reconfiguration. Technical Report TR98-1707, Cornell University, 1998.Google Scholar
  13. 13.
    C. Kreitz, J. Otten, S. Schmitt. Guiding Program Development Systems by a Connection Based Proof Strategy. LoPSTR-5, LNCS 1048, pp. 137–151. Springer, 1996.Google Scholar
  14. 14.
    X. Leroy. The Objective Caml system release 1.07. Institut National de Recherche en Informatique et en Automatique, 1998.Google Scholar
  15. 15.
    B. Pientka & C. Kreitz. Instantiation of existentially quantified variables in inductive specification proofs. AISC’98, LNAI 1476, pp. 247–258, Springer, 1998.Google Scholar
  16. 16.
    R. van Renesse, K. Birman, & S. Maffeis. Horus: A flexible group communication system. Communications of the ACM, 39(4):76–83, 1996.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Christoph Kreitz
    • 1
  1. 1.Department of Computer ScienceCornell-UniversityIthacaUSA

Personalised recommendations