Sciweavers

201 search results - page 2 / 41
» Using a SAT solver to generate checking sequences
Sort
View
CAV
2007
Springer
212views Hardware» more  CAV 2007»
13 years 10 months ago
A Tutorial on Satisfiability Modulo Theories
Abstract. Solvers for satisfiability modulo theories (SMT) check the satisfiability of first-order formulas containing operations from various theories such as the Booleans, bit-ve...
Leonardo Mendonça de Moura, Bruno Dutertre,...
ICCD
2005
IEEE
114views Hardware» more  ICCD 2005»
14 years 3 months ago
State Set Management for SAT-based Unbounded Model Checking
In recent years, Boolean Satisfiability (SAT) has been shown to hold potential for Unbounded Model Checking (UMC). The success of SAT-based UMC largely relies on (i) the SAT solv...
Kameshwar Chandrasekar, Michael S. Hsiao
CP
2005
Springer
13 years 8 months ago
Using Boolean Constraint Propagation for Sub-clauses Deduction
Boolean Constraint Propagation (BCP) is recognized as one of the most useful technique for efficient satisfiability checking. In this paper a new extension of the scope of boole...
Sylvain Darras, Gilles Dequen, Laure Devendeville,...
DAC
2003
ACM
14 years 7 months ago
Learning from BDDs in SAT-based bounded model checking
Bounded Model Checking (BMC) based on Boolean Satisfiability (SAT) procedures has recently gained popularity as an alternative to BDD-based model checking techniques for finding b...
Aarti Gupta, Malay K. Ganai, Chao Wang, Zijiang Ya...
SAT
2004
Springer
88views Hardware» more  SAT 2004»
13 years 11 months ago
Improving First-order Model Searching by Propositional Reasoning and Lemma Learning
The finite model generation problem in the first-order logic is a generalization of the propositional satisfiability (SAT) problem. An essential algorithm for solving the proble...
Zhuo Huang, Hantao Zhang, Jian Zhang