Integrated Formal Methods

Volume 5423 of the series Lecture Notes in Computer Science pp 322-336

Dynamic Path Reduction for Software Model Checking

  • Zijiang YangAffiliated withWestern Michigan University
  • , Bashar Al-RawiAffiliated withUniversity of Michigan
  • , Karem SakallahAffiliated withUniversity of Michigan
  • , Xiaowan HuangAffiliated withStony Brook University
  • , Scott SmolkaAffiliated withStony Brook University
  • , Radu GrosuAffiliated withStony Brook University

* Final gross prices may vary according to local VAT.

Get Access


We present the technique of dynamic path reduction (DPR), which allows one to prune redundant paths from the state space of a program under verification. DPR is based on the symbolic analysis of concrete executions. For each explored execution path π that does not reach an abort statement, we repeatedly apply a weakest-precondition computation to accumulate the constraints associated with an infeasible sub-path derived from π by taking the alternative branch to an if-then-else statement. We then use an SMT solver to learn the minimally unsatisfiable core of these constraints. By further learning the statements in π that are critical to the sub-path’s infeasibility as well as the control-flow decisions that must be taken to execute these statements, unexplored paths containing the same unsatisfiable core can be efficiently and dynamically pruned. DPR is a very general technique which we consider here in the context of the bounded model checking of sequential programs with nondeterministic conditionals. Our preliminary experimental results show that DPR can prune a significant percentage of execution paths, a percentage that grows with the size of the instance of the problem being considered.