Automatic Refinement Checking for B [chapter]

Michael Leuschel, Michael Butler
2005 Lecture Notes in Computer Science  
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
more » ... hat 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.
doi:10.1007/11576280_24 fatcat:5ng63cojirf5rmxt27ycivsrcm