Formal specification languages are traditionally supported by theorem provers, but recently model checkers have proven to\r 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\r of the sets used in the specification. We describe the implementation of Eboc and provide a preliminary comparison with ProB,\r an existing bounded model checker for classical B.
CITATION STYLE
Matos, P., Fischer, B., & Marques-Silva, J. (2009). Formal Methods and Software Engineering. (K. Breitman & A. Cavalcanti, Eds.), Formal Methods and Software Engineering (Vol. 5885, pp. 485–503). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-10373-5
Mendeley helps you to discover research relevant for your work.