Abstract
We present a Hoare logic for distributed systems composed of processes which communicate asynchronously via (unbounded) FIFO buffers. The calculus is based on an assertion language which allows the specification of the communication interface of a process at a high level of abstraction. As such our formalism serves well as a basis for refinement and top-down development of distributed systems composed of asynchronously communicating processes. Moreover, we show that the first-order logic underlying the interface-specification language is decidable, which makes (semi-) automated verification more feasible.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
P.H.M. America and F.S. de Boer. Reasoning about dynamically evolving process structures. Formal Aspects of Computing, 6:269–316, 1994.
K.R. Apt, N. Francez, and W.-P. de Roever. A proof system for communicating sequential processes. ACM-TOPLAS, 2(3):359–385, 1980.
Gregory R. Andrews. Concurrent Programming, Principles and Practice. The Benjamin/Cummings Publishing Company, Inc., 1991.
R.J.R. Back. Correctness Preserving Program Refinements: Proof Theory and Applications. Number 131 in Mathematical Centre Tracts. Mathematical Centre, Amsterdam, 1980.
F.S. de Boer and M. van Hulst. A proof system for asynchronously communicating deterministic processes. In B. Rovan I. Prívara and P. Ružička, editors, Proc. MFCS '94, volume 841 of Lecture Notes in Computer Science, pages 256–265. Springer-Verlag, 1994.
N. Francez. Program Verification. Addison Wesley, 1992.
David Gries. The Science of Programming. Texts and Monographs in Computer Science. Springer, 4th print edition, 1987.
J. Hooman and W.-P. de Roever. The quest goes on: a survey of proof systems for partial correctness of CSP. In Current trends in concurrency, volume 24 of Lecture Notes in Computer Science, pages 343–395. Springer-Verlag, 1986.
B. Jonsson. A fully abstract trace model for dataflow networks. In Proc. POPL '89, 1989.
M.B. Josephs. Receptive process theory. Acta Informatica, 29, 1992.
S. Owicki and D. Gries. An axiomatic proof technique for parallel programs I. Acta Informatica, 6:319–340, 1976.
P.K. Pandya. Compositional Verification of Distributed Programs. PhD thesis, Tata Institute of Fundamental Research, Homi Bhabha Road, Bombay 400 005, INDIA, 1988.
J. Rushby S. Owre and N. Shankar. PVS: A prototype verification system. In 11th Conference on Automated Deduction, volume 607 of Lecture Notes in Artificial Intelligence, pages 748–752. Springer-Verlag, 1992.
J. Zwiers. Compositionality, Concurrency and Partial Correctness. PhD thesis, Technical University Eindhoven, 1988.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
de Boer, F.S., van Hulst, M. (1995). A compositional proof system for asynchronously communicating processes. In: Möller, B. (eds) Mathematics of Program Construction. MPC 1995. Lecture Notes in Computer Science, vol 947. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60117-1_11
Download citation
DOI: https://doi.org/10.1007/3-540-60117-1_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60117-3
Online ISBN: 978-3-540-49445-4
eBook Packages: Springer Book Archive