| |
Browse All Reviews > Software (D) > Programming Techniques (D.1) > Concurrent Programming (D.1.3) > Csp (D.1.3...)
|
|
 |
|
|
| |
|
|
| |
1-9 of 9
Reviews about "Csp (D.1.3...)":
|
Date Reviewed |
| |
Understanding concurrent systems
Roscoe A., Springer-Verlag New York, Inc., New York, NY, 2010. 533 pp. Type: Book (978-1-848822-57-3)
The design of concurrent and distributed systems has been a challenging task since the early ages of computing. This challenging task has gained increasing importance due to the ubiquity of concurrent and distributed systems, ranging f...
|
May 2 2011 |
| |
Specification and proof in real-time CSP
Davies J., Cambridge University Press, New York, NY, 1993. Type: Book (9780521450553)
The field of distributed computing witnessed a major breakthrough in the 1980s when the language of Communicating Sequential Processes (CSP) and its associated failures model were invented. By considering only sequences of observable ...
|
Jul 1 1994 |
| |
A Generalized Message-Passing Mechanism for Communicating Sequential Processes
Lenders P. IEEE Transactions on Computers 37(6): 646-651, 1988. Type: Article
The message-passing mechanism described by this paper is called “bi-io,” which is short for “bidirectional message passing.” The novelty of bi-io is its paradigm of a simultaneous exchange of mes...
|
Jun 1 1989 |
| |
Two complete axiom systems for a theory of communicating sequential processes
de Nicola R. Information and Control 64(1-3): 136-172, 1985. Type: Article
The first part of this paper presents a set of axioms which is shown to be complete relative to the “refusals set” semantics of Brookes et al. [1] for a CSP-like language. In the second part, slightly different sema...
|
Oct 1 1986 |
| |
Automatic construction of CSP programs from sequential non-deterministic programs
Moitra A. Science of Computer Programming 5(3): 277-307, 1985. Type: Article
This paper deals with a very difficult problem: the design of concurrent/distributed programs. The author suggests a systematic approach to the subject--decentralization of sequential programs. The decentralization is o...
|
May 1 1986 |
| |
Post-failure reconfiguration of CSP programs
Shatz S. (ed) IEEE Transactions on Software Engineering SE-11(10): 1193-1202, 1985. Type: Article
This paper poses an interesting question and goes some way towards suggesting a solution. The question is how to combine concurrent sequential processes into a single sequential process. The purpose is to be prepared for reconfiguratio...
|
Apr 1 1986 |
| |
Axiomatic semantics of communicating sequential processes
Soundararajan N. ACM Transactions on Programming Languages and Systems 6(4): 647-662, 1984. Type: Article
The author gives a proof system for CSP that involves the following procedures:...
|
Jul 1 1985 |
| |
Modeling the distributed termination convention of CSP
Apt K. (ed), Francez N. ACM Transactions on Programming Languages and Systems 6(3): 370-379, 1984. Type: Article
Communication Sequential Processes (CSP) [1], a language for distributed programming, uses guarded Boolean expressions to control intraprocess repetition and interprocess communication. In the original CSP, an attempt by a process,
|
May 1 1985 |
| |
Communicating Sequential Processes for Centralized and Distributed Operating System Design
Hull M., McKeag R. ACM Transactions on Programming Languages and Systems 6(2): 175-191, 1984. Type: Article
This paper promises a methodology for operating systems design based on Hoare’s Communicating Sequential Processes (CSP) notation [1]. The methodology developed for distributed resources consists of the following processes, ...
|
Mar 1 1985 |
| |
|
|
| |
|
|
