Communicating sequential processes
Communicating sequential processes
Beauty is our business
The B-book: assigning programs to meanings
The B-book: assigning programs to meanings
Concurrent and Real Time Systems: The CSP Approach
Concurrent and Real Time Systems: The CSP Approach
An Approach to the Design of Distributed Systems with B AMN
ZUM '97 Proceedings of the 10th International Conference of Z Users on The Z Formal Specification Notation
ZB '00 Proceedings of the First International Conference of B and Z Users on Formal Specification and Development in Z and B
csp2B: A Practical Approach to Combining CSP and B
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume I - Volume I
Using a Process Algebra to Control B Operations
IFM '99 Proceedings of the 1st International Conference on Integrated Formal Methods
Supplementing a UML Development Process with B
FME '02 Proceedings of the International Symposium of Formal Methods Europe on Formal Methods - Getting IT Right
Specifying and analyzing security automata using CSP-OZ
ASIACCS '07 Proceedings of the 2nd ACM symposium on Information, computer and communications security
Towards Validating a Platoon of Cristal Vehicles Using CSP||B
AMAST 2008 Proceedings of the 12th international conference on Algebraic Methodology and Software Technology
Extending Formal Methods for Software-Intensive Systems
Software-Intensive Systems and New Computing Paradigms
Efficient symbolic computation of process expressions
Science of Computer Programming
Linking Semantic Models to Support CSP () B Consistency Checking
Electronic Notes in Theoretical Computer Science (ENTCS)
Composing specifications using communication
ZB'03 Proceedings of the 3rd international conference on Formal specification and development in Z and B
Slicing concurrent real-time system specifications for verification
IFM'07 Proceedings of the 6th international conference on Integrated formal methods
Scaling up with event-B: a case study
NFM'11 Proceedings of the Third international conference on NASA Formal methods
Automatic refinement checking for b
ICFEM'05 Proceedings of the 7th international conference on Formal Methods and Software Engineering
Slicing an integrated formal method for verification
ICFEM'05 Proceedings of the 7th international conference on Formal Methods and Software Engineering
ABZ'10 Proceedings of the Second international conference on Abstract State Machines, Alloy, B and Z
Operational semantics for model checking circus
FM'05 Proceedings of the 2005 international conference on Formal Methods
ZB'05 Proceedings of the 4th international conference on Formal Specification and Development in Z and B
A stepwise development of the peterson's mutual exclusion algorithm using b abstract systems
ZB'05 Proceedings of the 4th international conference on Formal Specification and Development in Z and B
Model transformations incorporating multiple views
AMAST'06 Proceedings of the 11th international conference on Algebraic Methodology and Software Technology
Modelling and proof analysis of interrupt driven scheduling
B'07 Proceedings of the 7th international conference on Formal Specification and Development in B
Chunks: component verification in CSP ∥ b
IFM'05 Proceedings of the 5th international conference on Integrated Formal Methods
Relaxing b sharing restrictions within CSP||B
SC'12 Proceedings of the 11th international conference on Software Composition
Architecture-centric fault tolerance with exception handling
LADC'07 Proceedings of the Third Latin-American conference on Dependable Computing
Testing with inputs and outputs in CSP
FASE'13 Proceedings of the 16th international conference on Fundamental Approaches to Software Engineering
| Hi-index | 0.00 |
This paper describes a way of using the process algebra CSP to enable controlled interaction between B machines. This approach supports compositional verification: each of the controlled machines, and the combination of controller processes, can be analysed and verified separately in such a way as to guarantee correctness of the combined communicating system. Reasoning about controlled machines separately is possible due to the introduction of guards and assertions into description of the controller processes in order to capture assumptions about other controlled machines and provide guarantees to the rest of the system. The verification process can be completely supported by different tools. The use of separate controller processes facilitates the iterative development and analysis of complex control flows within the system. The approach is motivated and illustrated with a non-trivial running example.