Summary
A partial correctness proof system for Brinch Hansen's Distributed Processes (DP) is presented. Two important aspects of the system are: Proofs of individual processes of a DP program are completely isolated from each other; in particular, no assumptions are allowed in the proof of one process about the behavior of the other processes. Secondly a process is characterized by its externally visible behavior, i.e. the sequence of interactions between this process and the other processes of the program. An example demonstrates the use of the system.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Apt, K.R., Francez, N., de Roever, W.P.: A Proof System for Communicating Sequential Processes. ACM TOPLAS 2, 359–385 (1980)
Brinch Hansen, P.: Distributed Processes: A Concurrent Programming Concept. Commun. ACM 21, 934–941 (1978)
Dijkstra, E.W.: Guarded Commands, Nondeterminancy and the Formal Derivation of Programs. Commun. ACM 18, 453–457 (1975)
Gerth, R., de Roever, W.P., Roncken, M.: Procedures and Concurrency: A Study in Proof. Proceedings of the 5th International Symposium on Programming. Lect. Notes Comput. Sci. Vol 137. pp. 132–163. Berlin, Heidelberg, New York: Springer 1982
Hoare, C.A.R.: An Axiomatic Basis for Computer Programming. Commun. ACM 12, 576–580, 583 (1969)
Lamport, L., Schneider, F. B.: The ‘Hoare Logic’ of CSP, and All That. ACM TOPLAS 6, 281–296 (1984)
Levin, G.M., Gries, D.: A Proof Technique for Communicating Sequential Processes. ACTA Inf. 15, 281–302 (1981)
Misra, J., Chandy, K.M.: Proofs of Networks of Processes. IEEE Trans. Software Eng. 7, 417–426 (1981)
Misra, J., Chandy, K.M., Smith, T.: Proving Safety and Liveness of Communicating Processes With Examples. PODC 1, 201–208 (1982)
Owicki, S.S., Gries, D.: An Axiomatic Proof Technique for Parallel Programs. ACTA Inf. 6, 319–340 (1976)
Sobel, A.E.K.: Modular Verification of Concurrent Systems, Ph.D. Dissertation, The Ohio State University, August 1986
Soundararajan, N.: Liveness of CSP Programs. Technical Report, Department of Computer and Information Science, The Ohio State University, 1987
Soundararajan, N., Dahl, O.J.: Partial Correctness Semantics for CSP. Technical Report, University of Oslo, February 1982
Zwiers, J., de Roever, W.P., van Emde Boas, P.: Compositionality and Concurrent Networks: Soundness and Completeness of a Proof System. ICALP. Lect. Notes Comput. Sci., Vol. 194, pp. 509–519. Berlin, Heidelberg, New York: Springer 1985
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Sobel, A.E.K., Soundararajan, N. A proof system for distributed processes. Acta Informatica 25, 305–332 (1988). https://doi.org/10.1007/BF00283331
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00283331