A New Approach to Bounded Model Checking for Branching Time Logics

Abstract. Bounded model checking (BMC) is a technique for overcoming the state explosion problem which has gained wide industrial acceptance. Bounded model checking is typically applied only for linear-time properties, with a few exceptions, which search for a counter-example in the form of a tree-like structure with a pre-determined shape. We suggest a new approach to bounded model checking for universal branching-time logic, in which we encode an arbitrary graph and allow the SAT solver to choose both the states and edges of the graph. This significantly reduces the size of the counter-example produced by BMC. A dynamic completeness criterion is presented which can be used to halt the bounded model checking when it becomes clear that no counterexample can exist. Thus, verification of the checked property can also be achieved. Experiments show that our approach outperforms another recent encoding for µ-calculus on complex ACTL properties.

• Type: Conference
• Year: 2007
• Where: ATVA
• Authors: Rotem Oshman, Orna Grumberg
• Keywords: ATVA 2007, Model Checking, State Explosion Problem, Wide Industrial Acceptance