Intertwined Forward-Backward Reachability Analysis Using Interpolants
In this work we develop a novel SAT-based verification approach which is based on interpolation. The novelty of our approach is in extracting interpolants in both forward and backward manner and exploiting them for an intertwined approximated forward and backward reachability analysis. Our approach is also mostly local and avoids unrolling of the checked model as much as possible. This results in an efficient and complete SAT-based verification algorithm.
We implemented our algorithm and compared it with both McMillan’s interpolation-based algorithm and with IC3, on real-life industrial designs as well as on examples from the HWMCC’11 benchmark. In many cases, our algorithm outperformed both methods.
KeywordsModel Check Safety Property Reachable State Propositional Formula Reachability Analysis
Unable to display preview. Download preview PDF.
- 2.Cabodi, G., Murciano, M., Nocco, S., Quer, S.: Stepping forward with interpolants in unbounded model checking. In: ICCAD, pp. 772–778 (2006)Google Scholar
- 4.Cabodi, G., Nocco, S., Quer, S.: Interpolation sequences revisited. In: DATE (2011)Google Scholar
- 5.Clarke, E., Grumberg, O., Jha, S., Lu, Y., Veith, H.: Counterexample-guided abstraction refinement for symbolic model checking. JACM (2003)Google Scholar
- 6.Clarke, E.C., Grumberg, O., Peled, D.: Model Checking. MIT Press (1999)Google Scholar
- 7.Craig, W.: Linear reasoning. A new form of the herbrand-gentzen theorem. J. Symb. Log. 22(3) (1957)Google Scholar
- 9.Een, N., Mishchenko, A., Brayton, R.: Efficient implementation of property directed reachability. In: FMCAD (2011)Google Scholar
- 14.Vizel, Y., Grumberg, O.: Interpolation-sequence based model checking. In: FMCAD (2009)Google Scholar
- 15.Vizel, Y., Grumberg, O., Shoham, S.: Lazy abstraction and SAT-based reachability in hardware model checking. In: FMCAD (2012)Google Scholar