Advertisement

Rigorous development of a distributed calendar system

  • Ulla Gamwell Dawids
  • Hans Henrik Løvengreen
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 259)

Abstract

Many formal languages and notations for specification of concurrent and distributed systems have been presented, but few of these have been applied in larger scale. In this paper we try to apply some of these within a method for rigorous development of distributed systems. The development method is illustrated on a simplified version of a realistic application: a distributed calendar system.

Keywords

Temporal Logic Auxiliary Variable Proof System Safety Property External View 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Barringer 85]
    H. Barringer, R. Kuiper, and A. Pnueli: A Compositional Temporal Approach to a CSP-like Language. In proceedings of IFIP Conference: The Rôle of Abstract Models in Information Processing, Vienna 1985.Google Scholar
  2. [Bjørner 82]
    Dines Bjørner and Cliff B. Jones: Formal Specification and Software Development. Prentice-Hall International 1982.Google Scholar
  3. [Chandy 86]
    Mani Chandy and Jayadev Misra: An Example of Stepwise Refinement of Distributed Programs: Quiescence Detection. ACM Transactions on Programming Languages and Systems, Vol. 8, No. 3, pp. 326–346, July 1986.CrossRefGoogle Scholar
  4. [Chaochen 86]
    Zhou Chaochen and Ni Haichu: A Temporal Semantics of CSP and its Soundness. In proceedings of ICCC'86, Beijing, October 1986.Google Scholar
  5. [Dawids 86]
    Ulla Gamwell Dawids: On Principles for Rigorous Development of Distributed Systems. M.Sc. thesis, Department of Computer Science, Technical University of Denmark, August 1986.Google Scholar
  6. [Hoare 85]
    C.A.R. Hoare: Communicating Sequential Processes. Prentice-Hall International 1985.Google Scholar
  7. [Johnsson 85]
    Bengt Johnsson: A Model and Proof System for Asynchronous Networks. In proceedings of 4nd Annual ACM Symposium on Principles of Distributed Computing, August 1985.Google Scholar
  8. [Jones 80]
    Cliff B. Jones: Software Development: A Rigorous Approach. Prentice-Hall International 1980.Google Scholar
  9. [Koymans 83]
    R. Koymans, J. Vytopil, and W.P. de Roever: Real-time Programming and Asynchronous Message Passing. In proceedings of 2nd Annual ACM Symposium on Principles of Distributed Computing, Montreal, August 1983.Google Scholar
  10. [Lamport 82]
    Leslie Lamport: An Assertional Correctness Proof of a Distributed Algorithm. Science of Computer Programming, Vol. 2, pp. 175–206, 1982.CrossRefGoogle Scholar
  11. [Lamport 83a]
    Leslie Lamport: Specifying Concurrent Program Modules. ACM Transactions on Programming Languages and Systems, Vol. 2, No. 2, April 1983.Google Scholar
  12. [Lamport 83b]
    Leslie Lamport: What Good is Temporal Logic. In proceedings of IFIP'83, pp. 657–668, North-Holland 1983.Google Scholar
  13. [Nguyen 86]
    Van Nguyen, Alan Demers, David Gries, and Susan Owicki: A Model and Temporal Proof System for Networks of Processes. Distributed Computing, Vol. 1, No. 1, pp. 7–25, 1986.CrossRefGoogle Scholar
  14. [Stark 86]
    Eugene W. Stark: Proving Entailment Between Conceptual State Specifications. In proceedings of ESOP'86, Lecture Notes in Computer Science Vol. 213, pp. 197–209, Springer-Verlag 1986.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • Ulla Gamwell Dawids
    • 1
  • Hans Henrik Løvengreen
    • 1
  1. 1.Department of Computer ScienceTechnical University of DenmarkLyngbyDenmark

Personalised recommendations