Property Directed Reachability for QF_BV with mixed type atomic reasoning units

Word level property directed reachability

“…The closest approach to ours is on Property Directed Reachability for QF_BV [31] which was further extended to mixed type atomic reasoning units [32]. They proposed a version of the Subsume rule for QF_BV but did not use global guidance.…”

Property directed invariant refinement for program verification

“…In our program verification framework, we use the generalization of the Boolean PDR algorithm to the theory QF BV presented in [3] with the extension [4] to refine the model of the program under verification (PUV).…”

“…We also encoded the problems symbolically as QF BV MCPs and used the model checker [4] directly without the invariant refinement proposed in this paper. The results are in the last column of Table 1; only six benchmarks can be solved within the time limit.…”

“…The new algorithm extends the program verification paradigm using loop invariants presented in [1] with a counterexample guided abstraction refinement (CEGAR) loop [2] where the refinement is achieved by strengthening loop invariants using the QF BV generalization of Property Directed Reachability (PDR) discussed in [3,4]. We compare the algorithm with other approaches to program verification and report experimental results.…”