Compositionality, concurrency and partial correctness
Compositionality, concurrency and partial correctness
REX workshop Proceedings on Stepwise refinement of distributed systems: models, formalisms, correctness
A Rely and Guarantee Method for Timed CSP: A Specification and Design of a Telephone Exchange
IEEE Transactions on Software Engineering
Communicating sequential processes
Communications of the ACM
Concurrency verification: introduction to compositional and noncompositional methods
Concurrency verification: introduction to compositional and noncompositional methods
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
Proofs of Networks of Processes
IEEE Transactions on Software Engineering
Weakest environment of communicating processes
AFIPS '82 Proceedings of the June 7-10, 1982, national computer conference
Chunks: component verification in CSP ∥ b
IFM'05 Proceedings of the 5th international conference on Integrated Formal Methods
| Hi-index | 0.00 |
We present a simple formulation of Assumption---Commitment reasoning using CSP (Communicating Sequential Processes). An assumption---commitment style property of a process SYS takes the form $COM \sqsubseteq SYS \| ASS $ , for `assumption' and `commitment' processes ASS and COM. We describe proof rules that allow derivation of assumption---commitment style properties of a composite system from such properties of its components, given appropriate side conditions. Most of the rules have a superficially appealing `homomorphic' quality: the overall assumption and commitment processes are composed similarly to the overall system. We also give a `non-homomorphic' rule that corresponds quite well to classical assumption---commitment rules. Antecedants and side conditions can be expressed as refinements and checked separately by the refinement-style model checker FDR. Examples illustrate application of our theory.