A Lazy Unbounded Model Checker for Event-B

  • Authors:
  • Paulo J. Matos;Bernd Fischer;João Marques-Silva

  • Affiliations:
  • Electronics and Computer Science, University of Southampton,;Electronics and Computer Science, University of Southampton,;School of Computer Science and Informatics, University College Dublin,

  • Venue:
  • ICFEM '09 Proceedings of the 11th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Formal specification languages are traditionally supported by theorem provers, but recently model checkers have proven to be useful tools. In this paper we present Eboc, an explicit state model checker for Event-B . Eboc is based on lazy techniques that allow it to fairly perform an exhaustive state space search without bounding the size of the sets used in the specification. We describe the implementation of Eboc and provide a preliminary comparison with ProB, an existing bounded model checker for classical B .