364 search results - page 3 / 73 » Model checking with Boolean Satisfiability |
72
Voted
ICCD
1991
IEEE
15 years 4 months ago
1991
IEEE
100
Voted
DAC
2003
ACM
16 years 2 months ago
2003
ACM
Procedures for Boolean satis ability most commonly work with Conjunctive Normal Form. Powerful SAT techniques based on implications and con icts can be retained when the usual CNF...
103
Voted
FORMATS
2004
Springer
15 years 4 months ago
2004
Springer
Abstract. In this paper we report a new SAT solver for difference logic, a propositional logic enriched with timing constraints. The main novelty of our solver is a tighter integra...
121
Voted
CADE
2002
Springer
16 years 1 months ago
2002
Springer
Abstract. We investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains. Given ...
137
Voted
TACAS
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. We extend the setting of Satisfiability Modulo Theories (SMT) by introducing a theory of costs C, where it is possible to model and reason about resource consumption and ...