DMCA
Automatic refinement checking for B (2005)
Cached
Download Links
- [eprints.ecs.soton.ac.uk]
- [eprints.soton.ac.uk]
- [rodin.cs.ncl.ac.uk]
- [rodin.cs.ncl.ac.uk]
- [www.stups.uni-duesseldorf.de]
- DBLP
Other Repositories/Bibliography
| Venue: | Proceedings ICFEM’05, LNCS 3785 |
| Citations: | 17 - 8 self |
BibTeX
@INPROCEEDINGS{Leuschel05automaticrefinement,
author = {Michael Leuschel and Michael Butler},
title = {Automatic refinement checking for B},
booktitle = {Proceedings ICFEM’05, LNCS 3785},
year = {2005},
pages = {345--359},
publisher = {SpringerVerlag}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Abstract. 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.
