Communicating sequential processes
Communicating sequential processes
A theoretical basis for stepwise refinement and the programming calculus
Science of Computer Programming
Compositionality, concurrency and partial correctness
Compositionality, concurrency and partial correctness
Programming from specifications
Programming from specifications
A Weaker Precondition for Loops
ACM Transactions on Programming Languages and Systems (TOPLAS)
A Unified Model for CSP-like Languages with Specifications
Proceedings of the IFIP TC6 Eighth International Conference on Formal Description Techniques VIII
Denotational Semantics for occam
Seminar on Concurrency, Carnegie-Mellon University
An Improved Failures Model for Communicating Processes
Seminar on Concurrency, Carnegie-Mellon University
A refinement calculus for communicating processes with state
IW-FM'97 Proceedings of the 1st Irish conference on Formal Methods
| Hi-index | 0.00 |
The main contribution of this paper is the introduction of unbounded nondeterminism into CSP-like languages with specification, which increases the expressive power of the specification language. This is achieved by extending the finite message set of such mixed languages to an infinite one. A denotational semantics and a refinement order are defined for such a language and the CSP constructors are proved to be monotone on the specification space and continuous on the process space, which are needed for a simple treatment of iterations on both spaces of the mixed CSP-like language.