115 search results - page 5 / 23 » A Compact Linear Translation for Bounded Model Checking |
CADE
2012
Springer
12 years 11 months ago
2012
Springer
We propose a word level, bounded model checking (BMC) algorithm based on translation into the effectively propositional fragment (EPR) of firstorder logic. This approach to BMC al...
DAC
2003
ACM
15 years 10 months ago
2003
ACM
We present an algorithm that checks behavioral consistency between an ANSI-C program and a circuit given in Verilog using Bounded Model Checking. Both the circuit and the program ...
CAV
2003
Springer
15 years 2 months ago
2003
Springer
We show that the model checking problem for µ-calculus on graphs of bounded tree-width can be solved in time linear in the size of the system. The result is presented by first sh...
KBSE
2009
IEEE
15 years 4 months ago
2009
IEEE
Propositional bounded model checking has been applied successfully to verify embedded software but is limited by the increasing propositional formula size and the loss of structur...
CHARME
2003
Springer
15 years 2 months ago
2003
Springer
We consider the problem of bounded model checking of systems expressed in a decidable fragment of first-order logic. While model checking is not guaranteed to terminate for an ar...