A Lazy and Layered SMT(\(\mathcal{BV}\)) Solver for Hard Industrial Verification Problems

  • Roberto Bruttomesso
  • Alessandro Cimatti
  • Anders Franzén
  • Alberto Griggio
  • Ziyad Hanna
  • Alexander Nadel
  • Amit Palti
  • Roberto Sebastiani
Conference paper

DOI: 10.1007/978-3-540-73368-3_54

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4590)
Cite this paper as:
Bruttomesso R. et al. (2007) A Lazy and Layered SMT(\(\mathcal{BV}\)) Solver for Hard Industrial Verification Problems. In: Damm W., Hermanns H. (eds) Computer Aided Verification. CAV 2007. Lecture Notes in Computer Science, vol 4590. Springer, Berlin, Heidelberg

Abstract

Rarely verification problems originate from bit-level descriptions. Yet, most of the verification technologies are based on bit blasting, i.e., reduction to boolean reasoning.

In this paper we advocate reasoning at higher level of abstraction, within the theory of bit vectors (\(\mathcal{BV}\)), where structural information (e.g. equalities, arithmetic functions) is not blasted into bits.Our approach relies on the lazy Satisfiability Modulo Theories (SMT) paradigm. We developed a satisfiability procedure for reasoning about bit vectors that carefully leverages on the power of boolean SAT solver to deal with components that are more naturally “boolean”, and activates bit-vector reasoning whenever possible. The procedure has two distinguishing features. First, it relies on the on-line integration of a SAT solver with an incremental and backtrackable solver for \({\mathcal{BV}}\) that enables dynamical optimization of the reasoning about bit vectors; for instance, this is an improvement over static encoding methods which may generate smaller slices of bit-vector variables. Second, the solver for \({\mathcal{BV}}\) is layered (i.e., it privileges cheaper forms of reasoning), and it is based on a flexible use of term rewriting techniques.

We evaluate our approach on a set of realistic industrial benchmarks, and demonstrate substantial improvements with respect to state-of-the-art boolean satisfiability solvers, as well as other decision procedures for SMT\({\mathcal{(BV)}}\).

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Roberto Bruttomesso
    • 1
  • Alessandro Cimatti
    • 1
  • Anders Franzén
    • 1
    • 2
  • Alberto Griggio
    • 2
  • Ziyad Hanna
    • 3
  • Alexander Nadel
    • 3
  • Amit Palti
    • 3
  • Roberto Sebastiani
    • 2
  1. 1.FBK-irst, Povo, TrentoItaly
  2. 2.DIT, Università di TrentoItaly
  3. 3.Logic and Validation Technologies, Intel Architecture Group of HaifaIsrael

Personalised recommendations