Chunks: Component verification in CSP||B
Schneider, S, Treharne, H and Evans, N (2005) Chunks: Component verification in CSP||B In: 5th International Conference on Integrated Formal Methods, 2005-11-29 - 2005-12-02, Eindhoven, Netherlands.
chunks.pdf - Accepted version Manuscript
Available under License : See the attached licence file.
Plain Text (licence)
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 vertical bar vertical bar 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 vertical bar vertical bar B specification but to CSP specifications. This makes it an attractive technique to decomposing large systems for analysing with FDR.
|Item Type:||Conference or Workshop Item (Conference Paper)|
|Divisions :||Faculty of Engineering and Physical Sciences > Computing Science|
|Identification Number :||https://doi.org/10.1007/11589976_7|
|Uncontrolled Keywords :||component based verification, B-method, CSP, decomposition|
|Depositing User :||Symplectic Elements|
|Date Deposited :||29 Sep 2011 13:08|
|Last Modified :||23 Sep 2013 18:45|
Actions (login required)
Downloads per month over past year