Communicating sequential processes
Communicating sequential processes
Concurrent and Real Time Systems: The CSP Approach
Concurrent and Real Time Systems: The CSP Approach
ZB '02 Proceedings of the 2nd International Conference of B and Z Users on Formal Specification and Development in Z and B
Using a Process Algebra to Control B Operations
IFM '99 Proceedings of the 1st International Conference on Integrated Formal Methods
Reo: a channel-based coordination model for component composition
Mathematical Structures in Computer Science
How to Verify Dynamic Properties of Information Systems
SEFM '04 Proceedings of the Software Engineering and Formal Methods, Second International Conference
Composing specifications using communication
ZB'03 Proceedings of the 3rd international conference on Formal specification and development in Z and B
Combining CSP and b for specification and property verification
FM'05 Proceedings of the 2005 international conference on Formal Methods
Assumption-Commitment Support for CSP Model Checking
Electronic Notes in Theoretical Computer Science (ENTCS)
Automatic Generation of CSP || B Skeletons from xUML Models
Proceedings of the 5th international colloquium on Theoretical Aspects of Computing
Assumption---Commitment Support for CSP Model Checking
Journal of Automated Reasoning
Investigating a new formal model for a library system using B method
ACM SIGSOFT Software Engineering Notes
ABZ'10 Proceedings of the Second international conference on Abstract State Machines, Alloy, B and Z
An optimization approach for effective formalized fUML model checking
SEFM'12 Proceedings of the 10th international conference on Software Engineering and Formal Methods
| Hi-index | 0.00 |
CSP ∥ B is an approach to combining the process algebra CSP with the formal development method B, enabling the formal description of systems involving both event-oriented and state-oriented aspects of behaviour. The approach provides architectures which enable the application of CSP verification tools and B verification tools to the appropriate parts of the overall description. Previous work has considered how large descriptions can be verified using coarse grained component parts. This paper presents a generalisation of that work so that CSP ∥ B descriptions can be decomposed into finer grained components, chunks, which focus on demonstrating the absence of particular divergent behaviour separately. The theory underpinning chunks is applicable not only to CSP ∥ B specification but to CSP specifications. This makes it an attractive technique to decomposing large systems for analysing with FDR.