Abstract
Specification, construction and verification of programs should be done in a compositional way. This means that for each syntactic programming construct it should be possible to infer a specification for the whole construct from specifications of the constituent syntactic components of that construct. A compositional proofsystem is presented for a language that includes parallel executing networks and recursive creation of subnetworks. This system is then shown to be arithmetically complete.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Apt, K.R., Francez, N, de Roever, W.P. A proofsystem for Communicating Sequential Processes. TOPLAS 2 (3) '80
Barringer, H. Kuiper, R. A temporal logic specification method supporting hierarchical development.
Broy, M. Fixed point theory for communication and concurrency. Proc. of IFIP conf. on formal description of prog. concepts II, '82
Bruin, A. de and Bohm, A.P.W. The denotational semantics of dynamic networks of processes. report RUU-CS-82-13, University of Utrecht.
Chen, Z., Hoare, C.A.R. Partial correctness of CSP. IEEE Int. Conf. on Dist. Comp. Systems '81.
Clarke,E.M. Programming constructs for which it is impossible to obtain good Hoare like axiom systems. JACM 26 (1) jan '79.
Francez, N., Lehman, D. and Pneuli, A. A linear History Semantics for Distributed languages. Proc. IEEE FOCS Sympsoium '80.
Lamport, L. The Hoare Logic of concurrent programs. Acta Informatica 14 '80
Misra, J. and Chandy, M. Proofs of Networks of Processes. IEEE SE 7 (4) '81.
Misra, J. Reasoning about Networks of Communicating Processes. INRIA Advanced Nato Study Institute on Logics and Models for Verification and Specification of Concurrent Systems '84
Milner, R. A Calculus of Communicating Systems. Springer LNCS 92 '80.
Owicki, S. and Gries, D. An axiomatic proof technique for parallel programs. Acta Informatica 6 '76.
Olderog, E.R. and Hoare, C.A.R. Specification oriented semantics for communicating processes. Proc. of the 10th ICALP conference '83 LNCS 154.
Olderog, E.R. Specification oriented programming in TCSP. INRIA Advanced Nato Study Institute on Logics and Models for Verification and Specification of Concurrent Systems '84
Pnueli, A. Compositional verification of concurrent programs using temporal logic. INRIA Advanced Nato Study Institute on Logics and Models for Verification and Specification of Concurrent Systems '84
Zwiers, J. de Bruin, A. de Roever, W.P. A proof system for partial correctness of Dynamic Networks of Processes Proc. of Conference on Logics of Programs, '83, LNCS 164 '84.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zwiers, J., de Roever, W.P., van Emde Boas, P. (1985). Compositionality and concurrent networks: Soundness and completeness of a proofsystem. In: Brauer, W. (eds) Automata, Languages and Programming. ICALP 1985. Lecture Notes in Computer Science, vol 194. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0015776
Download citation
DOI: https://doi.org/10.1007/BFb0015776
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-15650-5
Online ISBN: 978-3-540-39557-7
eBook Packages: Springer Book Archive