Sciweavers

110 search results - page 10 / 22
» Tuning SAT Checkers for Bounded Model Checking
Sort
View
ICST
2009
IEEE
13 years 6 months ago
Proving Functional Equivalence of Two AES Implementations Using Bounded Model Checking
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...
Hendrik Post, Carsten Sinz
CAV
2005
Springer
127views Hardware» more  CAV 2005»
14 years 2 months ago
Incremental and Complete Bounded Model Checking for Full PLTL
Bounded model checking is an efficient method for finding bugs in system designs. The major drawback of the basic method is that it cannot prove properties, only disprove them. R...
Keijo Heljanko, Tommi A. Junttila, Timo Latvala
KBSE
2009
IEEE
14 years 3 months ago
SMT-Based Bounded Model Checking for Embedded ANSI-C Software
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...
Lucas Cordeiro, Bernd Fischer, João Marques...
TACAS
2005
Springer
155views Algorithms» more  TACAS 2005»
14 years 2 months ago
Context-Bounded Model Checking of Concurrent Software
The interaction among concurrently executing threads of a program results in insidious programming errors that are difficult to reproduce and fix. Unfortunately, the problem of ve...
Shaz Qadeer, Jakob Rehof
ATVA
2007
Springer
108views Hardware» more  ATVA 2007»
14 years 3 months ago
A New Approach to Bounded Model Checking for Branching Time Logics
Abstract. Bounded model checking (BMC) is a technique for overcoming the state explosion problem which has gained wide industrial acceptance. Bounded model checking is typically ap...
Rotem Oshman, Orna Grumberg