Abstract
We introduced a formal proof system for dynamic networks of processes, which has been shown to be sound. Future work will consider the completeness of the system.
Preview
Unable to display preview. Download preview PDF.
References
Apt, K.R., Francez, N. and de Roever, W.P. "A proof System for Communicating Sequential Processes" TOPLAS 2,3. July 1980.
Chen, Z.C. and Hoare, C.A.R. "Partial Correctness of Communicating Sequential Processes." 2nd International Conference on Distributed Computer Systems, IEEE 1981, 1–12.
Misra, J. and Chandy, K.M. "Proofs of Networks of Processes", IEEE Transactions on Software Engineering, July 1981.
Soundararajan, N. and Dahl, O.J. "Partial Correctness Semantics of Communicating Sequential Processes"
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1984 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zwiers, J., de Bruin, A., de Roever, W.P. (1984). A proof system for partial correctness of dynamic networks of processes. In: Clarke, E., Kozen, D. (eds) Logics of Programs. Logic of Programs 1983. Lecture Notes in Computer Science, vol 164. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-12896-4_384
Download citation
DOI: https://doi.org/10.1007/3-540-12896-4_384
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-12896-0
Online ISBN: 978-3-540-38775-6
eBook Packages: Springer Book Archive