Nothing Special   »   [go: up one dir, main page]

skip to main content
research-article
Open access

A proof system for communicating processes with value-passing

Published: 01 October 1991 Publication History

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.

References

References

[1]
Apt K. Diaz M. Proving Correctness of CSP Programs — A tutorial 1986 Amsterdam North-Holland 73-84
[2]
Dijkstra E. W. A Discipline of Programming 1976 Englewood Cliffs Prentice Hall
[3]
Hennessy M. Acceptance Trees Journal of the ACM 1985 32 4 896-928
[4]
Hennessy M. Algebraic Theory of Processes 1988 Cambridge MIT Press
[5]
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.
[6]
Hoare C. A. R. Communicating Sequential Processes Communications of ACM 1978 21 8 666-677
[7]
Hoare C. A. R. Communicating Sequential Processes 1985 London Prentice-Hall International
[8]
Hoare, C. A. R. and Roscoe, A. W.: The Laws of Occam. PRG Monograph, Oxford University, 1986. (Also published inTheoretical Computer Science)
[9]
Milne, R.: Concurrency Models and Axioms. RAISE/STC/REM/6/V2, STC Technology Ltd., 1988.
[10]
Milner R. A Calculus of Communicating Systems Lecture Notes in Computer Science 92 1980 Berlin Springer-Verlag
[11]
Milner R. Calculus for Communication and Concurrency 1989 London Prentice-Hall

Cited By

View all

Index Terms

  1. A proof system for communicating processes with value-passing
              Index terms have been assigned to the content through auto-classification.

              Recommendations

              Comments

              Please enable JavaScript to view thecomments powered by Disqus.

              Information & Contributors

              Information

              Published In

              cover image Formal Aspects of Computing
              Formal Aspects of Computing  Volume 3, Issue 4
              Oct 1991
              66 pages
              ISSN:0934-5043
              EISSN:1433-299X
              Issue’s Table of Contents

              Publisher

              Springer-Verlag

              Berlin, Heidelberg

              Publication History

              Published: 01 October 1991
              Accepted: 15 February 1991
              Received: 15 July 1990
              Published in FAC Volume 3, Issue 4

              Author Tags

              1. Algebraic laws
              2. Value-passing
              3. CCS
              4. Completeness

              Qualifiers

              • Research-article

              Contributors

              Other Metrics

              Bibliometrics & Citations

              Bibliometrics

              Article Metrics

              • Downloads (Last 12 months)17
              • Downloads (Last 6 weeks)1
              Reflects downloads up to 14 Dec 2024

              Other Metrics

              Citations

              Cited By

              View all

              View Options

              View options

              PDF

              View or Download as a PDF file.

              PDF

              eReader

              View online with eReader.

              eReader

              Login options

              Full Access

              Media

              Figures

              Other

              Tables

              Share

              Share

              Share this Publication link

              Share on social media