Efficient state space exploration: Interleaving stateless and state-based model checking

Abstract

State-based model checking methods comprise computing and storing reachable states, while stateless model checking methods directly reason about reachable paths using decision procedures, thereby avoiding computing and storing the reachable states. Typically, statebased methods involve memory-intensive operations, while stateless methods involve time-intensive operations. We propose a divide-andconquer strategy to combine the complementary strengths of these methods for efficient verification of embedded software. Specifically, our model checking engine uses both state decomposition and state prioritization to guide the combination of a Presburger arithmetic based symbolic traversal algorithm (state-based) and an SMT based bounded model checking algorithm (stateless). These two underlying algorithms are interleaved-based on memory/time bounds and dynamic task partitioning-in order to systematically explore the state space and to avoid storing the entire reachable state set. We have implemented our new method in a tightly integrated verification tool called HMC (Hybrid Model Checker). We demonstrate the efficacy of the proposed method on some industry examples.

Novel SAT-based invariant-directed low-power synthesis

“…Algorithm [18], Inductive Model Checking [19], deductive [20] and symbolic state exploration techniques [21] have been used in the past. Inductive invariants and model checkers interact in various ways.…”