364 search results - page 11 / 73 » Model checking with Boolean Satisfiability |
CAV
2004
Springer
14 years 26 days ago
2004
Springer
TACAS
2001
Springer
13 years 12 months ago
2001
Springer
CAV
2003
Springer
14 years 21 days ago
2003
Springer
ion and BDDs Complement SAT-based BMC in DiVer Aarti Gupta1, Malay Ganai1 , Chao Wang2, Zijiang Yang1, Pranav Ashar1 1 NEC Laboratories America, Princeton, NJ, U.S.A. 2 University ...
CADE
2002
Springer
14 years 7 months ago
2002
Springer
We show that a conjunctive normal form (CNF) formula F is unsatisfiable iff there is a set of points of the Boolean space that is stable with respect to F. So testing the satisfiab...
AI
2008
Springer
13 years 7 months ago
2008
Springer
Representing and reasoning about time dependent information is a key research issue in many areas of computer science and artificial intelligence. One of the best known and widely...