An Incremental Algorithm to Check Satisfiability for Bounded Model Checking

  title={An Incremental Algorithm to Check Satisfiability for Bounded Model Checking},
  author={HoonSang Jin and Fabio Somenzi},
  journal={Electr. Notes Theor. Comput. Sci.},
In Bounded Model Checking (BMC), the search for counterexamples of increasing lengths is translated into a sequence of satisfiability (SAT) checks. It is natural to try to exploit the similarity of these SAT instances by forwarding clauses learned during conflict analysis from one instance to the next. The methods proposed to identify clauses that remain valid fall into two categories: Those that are oblivious to the mechanism that generates the sequence of SAT instances and those that rely on… CONTINUE READING
Highly Cited
This paper has 53 citations. REVIEW CITATIONS
33 Citations
29 References
Similar Papers


Publications citing this paper.
Showing 1-10 of 33 extracted citations

54 Citations

Citations per Year
Semantic Scholar estimates that this publication has 54 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…