Communicating sequential processes
Communicating sequential processes
The B-book: assigning programs to meanings
The B-book: assigning programs to meanings
Units: cool modules for HOT languages
PLDI '98 Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation
Météor: A Successful Application of B in a Large Project
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume I - Volume I
Software Abstractions: Logic, Language, and Analysis
Software Abstractions: Logic, Language, and Analysis
ProB gets Nauty: Effective Symmetry Reduction for B and Z Models
TASE '08 Proceedings of the 2008 2nd IFIP/IEEE International Symposium on Theoretical Aspects of Software Engineering
On the Purpose of Event-B Proof Obligations
ABZ '08 Proceedings of the 1st international conference on Abstract State Machines, B and Z
Z2SAL - Building a Model Checker for Z
ABZ '08 Proceedings of the 1st international conference on Abstract State Machines, B and Z
Kodkod: a relational model finder
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Modeling in Event-B: System and Software Engineering
Modeling in Event-B: System and Software Engineering
Issues in implementing a model checker for z
ICFEM'06 Proceedings of the 8th international conference on Formal Methods and Software Engineering
Model checking z specifications using SAL
ZB'05 Proceedings of the 4th international conference on Formal Specification and Development in Z and B
Justifications for the event-b modelling notation
B'07 Proceedings of the 7th international conference on Formal Specification and Development in B
Efficient approximate verification of B and Z models via symmetry markers
Annals of Mathematics and Artificial Intelligence
Hi-index | 0.00 |
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 .