Abstract
A compositional proof system is given for an OCCAM-like real-time programming language for distributed computing with communication via synchronous message passing. This proof system is based on specifications of processes which are independent of the program text of these processes. These specifications state (1) the assumptions of a process about the behaviour of its environment, and (2) the commitments of that process towards that environment provided these assumptions are met. The proof system is sound w.r.t a denotational semantics which incorporates assumptions regarding actions of the environment, thereby closely approximating the assumption/commitment style of reasoning on which the proof system is based. Concurrency is modelled as "maximal parallelism"; that is, if a process can proceed it will do so immediately. A process only waits when no local action is possible and no partner is available for communication. This maximality property is imposed on the domain of interpretation of assertions by postulating it as separate axiom. The timing behaviour of a system is expressed from the viewpoint of a global external observer, so there is a global notion of time. Time is not necessarily discrete.
supported by Esprit Project 937: Debugging and Specification of Ada Real-Time Embedded Systems (DESCARTES).
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
A. References
de Bakker, J.W., Mathematical Theory of Program Correctness, Prentice Hall, (1980).
Francez, N., Lehman, D., Pnueli, A., A Linear History Semantics for Distributed Programming, TCS 32, (1984), 25–46.
Glass, R.L., The "Lost world" of Software Debugging and Testing, CACM 23, (1980), 264–271.
Hoare, C.A.R., Communicating Sequential Processes, CACM 21, (1978), 666–677.
Hooman, J., A Compositional Proof Theory for Real-Time Distributed Message Passing, Tech. Report CSN86/10, Eindhoven University of Technology, (1987).
Hooman, J., de Roever, W.P., The quest goes on: a survey of proof systems for partial correctness of CSP, Current Trends in Concurrency, LNCS 224, (1986), 343–395.
Huizing, C., Gerth, R., de Roever, W.P., Full Abstraction of a Real-Time Denotational Semantics for an OCCAM-like Language, POPL 87, (1987), 223–237.
Koymans, R., Shyamasundar, R.K., de Roever, W.P., Gerth, R., Arun-Kumar, S., Compositional Semantics for Real-Time Distributed Computing, Report no. 68, University of Nijmegen, to appear in Information and Control, (1986).
Lamport, L., What Good Is Temporal Logic?, Information Processing 83, R.E. Manson (ed.), North Holland, (1983), 190–222.
Zwiers, J., Ph.D. Thesis, to appear, Eindhoven University of Technology, (June 1987).
Zwiers, J., de Bruin, A., de Roever, W.P., A proof system for partial correctness of dynamic networks, Logics of Programs 83, LNCS 164, (1983).
Zwiers, J., de Roever, W.P., van Emde Boas, P., Compositionality and concurrent networks: soundness and completeness of a proofsystem, Report no. 57, University of Nijmegen, (1984).
Zwiers, J., de Roever, W.P., van Emde Boas, P., Compositionality and concurrent networks: soundness and completeness of a proofsystem, ICALP 85, LNCS 194, (1985).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hooman, J. (1987). A compositional proof theory for real-time distributed message passing. 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_18
Download citation
DOI: https://doi.org/10.1007/3-540-17945-3_18
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