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 sound and complete with respect to a denotational semantics based on Acceptance Trees.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
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.
Brinksma, E. “A Tutorial on LOTOS.” Proceedings of Control Flow and Data Flow: Concepts of Distributed Programming NATO ASI Series, Vol F14, edited by M.Broy, Springer-Verlag, 1985.
Dijkstra, E.W., A discipline of Programming Prentice Hall, Englewood Cliffs, 1976.
DeNicola, R. and M. Hennessy. “Testing Equivalences for Processes.” Theoretical Computer Science, 24, 1984, pp. 83–113.
Guessarian, I., “Algebraic Semantics”, Springer-Verlag Lecture Notes in Computer Science, vol.99, 1981.
Hennessy, M. and Plotkin, G., “A Term Model for CCS”, Springer-Verlag Lecture Notes in Computer Science, vol.88, 1980.
Hennessy, M. “Acceptance Trees.” Journal of the ACM, v. 32, n. 4, October 1985, pp. 896–928.
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.
Hoare, C.A.R. Communicating Sequential Processes. Prentice-Hall International, London, 1985.
Hoare, C.A.R. “Communicating Sequential Processes” Communications of ACM, 21, no 8, pp. 666–677, 1978.
Hoare, C.A.R. and Roscoe, A.W., “The Laws of Occam” PRG Monograph, Oxford University, 1986. (Also published in Theoretical Computer Science)
Inmos Ltd., The Occam Programming Manual, Prentice-Hall, London, 1984.
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.
Plotkin, G., “Lecture Notes in Domain Theory”, University of Edinburgh, 1981.
Roscoe, A.W., “Denotational Semantics for Occam”, PRG Monograph, Oxford University, 1988.
Schmidt, D., Denotational Semantics, Allen and Bacon, 1986.
Smyth, M. and Plotkin, G., “The Category-Theoretic Solution of Recursive Domain Equations”, SIAM Journal on Computing, vol.11, No.4, 1982.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hennessy, M. (1989). A proof system for communicating processes with value-passing (extended abstract). In: Veni Madhavan, C.E. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1989. Lecture Notes in Computer Science, vol 405. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52048-1_54
Download citation
DOI: https://doi.org/10.1007/3-540-52048-1_54
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52048-1
Online ISBN: 978-3-540-46872-1
eBook Packages: Springer Book Archive