• Publications
  • Influence
Symbolic Model Checking without BDDs
TLDR
This paper shows how boolean decision procedures, like Stalmarck's Method or the Davis & Putnam Procedure, can replace BDDs, and introduces a bounded model checking procedure for LTL which reduces model checking to propositional satisfiability. Expand
Bounded Model Checking
  • Armin Biere
  • Computer Science
  • Handbook of Satisfiability
  • 2009
TLDR
This article surveys a technique called Bounded Model Checking (BMC), which uses a propositional SAT solver rather than BDD manipulation techniques, and is widely perceived as a complementary technique to BDD-based model checking. Expand
Boolector: An Efficient SMT Solver for Bit-Vectors and Arrays
TLDR
Boolector is presented, which is an efficient SMT solver for the quantifier-free theories of bit-vectors and arrays, which uses term rewriting, bit-blasting, and lemmas on demand for arrays. Expand
Effective Preprocessing in SAT Through Variable and Clause Elimination
TLDR
This work combines variable elimination with subsumption and self-subsuming resolution, and shows 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
Bounded Model Checking Using Satisfiability Solving
TLDR
This tutorial focuses on recent techniques that combine model checking with satisfiability solving, known as bounded model checking, which do a very fast exploration of the state space, and for some types of problems seem to offer large performance improvements over previous approaches. Expand
PicoSAT Essentials
  • Armin Biere
  • Computer Science
  • J. Satisf. Boolean Model. Comput.
  • 2008
TLDR
Optimal compact data structures for watching literals are described and evaluated and it is shown that this low-level optimization not only saves memory, but also turns out to speed up the SAT solver considerably. Expand
Handbook of Satisfiability: Volume 185 Frontiers in Artificial Intelligence and Applications
TLDR
This collection of papers on all theoretical and practical aspects of SAT solving will be extremely useful to both students and researchers and will lead to many further advances in the field. Expand
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
Resolve and Expand
TLDR
A novel expansion based decision procedure for quantified boolean formulas (QBF) in conjunctive normal form (CNF) that is competitive with state-of-the-art QBF solvers based on DPLL. Expand
Lingeling, Plingeling and Treengeling Entering the SAT Competition 2013
This paper serves as solver description for our SAT solver Lingeling and its two parallel variants Treengeling and Plingeling entering the SAT Competition 2013. We only list important differences toExpand
...
1
2
3
4
5
...