• Publications
  • Influence
Symbolic Model Checking without BDDs
TLDR
We introduce a bounded model checking procedure for linear temporal logic (LTL) which reduces model checking to propositional satisfiability. Expand
  • 2,374
  • 277
  • PDF
Bounded Model Checking
  • Armin Biere
  • Computer Science
  • Handbook of Satisfiability
  • 2009
TLDR
We survey a technique called Bounded Model Checking (BMC), which uses a propositional SAT solver rather than BDD manipulation techniques. Expand
  • 652
  • 98
  • PDF
Effective Preprocessing in SAT Through Variable and Clause Elimination
TLDR
We combine variable elimination with subsumption and self-subsuming resolution, and show that these techniques not only shrink the formula further than previous preprocessing efforts based on variable elimination, but also decrease runtime of SAT solvers substantially for typical industrial SAT problems. Expand
  • 631
  • 64
  • PDF
Symbolic model checking using SAT procedures instead of BDDs
In this paper, we study the application of propositional decision procedures in hardware verification. In particular, we apply bounded model checking to equivalence and invariant checking. We presentExpand
  • 357
  • 61
PicoSAT Essentials
  • Armin Biere
  • Computer Science
  • J. Satisf. Boolean Model. Comput.
  • 2008
TLDR
In this article we describe and evaluate optimized compact data structures for watching literals. Expand
  • 365
  • 59
  • PDF
Boolector: An Efficient SMT Solver for Bit-Vectors and Arrays
TLDR
Boolector is an efficient SMT solver for the quantifier-free theories of bit-vectors and arrays in combination with the extensional theory of arrays. Expand
  • 353
  • 59
  • PDF
Bounded Model Checking Using Satisfiability Solving
TLDR
In this tutorial, we first give a brief overview of the history of model checking to date, and then focus on recent techniques that combine model checking with satisfiability solving, and propose a methodology for applying the technique in industry. Expand
  • 721
  • 57
  • PDF
Handbook of Satisfiability: Volume 185 Frontiers in Artificial Intelligence and Applications
TLDR
'Satisfiability (SAT) related topics have attracted researchers from various disciplines: logic, applied areas such as planning, scheduling, operations research and combinatorial optimization, but also theoretical issues on the theme of complexity and much more, they all are connected through SAT. Expand
  • 463
  • 56
Resolve and Expand
TLDR
We present a novel expansion based decision procedure for quantified boolean formulas (QBF) in conjunctive normal form (CNF). Expand
  • 281
  • 44
  • PDF
Handbook of satisfiability
TLDR
'Satisfiability (SAT) related topics have attracted researchers from various disciplines: logic, applied areas such as planning, scheduling, operations research and combinatorial optimization, but also theoretical issues on the theme of complexity and much more, they all are connected through SAT. Expand
  • 550
  • 40
  • PDF