QF BV model checking with property directed reachability

Authors:
Tobias Welp;Andreas Kuehlmann
Affiliations:
University of California at Berkeley, CA;University of California at Berkeley, CA and Coverity, Inc., San Francisco, CA
Venue:
Proceedings of the Conference on Design, Automation and Test in Europe
Year:
2013

Citing 10
Cited 0

A machine program for theorem-proving

Communications of the ACM
BTOR: bit-precise modelling of word-level problems for model checking

SMT '08/BPR '08 Proceedings of the Joint Workshops of the 6th International Workshop on Satisfiability Modulo Theories and 1st International Workshop on Bit-Precise Reasoning
Boolector: An Efficient SMT Solver for Bit-Vectors and Arrays

TACAS '09 Proceedings of the 15th International Conference on Tools and Algorithms for the Construction and Analysis of Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009,
Generalizing DPLL to Richer Logics

CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
InvGen: An Efficient Invariant Generator

CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
SAT-based model checking without unrolling

VMCAI'11 Proceedings of the 12th international conference on Verification, model checking, and abstract interpretation
ABC: an academic industrial-strength verification tool

CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
Efficient implementation of property directed reachability

Proceedings of the International Conference on Formal Methods in Computer-Aided Design
Generalized property directed reachability

SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Software model checking via IC3

CAV'12 Proceedings of the 24th international conference on Computer Aided Verification

Quantified Score

Hi-index	0.00

Visualization

Abstract

In 2011, property directed reachability (PDR) was proposed as an efficient algorithm to solve hardware model checking problems. Recent experimentation suggests that it outperforms interpolation-based verification, which had been considered the best known algorithm for this purpose for almost a decade. In this work, we present a generalization of PDR to the theory of quantifier free formulae over bitvectors (QF_BV), illustrate the new algorithm with representative examples and provide experimental results obtained from experimentation with a prototype implementation.