Automatic Refinement Checking for B

Leuschel, Michael and Butler, Michael (2005) Automatic Refinement Checking for B. In, ICFEM'05 Springer-Verlag.


[img] PDF
Download (216Kb)


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.

Item Type: Conference or Workshop Item (Paper)
Keywords: B-Method, Refinement Checking, Formal Methods, Model Checking, CSP
Divisions : Faculty of Physical Sciences and Engineering > Electronics and Computer Science > Electronic & Software Systems
ePrint ID: 261235
Accepted Date and Publication Date:
Date Deposited: 19 Sep 2005
Last Modified: 31 Mar 2016 14:03
Further Information:Google Scholar

Actions (login required)

View Item View Item

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