62 search results - page 1 / 13 » EPR-Based Bounded Model Checking at Word Level |
CADE
2012
Springer
11 years 6 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...
CAV
2008
Springer
13 years 6 months ago
2008
Springer
In this paper we present a word-level model checking method that attempts to speed up safety property checking of industrial netlists. Our aim is to construct an algorithm that all...
FMCAD
2008
Springer
13 years 5 months ago
2008
Springer
el Sequential Memory Abstraction for Model Checking Per Bjesse Advanced Technology Group Synopsys Inc. Many designs intermingle large memories with wide data paths and nontrivial c...
DAC
1996
ACM
13 years 8 months ago
1996
ACM
CHARME
2003
Springer
13 years 9 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...