Automatic Refinement Checking for B

Leuschel, Michael and Butler, Michael (2005) Automatic Refinement Checking for B At ICFEM'05.


[img] PDF prob_icfem05_final.pdf - Other
Download (221kB)


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)
Venue - Dates: ICFEM'05, 2005-01-01
Keywords: B-Method, Refinement Checking, Formal Methods, Model Checking, CSP
Organisations: Electronic & Software Systems
ePrint ID: 261235
Date :
Date Event
Date Deposited: 19 Sep 2005
Last Modified: 17 Apr 2017 22:00
Further Information:Google Scholar

Actions (login required)

View Item View Item