A refinement-based correctness proof of symmetry reduced model checking

  • Authors:
  • Edd Turner;Michael Butler;Michael Leuschel

  • Affiliations:
  • Department of Computing, University of Surrey;Electronics and Computer Science, University of Southampton;Institut für Informatik, Heinrich-Heine Universität Düsseldorf

  • Venue:
  • ABZ'10 Proceedings of the Second international conference on Abstract State Machines, Alloy, B and Z
  • Year:
  • 2010

Quantified Score

Hi-index 0.01

Visualization

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.