Communicating sequential processes

Hoare, C. A. R.

doi:10.1145/359576.359585

Cited by 3,573 publications

(1,055 citation statements)

References 7 publications

Supporting

Mentioning

1,022

Contrasting

Unclassified

Order By: Relevance

“…In particular, a communication-based distributed programming language such as CSP [Hoa78] may be axiomatized if we modify the class of assertions to represent the potential for communication and if we design a suitable parallel composition of assertions. When adapting these ideas to a language like CSP it becomes vital to record at least a vestige of the syntax of actions in assertion structure, so that we may ensure that parallel composition of assertions models synchronization appropriately.…”

Section: Discussionmentioning

confidence: 99%

An Axiomatic Treatment of Partial Correctness and Deadlock in a Shared Variable Parallel Language

Brookes¹

1992

View full text Add to dashboard Cite

We give a semantically based axiomatic treatment of partial correctness and deadlock for an imperative shared variable parallel programming language. The Owicki-Gries proof methodology for this language proves conventional Hoare-style partial correctness assertions and involves the notion of interference-freedom of proofs (to guarantee soundness), auxiliary variables (to guarantee relative completeness), and global invariants (to permit reasoning about deadlock-freedom). Our axiomatic proof system is based more explicitly on the underlying operational semantics, using assertions whose syntactic structure directly reflects the operational behavior of parallel programs at an appropriate level of abstraction. We build a proof system that requires neither interferencefreedom nor auxiliary variables. Novel features include the use of a syntactic form of parallel composition of assertions, and the use of conjunction and implication as connectives on assertions. It is possible simultaneously to reason about partial correctness and deadlock-freedom using our proof system, without recourse to global invariants. We discuss some non-trivial examples, and compare our proof methodology with some other proof methods from the literature.

show abstract

Section: Discussionmentioning

confidence: 99%

An Axiomatic Treatment of Partial Correctness and Deadlock in a Shared Variable Parallel Language

Brookes¹

1992

View full text Add to dashboard Cite

show abstract

“…The Proteus provides high-level language interface which is a translator for Communication Sequential Process (CSP) [17]. The Proteus focuses on the dual-rail domino logic based on pre-charged half-buffer (PCHB) custom cells, in order to get high-performance [18].…”

Section: Related Workmentioning

confidence: 99%

Design of a clockless MSP430 core using mixed asynchronous design flow

Shin¹,

Oh²,

Lee

et al. 2017

IEICE Electron. Express

View full text Add to dashboard Cite

There are various limitations on the supporting tools and design methodologies for the implementation of an asynchronous delay-insensitive model. In this paper, we propose a new design flow by exploiting a mixed model, which combines a bounded delay model and a delay-insensitive model. To develop the design flow, we use an asynchronous finite-state machine for the bounded delay model and the null convention logic for the delay-insensitive model. Further, we designed an MSP430 core to verify the proposed design flow and the results of simulation show that it exhibits a performance improvement of 30.34% over its synchronous counterpart.

show abstract

“…But for message-passing models, although it have been extensively studied using various process calculi [7,14,16], fewer Hoare-style state-based reasoning systems are developed, especially systems supporting modular reasoning. These are the main focus of our work.…”

Section: Lamport's Graph Modelmentioning

confidence: 99%

“…For the message-passing models, there exist many well-known works on process calculi, e.g., CSP (Communicating Sequential Figure 16: Leader Election: Proof Processes) [7], CCS (Calculus of Communicating System) [13], π-calculus [15], and KPN (Kahn Process Network) [9]. However, those algebraic systems focus mainly on the agent behavior deductions and equivalence, e.g., bisimulation.…”

Section: Related Work and Conclusionmentioning

confidence: 99%

Rely-Guarantee Based Reasoning for Message-Passing Programs

Lei¹,

Qiu²

2014

SACS

View full text Add to dashboard Cite

The difficulties of verifying concurrent programs lie in their inherent non-determinism and interferences. Rely-Guarantee reasoning is one useful approach to solve this problem for its capability in formally specifying inter-thread interferences. However, modern verification requires better locality and modularity. It is still a great challenge to verify a message-passing program in a modular and composable way.In this paper, we propose a new reasoning system for messagepassing programs. It is a novel logic that supports Hoare style triples to specify and verify distributed programs modularly. We concretize the concept of event traces to represent interactions among distributed agents, and specify behaviors of agents by their local traces with regard to environmental assumptions -an idea inspired by Rely-Guarantee reasoning. Based on trace semantics, the verification is compositional in both temporal and spatial dimensions. To show validity, we apply our logic to modularly prove several examples.

show abstract

Communicating sequential processes

Abstract: A mathematical model for communicating sequential processes is given, and a number of its interesting and useful properties are stated and proved. The possibilities of nondetermimsm are fully taken into account.

Cited by 3,573 publications

References 7 publications

An Axiomatic Treatment of Partial Correctness and Deadlock in a Shared Variable Parallel Language

An Axiomatic Treatment of Partial Correctness and Deadlock in a Shared Variable Parallel Language

Design of a clockless MSP430 core using mixed asynchronous design flow

Rely-Guarantee Based Reasoning for Message-Passing Programs

Contact Info

Product

Resources

About