Abstract
A proof system for a version of CCS with value-passing is proposed in which the reasoning about data is factored out from that about the structure of processes. The system is shown to be sound and complete for finite terms with respect to a denotational semantics based on Acceptance Trees.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Apt, K.: Proving Correctness of CSP Programs — A tutorial.Proceedings of IFIP Workshop on Protocol Specification, Testing and Verification V, M. Diaz (ed.), pp. 73–84, North-Holland, Amsterdam, 1986.
Dijkstra, E. W.:A Discipline of Programming. Prentice Hall, Englewood Cliffs, 1976.
Hennessy, M.: Acceptance Trees.Journal of the ACM,32 (4), 896–928 (1985).
Hennessy, M.:Algebraic Theory of Processes. MIT Press, Cambridge, 1988.
Hennessy, M and Ingolfsdottir, A.: A Theory of Communicating Processes with Value-passing. University of Sussex Technical Report No 3/89, 1989. Also presented at ICALP '90.
Hoare, C. A. R.: Communicating Sequential Processes.Communications of ACM,21 (8), 666–677 (1978).
Hoare, C. A. R.Communicating Sequential Processes. Prentice-Hall International, London, 1985.
Hoare, C. A. R. and Roscoe, A. W.: The Laws of Occam. PRG Monograph, Oxford University, 1986. (Also published inTheoretical Computer Science)
Milne, R.: Concurrency Models and Axioms. RAISE/STC/REM/6/V2, STC Technology Ltd., 1988.
Milner, R.:A Calculus of Communicating Systems. Lecture Notes in Computer Science 92, Springer-Verlag, Berlin, 1980.
Milner, R.:Calculus for Communication and Concurrency. Prentice-Hall, London 1989.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Hennessy, M. A proof system for communicating processes with value-passing. Formal Aspects of Computing 3, 346–366 (1991). https://doi.org/10.1007/BF01642508
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF01642508