Guarded commands, nondeterminacy and formal derivation of programs
Communications of the ACM
Design of a separable transition-diagram compiler
Communications of the ACM
Report on the algorithmic language ALGOL 60
Communications of the ACM
The specification of process synchronization by path expressions
Operating Systems, Proceedings of an International Symposium
SIMULA 67 common base language, (Norwegian Computing Center. Publication)
SIMULA 67 common base language, (Norwegian Computing Center. Publication)
The LDF 100: a large grain dataflow parallel processor
ACM SIGARCH Computer Architecture News
Programming the Loral LDF 100 dataflow machine
ACM SIGPLAN Notices
Distributed cooperation with action systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
OOPSLA/ECOOP '90 Proceedings of the European conference on object-oriented programming on Object-oriented programming systems, languages, and applications
Towards programming with knowledge expressions
POPL '86 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Q-Automata: Modelling the Resource Usage of Concurrent Components
Electronic Notes in Theoretical Computer Science (ENTCS)
Refinement for User Interface Designs
Electronic Notes in Theoretical Computer Science (ENTCS)
Algebraic Structure of Web Services
Electronic Notes in Theoretical Computer Science (ENTCS)
XMem: type-safe, transparent, shared memory for cross-runtime communication and coordination
Proceedings of the 2008 ACM SIGPLAN conference on Programming language design and implementation
Modular Functional Descriptions
Electronic Notes in Theoretical Computer Science (ENTCS)
SOC: a slicer for CSP specifications
Proceedings of the 2009 ACM SIGPLAN workshop on Partial evaluation and program manipulation
Goal-Equivalent Secure Business Process Re-engineering
Service-Oriented Computing - ICSOC 2007 Workshops
The MEB and CEB Static Analysis for CSP Specifications
Logic-Based Program Synthesis and Transformation
Mechanised Wire-wise Verification of Handel-C Synthesis
Electronic Notes in Theoretical Computer Science (ENTCS)
Proceedings of the 22nd Annual Symposium on Integrated Circuits and System Design: Chip on the Dunes
Analysing scientific workflows with Computational Tree Logic
Cluster Computing
A denotational semantics for Handel-C hardware compilation
ICFEM'07 Proceedings of the formal engineering methods 9th international conference on Formal methods and software engineering
UTP'08 Proceedings of the 2nd international conference on Unifying theories of programming
Model-based mutation testing of hybrid systems
FMCO'09 Proceedings of the 8th international conference on Formal methods for components and objects
A theory of mediators for eternal connectors
ISoLA'10 Proceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part II
An approach for describing concurrency and communication of heterogeneous systems
Proceedings of the Third Workshop on Behavioural Modelling
Mechanised wire-wise verification of Handel-C synthesis
Science of Computer Programming
Static slicing of explicitly synchronized languages
Information and Computation
Flexible Plan Verification: Feasibility Results
Fundamenta Informaticae - RCRA 2009 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
| Hi-index | 0.00 |
This paper suggests that input and output are basic primitives of programming and that parallel composition of communicating sequential processes is a fundamental program structuring method. When combined with a development of Dijkstra's guarded command, these concepts are surprisingly versatile. Their use is illustrated by sample solutions of a variety of familiar programming exercises.