Abstract
Symmetry reduction is a model checking technique that can help alleviate the problem of state space explosion, by preventing redundant state space exploration. In previous work, we have developed three effective approaches to symmetry reduction for B that have been implemented into the ProB model checker, and we have proved the soundness of our state symmetries. However, it is also important to show our techniques are sound with respect to standard model checking, at the algorithmic level. In this paper, we present a retrospective B development that addresses this issue through a series of B refinements. This work also demonstrates the valuable insights into a system that can be gained through formal modelling.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Clearsy: B4Free tool (2009), http://www.b4free.com
Steria, Aix-en-Provence, France: Atelier B, User and Reference Manuals (2009), http://www.atelierb.eu/index-en.php
B-Core (UK) Limited: B-Toolkit manuals (2002), http://www.b-core.com/btoolkit.html
Abrial, J.R., Butler, M.J., Hallerstede, S., Voisin, L.: An Open Extensible Tool Environment for Event-B. In: Liu, Z., He, J. (eds.) ICFEM 2006. LNCS, vol. 4260, pp. 588–605. Springer, Heidelberg (2006)
Leuschel, M., Butler, M.J.: ProB: A Model Checker for B. In: Araki, K., Gnesi, S., Mandrioli, D. (eds.) FME 2003. LNCS, vol. 2805, pp. 855–874. Springer, Heidelberg (2003)
Leuschel, M., Butler, M.J., Spermann, C., Turner, E.: Symmetry Reduction for B by Permutation Flooding. In: Julliand, J., Kouchnarenko, O. (eds.) B 2007. LNCS, vol. 4355, pp. 79–93. Springer, Heidelberg (2006)
Turner, E., Leuschel, M., Spermann, C., Butler, M.J.: Symmetry Reduced Model Checking for B. In: TASE, pp. 25–34. IEEE Computer Society, Los Alamitos (2007)
Spermann, C., Leuschel, M.: ProB gets Nauty: Effective Symmetry Reduction for B and Z Models. In: TASE, pp. 15–22. IEEE Computer Society, Los Alamitos (2008)
Abrial, J.R., Cansell, D.: Click’n Prove: Interactive Proofs within Set Theory. In: Basin, D., Wolff, B. (eds.) TPHOLs 2003. LNCS, vol. 2758, pp. 1–24. Springer, Heidelberg (2003)
Métayer, C., Abrial, J.R., Voisin, L.: Event-B Language, RODIN, D7 (2005)
Leuschel, M., Plagge, D.: Seven at one stroke: LTL model checking for high-level specifications in B, Z, CSP, and more. In: Ameur, Y.A., Boniol, F., Wiels, V. (eds.) ISoLA. RNTI-SM-1 of Revue des Nouvelles Technologies de l’Information, Cépaduès-Éditions, pp. 73–84 (2007)
Abrial, J.R.: The B Book: Assigning programs to meanings. Cambridge University Press, New York (1996)
Clarke, E.M., Grumberg, O., Peled, D.A.: Model Checking. The MIT Press, Cambridge (1999)
McKay, B.D.: Practical Graph Isomorphism. Congressus Numerantium 30, 45–87 (1981)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Turner, E., Butler, M., Leuschel, M. (2010). A Refinement-Based Correctness Proof of Symmetry Reduced Model Checking. In: Frappier, M., Glässer, U., Khurshid, S., Laleau, R., Reeves, S. (eds) Abstract State Machines, Alloy, B and Z. ABZ 2010. Lecture Notes in Computer Science, vol 5977. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11811-1_18
Download citation
DOI: https://doi.org/10.1007/978-3-642-11811-1_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-11810-4
Online ISBN: 978-3-642-11811-1
eBook Packages: Computer ScienceComputer Science (R0)