Efficient State Space Exploration: Interleaving Stateless and State-based Model Checking
PaperFirst seen 7/30/2026
Last seen 7/30/2026
Evidence 15 chunks
NEIGHBORHOOD
No graph connections found for this entity yet. It may appear in future ingestion runs.
explore full graph →RELATIONSHIPS
45 connectionsThe paper uses state-based model checking as one of the two interleaved methods.
The paper uses over-approximated pre-image operator for computing abstract states.
The paper uses frontier states as the key data structure in the hybrid approach.
The paper models programs as EFSMs.
The paper uses CFG as the control-state abstraction of the EFSM.
The paper uses CUDD library for BDD operations.
The paper uses Omega library for Presburger arithmetic formulas.
The paper uses BDDs for Boolean formula representation.
The paper uses Presburger arithmetic for integer state representation.
The paper uses SMT for the bounded model checking component.
The paper uses LIA as the theory for SMT formulas.
The paper uses stateless model checking as one of the two interleaved methods.
The paper discusses fixpoint computation in state traversal for unbounded model checking.
The paper uses memory bound to switch from state traversal to path-based reasoning.
The paper uses transition relation as the fundamental model of program behavior.
The paper uses image computation in state traversal.
The paper uses CSR to simplify transition relations and guide both ST and PR.
The paper uses symbolic state traversal as the state-based component.
The paper uses state disjuncts as the fundamental units in the frontier set.
The paper targets and evaluates the approach on embedded software verification benchmarks.
The paper uses goal-directed lighthouses as a state prioritization heuristic.
The paper uses deep-state prioritization as a state prioritization heuristic.
Malay K. Ganai is listed as an author of the paper.
The paper mentions interpolant-based approach as related work.
Chao Wang is listed as an author of the paper.
Weihong Li is listed as an author of the paper.
All authors are affiliated with NEC Laboratories America.
The paper introduces the HMC (Hybrid Model Checker) tool.
The paper proposes a divide-and-conquer strategy to combine state-based and stateless model checking.
The paper introduces state decomposition as part of the hybrid model checking approach.
The paper introduces state prioritization as part of the hybrid model checking approach.
The paper uses SMT-based bounded model checking as its stateless component.
The paper uses Presburger arithmetic based symbolic traversal as its state-based component.
The paper focuses on verifying reachability properties.
The paper uses DNF representation for state set formulas.
The paper uses UBC to simplify transition relations in BMC.
The paper uses BMC completeness threshold as a completeness criterion for path-based reasoning.
The paper uses program slicing as a preprocessing step.
The paper uses constant value propagation as a preprocessing step.
The paper's HMC implementation uses Yices SMT solver.
The paper uses polyhedral representation for linear integer constraints.
The paper's divide-and-conquer strategy introduces data parallelism.
The paper formulates BMC in terms of LTL properties.
The paper discusses unbounded model checking in the context of state-based methods.
The paper compares with SAT-based BMC in the context of stateless methods.