364 search results - page 1 / 73 » Model checking with Boolean Satisfiability |
CL
2000
Springer
13 years 11 months ago
2000
Springer
Boolean circuits offer a natural, structured, and compact representation of Boolean functions for many application domains. In this paper a tableau method for solving satisfiabilit...
JAL
2008
13 years 7 months ago
2008
BIRTHDAY
2004
Springer
13 years 11 months ago
2004
Springer
A quantified Boolean formula is true, if for any existentially quantified variable there exists a Boolean function depending on the preceding universal variables, such that substi...
DATE
1999
IEEE
13 years 11 months ago
1999
IEEE
Boolean Satisfiability is a ubiquitous modeling tool in Electronic Design Automation, It finds application in test pattern generation, delay-fault testing, combinational equivalen...
CAV
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. CirCUs is a satisfiability solver that works on a combination of AndInverter-Graph, CNF clauses, and BDDs. It has been designed to work well with bounded model checking. ...