Compositionality, concurrency and partial correctness
Compositionality, concurrency and partial 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
Stepwise Refinement of Distributed Systems, Models, Formalisms, Correctness, REX Workshop
Proofs of Networks of Processes
IEEE Transactions on Software Engineering
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. In our formulation, an assumption-commitment style property of a process SYS takes the form COM @?SYS @?ASS, for some 'assumption' and 'commitment' processes ASS and COM. We state some proof rules that allow us to derive assumption-commitment style properties of a composite system from corresponding properties of its components, given appropriate side conditions. Most of the rules have a superficially appealing 'homomorphic' quality, in the sense that the overall assumption and commitment processes are composed similarly to the overall system. We also present a 'non-homomorphic' rule that corresponds quite well to proof rules of established assumption-commitment theory. The antecedants and side conditions are expressed as refinements that can be checked separately by the refinement-style model checker FDR. Examples are given to illustrate application of our theory.