Abstract Bounded Model Checking (BMC) is an incremental refutation technique to search
for counterexamples of increasing length. The existence of a counterexample of a fixed
length is expressed by a first-order logic formula that is checked for satisfiability using a
suitable solver. We apply communicating parallel solvers to check satisfiability of the BMC
formulae. In contrast to other parallel solving techniques, our method does not parallelize
the satisfiability check of a single formula, but the parallel solvers work on formulae for …

Bounded model checking (BMC) is an incremental refutation technique to search for
counterexamples of increasing length. The existence of a counterexample of a fixed length
is expressed by a first-order logic formula that is checked for satisfiability using a suitable
solver. We apply communicating parallel solvers to check satisfiability of the BMC formulae.
In contrast to other parallel solving techniques, our method does not parallelize the
satisfiability check of a single formula, but the parallel solvers work on formulae for different …