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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
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.
Dines Bjørner and Cliff B. Jones: Formal Specification and Software Development. Prentice-Hall International 1982.
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.
Zhou Chaochen and Ni Haichu: A Temporal Semantics of CSP and its Soundness. In proceedings of ICCC'86, Beijing, October 1986.
Ulla Gamwell Dawids: On Principles for Rigorous Development of Distributed Systems. M.Sc. thesis, Department of Computer Science, Technical University of Denmark, August 1986.
C.A.R. Hoare: Communicating Sequential Processes. Prentice-Hall International 1985.
Bengt Johnsson: A Model and Proof System for Asynchronous Networks. In proceedings of 4nd Annual ACM Symposium on Principles of Distributed Computing, August 1985.
Cliff B. Jones: Software Development: A Rigorous Approach. Prentice-Hall International 1980.
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.
Leslie Lamport: An Assertional Correctness Proof of a Distributed Algorithm. Science of Computer Programming, Vol. 2, pp. 175–206, 1982.
Leslie Lamport: Specifying Concurrent Program Modules. ACM Transactions on Programming Languages and Systems, Vol. 2, No. 2, April 1983.
Leslie Lamport: What Good is Temporal Logic. In proceedings of IFIP'83, pp. 657–668, North-Holland 1983.
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.
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.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dawids, U.G., Løvengreen, H.H. (1987). Rigorous development of a distributed calendar system. In: de Bakker, J.W., Nijman, A.J., Treleaven, P.C. (eds) PARLE Parallel Architectures and Languages Europe. PARLE 1987. Lecture Notes in Computer Science, vol 259. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-17945-3_11
Download citation
DOI: https://doi.org/10.1007/3-540-17945-3_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-17945-0
Online ISBN: 978-3-540-47181-3
eBook Packages: Springer Book Archive