A Proof System for Communicating Sequential Processes
ACM Transactions on Programming Languages and Systems (TOPLAS)
Specifying Concurrent Program Modules
ACM Transactions on Programming Languages and Systems (TOPLAS)
Communicating sequential processes
Communications of the ACM
A relational model of data for large shared data banks
Communications of the ACM
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Verifying Concurrent Processes Using Temporal Logic
Verifying Concurrent Processes Using Temporal Logic
Mechanisms for compile-time enforcement of security
POPL '83 Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
On the composition of processes
POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Constructing Distributed Systems in Conic
IEEE Transactions on Software Engineering
A comparison of the object-oriented and process paradigms
OOPWORK '86 Proceedings of the 1986 SIGPLAN workshop on Object-oriented programming
High-level language support for programming distributed systems
CASCON '91 Proceedings of the 1991 conference of the Centre for Advanced Studies on Collaborative research
| Hi-index | 0.00 |
This paper is a summary of ongoing research activities related to the programming language NIL, a high level language for concurrent and distributed systems developed at IBM Yorktown.We first present a short summary of the major features of NIL. These include the NIL system model, which is a dynamically evolving network of loosely coupled processes, communicating by message passing; the abstract NIL computation model; and typestate, which is a refinement of type systems allowing a compiler to assume an important subset of program validation.We then discuss issues related to providing a semantic theory for NIL, and list some general requirements a semantic model should satisfy to be applicable to practical concurrent and distributed systems. We discuss the fit between CCS, which we are studying as a possible candidate for such a semantic theory, and these requirements.Finally we describe some recent work on transformations which map NIL programs to efficient distributed and parallel implementations.