Automatic Refinement Checking for B
Automatic Refinement Checking for B
Refinement is a key concept in the B-Method. While refinement is at the heart of the B Method, so far no automatic refinement checker has been developed for it. In this paper we present a refinement checking algorithm and implementation for B. It is based on using an operational semantics of B, obtained in practice by the ProB animator. The refinement checker has been integrated into ProB toolset and we present various case studies and empirical results in the paper, showing the algorithm to be surprisingly effective. The algorithm checks that a refinement preserves the trace properties of a specification. We also compare our tool against the refinement checker FDR for CSP and discuss an extension for singleton failure refinement.
B-Method, Refinement Checking, Formal Methods, Model Checking, CSP
Leuschel, Michael
c2c18572-66cf-4f84-ade4-218ce3afe78b
Butler, Michael
54b9c2c7-2574-438e-9a36-6842a3d53ed0
2005
Leuschel, Michael
c2c18572-66cf-4f84-ade4-218ce3afe78b
Butler, Michael
54b9c2c7-2574-438e-9a36-6842a3d53ed0
Leuschel, Michael and Butler, Michael
(2005)
Automatic Refinement Checking for B.
ICFEM'05.
Record type:
Conference or Workshop Item
(Paper)
Abstract
Refinement is a key concept in the B-Method. While refinement is at the heart of the B Method, so far no automatic refinement checker has been developed for it. In this paper we present a refinement checking algorithm and implementation for B. It is based on using an operational semantics of B, obtained in practice by the ProB animator. The refinement checker has been integrated into ProB toolset and we present various case studies and empirical results in the paper, showing the algorithm to be surprisingly effective. The algorithm checks that a refinement preserves the trace properties of a specification. We also compare our tool against the refinement checker FDR for CSP and discuss an extension for singleton failure refinement.
Text
prob_icfem05_final.pdf
- Other
More information
Published date: 2005
Venue - Dates:
ICFEM'05, 2005-01-01
Keywords:
B-Method, Refinement Checking, Formal Methods, Model Checking, CSP
Organisations:
Electronic & Software Systems
Identifiers
Local EPrints ID: 261235
URI: http://eprints.soton.ac.uk/id/eprint/261235
PURE UUID: c67ee6f9-f03b-4b13-b8e4-1f34a3abbf98
Catalogue record
Date deposited: 19 Sep 2005
Last modified: 15 Mar 2024 02:50
Export record
Contributors
Author:
Michael Leuschel
Author:
Michael Butler
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics