Generalized Property Directed Reachability
The IC3 algorithm was recently introduced for proving properties of finite state reactive systems. It has been applied very successfully to hardware model checking. We provide a specification of the algorithm using an abstract transition system and highlight its dual operation: model search and conflict resolution. We then generalize it along two dimensions. Along one dimension we address nonlinear fixed-point operators (push-down systems) and evaluate the algorithm on Boolean programs. In the second dimension we leverage proofs and models and generalize the method to Boolean constraints involving theories.
KeywordsTransition Relation Safety Property Horn Clause Predicate Transformer Uninterpreted Function
Unable to display preview. Download preview PDF.
- 6.Een, N., Mishchenko, A., Brayton, R.: Efficient implementation of property-directed reachability. In: FMCAD (2011)Google Scholar
- 7.Grebenshchikov, S., Lopes, N.P., Popeea, C., Rybalchenko, A.: Synthesizing software verifiers from proof rules. In: PLDI (2012)Google Scholar
- 11.Manna, Z., Pnueli, A.: Temporal verification of reactive systems - safety (1995)Google Scholar
- 12.McMillan, K.L.: Interpolants from Z3 proofs. In: FMCAD (2011)Google Scholar
- 13.Nieuwenhuis, R., Oliveras, A., Tinelli, C.: Solving SAT and SAT Modulo Theories: From an abstract DPLL procedure to DPLL(T). J. ACM 53(6) (2006)Google Scholar