ACM Transactions on Programming Languages and Systems (TOPLAS)
Output Guards and Nondeterminism in “Communicating Sequential Processes”
ACM Transactions on Programming Languages and Systems (TOPLAS)
A Proof System for Communicating Sequential Processes
ACM Transactions on Programming Languages and Systems (TOPLAS)
Communicating sequential processes
Communications of the ACM
The Science of Programming
A Discipline of Programming
Principles for Distributing Programs
Proceedings of the International Sympoisum on Semantics of Concurrent Computation
Information systems: Modelling, sequencing and transformations
ICSE '78 Proceedings of the 3rd international conference on Software engineering
Hi-index | 0.00 |
Today's technological and economic profile make it desirable to attempt distributed solutions for a majority of computing tasks. In this paper we describe a scheme by which a sequential program can be transformed into a weakly equivalent distributed program. This transformation can, in principle, be automated and is applicable to any program written in a sequential guarded command language. The sequential program to be transformed must be accompanied by a disjoint yet complete partitioning of its variables into n sets; thereafter the program can be transformed into a system of n communicating processes written in CSP.