Automatic Refinement Checking for B
Leuschel, Michael and Butler, Michael (2005) Automatic Refinement Checking for B. In, ICFEM'05 Springer-Verlag.
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 and Applied Science > Electronics and Computer Science > Electronic & Software Systems
|Date Deposited:||19 Sep 2005|
|Last Modified:||02 Mar 2012 00:41|
|Contributors:||Leuschel, Michael (Author)
Butler, Michael (Author)
|Further Information:||Google Scholar|
|ISI Citation Count:||19|
|RDF:||RDF+N-Triples, RDF+N3, RDF+XML, Browse.|
Actions (login required)