Ye, Kangfeng and Woodcock, Jim orcid.org/0000-0001-7955-2702 (2017) Model checking of state-rich formalism Circus by linking to CSP∥B. International Journal on Software Tools for Technology Transfer. pp. 73-96. ISSN 1433-2779
Abstract
Since state-rich formalism [Figure not available: see fulltext.] is a combination of Z, CSP, refinement calculus and Dijkstra’s guarded commands, its model checking is intrinsically more complicated and difficult than that of individual state-based languages or process algebras. Current solutions translate executable constructs of [Figure not available: see fulltext.] programs to Java with JCSP, or translate them to CSP processes. Data aspects of [Figure not available: see fulltext.] programs are expressed in the Java programming language or as CSP processes. Both of them have disadvantages. This work presents a new approach to model-checking [Figure not available: see fulltext.] by linking it to CSP‖ B; then we utilise ProB to model-check and animate the CSP‖ B program. The most significant advantage of this approach is the direct mapping of the state part in [Figure not available: see fulltext.] to Z and finally to B, which maintains the high-level abstraction of data specification. In addition, introduction of deadlock, invariant violation checking, LTL formula checking and animation is another key advantage. We present our approach, a link definition for a subset of [Figure not available: see fulltext.] constructs, as well as a popular case study (reactive buffer) to show the practical usability of our work. We conclude with a discussion of related work, advantages and potential limitations of our approach and future work.
Metadata
Item Type: | Article |
---|---|
Authors/Creators: |
|
Copyright, Publisher and Additional Information: | © Springer-Verlag Berlin Heidelberg 2015. This is an author-produced version of the published paper. Uploaded in accordance with the publisher’s self-archiving policy. Further copying may not be permitted; contact the publisher for details. |
Keywords: | B,Buffer,CSP,CSP‖ B,Model checking,ProB,Z,[InlineEquation not available: see fulltext.] |
Dates: |
|
Institution: | The University of York |
Academic Units: | The University of York > Faculty of Sciences (York) > Computer Science (York) |
Depositing User: | Pure (York) |
Date Deposited: | 05 Aug 2019 16:00 |
Last Modified: | 16 Oct 2024 15:53 |
Published Version: | https://doi.org/10.1007/s10009-015-0402-1 |
Status: | Published |
Refereed: | Yes |
Identification Number: | 10.1007/s10009-015-0402-1 |
Related URLs: | |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:149318 |