Sciweavers

Share
18 search results - page 1 / 4
» Automatic invariant strengthening to prove properties in bou...
Sort
View
DAC
2006
ACM
10 years 2 months ago
Automatic invariant strengthening to prove properties in bounded model checking
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...
Mohammad Awedh, Fabio Somenzi
CAV
2004
Springer
128views Hardware» more  CAV 2004»
9 years 6 months ago
Proving More Properties with Bounded Model Checking
Bounded Model Checking, although complete in theory, has been thus far limited in practice to falsification of properties that were not invariants. In this paper we propose a term...
Mohammad Awedh, Fabio Somenzi
ICST
2009
IEEE
8 years 11 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
FMCAD
2007
Springer
9 years 7 months ago
Automated Extraction of Inductive Invariants to Aid Model Checking
Abstract— Model checking can be aided by inductive invariants, small local properties that can be proved by simple induction. We present a way to automatically extract inductive ...
Michael L. Case, Alan Mishchenko, Robert K. Brayto...
FMCAD
2008
Springer
9 years 2 months ago
Automatic Non-Interference Lemmas for Parameterized Model Checking
Parameterized model checking refers to any method that extends traditional, finite-state model checking to handle systems arbitrary number of processes. One popular approach to thi...
Jesse D. Bingham
books