• SATORI

  • Referenced in 10 articles [sw09597]
  • state-of-the-art SAT and ATPG techniques.We present several novel techniques that propel SATORI ... commercial engine. Traditionalsequential justification based on ATPG or, on a bounded model of thesequential circuit ... using a boundedmodel, and a commercial sequential ATPG engine performing justification.Additional results are presented...
  • PASSAT

  • Referenced in 3 articles [sw10074]
  • industrial circuits. Automatic test pattern generation (ATPG) based on Boolean satisfiability (SAT) has been proposed ... alternative to classical search algorithms. SAT-based ATPG turned out to be more robust ... this paper, we present an efficient ATPG algorithm that makes use of powerful SAT-solving...
  • MiniSat

  • Referenced in 584 articles [sw00577]
  • An extensible SAT-solver. MiniSat is a minimalistic...
  • SATO

  • Referenced in 197 articles [sw04451]
  • SATO: A Solver for Propositional Satisfiability: The Davis...
  • SATIRE

  • Referenced in 40 articles [sw04648]
  • SATIRE: A new incremental satisfiability engine. We introduce...
  • Chaff

  • Referenced in 591 articles [sw06916]
  • Chaff:engineering an efficient SAT solver. Boolean Satisfiability...
  • BerkMin

  • Referenced in 161 articles [sw06917]
  • BerkMin: A fast and robust SAT-solver. We...
  • Quaffle

  • Referenced in 68 articles [sw07278]
  • Quaffle: Quantified Boolean Formula Evaluator with Learning Quaffle...
  • QUBOS

  • Referenced in 25 articles [sw09580]
  • QUBOS: Deciding quantified Boolean logic using propositional satisfiability...
  • semprop

  • Referenced in 18 articles [sw28383]
  • Lemma and model caching in decision procedures for...