Directed Model Checking for B: An Evaluation and New Techniques

ProB is a model checker for high-level formalisms such as B, Event-B, CSP and Z. ProB uses a mixed depth-first/breadth-first search strategy, and in previous work we have argued that this can perform better in practice than pure depth-first or breadth-first search, as employed by low-level model checkers. In this paper we present a thorough empirical evaluation of this technique, which confirms our conjecture. The experiments were conducted on a wide variety of B and Event-B models, including several industrial case studies. Furthermore, we have extended ProB to be able to perform directed model checking, where each state is associated with a priority computed by a heuristic function. We evaluate various heuristic functions, on a series of problems, and find some interesting candidates for detecting deadlocks and finding specific target states.

• Type: Journal
• Year: 2010
• Where: SBMF
• Authors: Michael Leuschel, Jens Bendisposto
• Keywords: Formal Methods, Heuristic Functions, Model Checkers, ProB, SBMF 2010