571 search results - page 7 / 115 » Performing causality analysis by bounded model checking |
DAC
2006
ACM
16 years 19 days ago
2006
ACM
In this paper, we present a method that helps improve the performance of Bounded Model Checking by automatically strengthening invariants so that the termination proof may be obta...
118
click to vote
ICST
2009
IEEE
14 years 9 months ago
2009
IEEE
Bounded model checking--as well as symbolic equivalence checking--are highly successful techniques in the hardware domain. Recently, bit-vector bounded model checkers like CBMC ha...
106
click to vote
CADE
2002
Springer
15 years 12 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 ...
121
click to vote
CONCUR
1999
Springer
15 years 4 months ago
1999
Springer
Abstract. The paper presents a partial order reduction method applicable to networks of timed automata. The advantage of the method is that it reduces both the number of explored c...
SAT
2005
Springer
15 years 5 months ago
2005
Springer
Current algorithms for bounded model checking (BMC) use SAT methods for checking satisfiability of Boolean formulas. These BMC methods suffer from a potential memory explosion prob...