Sciweavers

125 search results - page 3 / 25
» Bounds Checking with Taint-Based Analysis
Sort
View
CAV
2008
Springer
125views Hardware» more  CAV 2008»
13 years 9 months ago
A Practical Approach to Word Level Model Checking of Industrial Netlists
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...
Per Bjesse
ACSD
2008
IEEE
102views Hardware» more  ACSD 2008»
14 years 1 months ago
Performing causality analysis by bounded model checking
Synchronous systems can immediately react to the inputs of their environment which may lead to so-called causality cycles between actions and their trigger conditions. Systems wit...
Klaus Schneider, Jens Brandt
ICCAD
2005
IEEE
121views Hardware» more  ICCAD 2005»
14 years 4 months ago
Transition-by-transition FSM traversal for reachability analysis in bounded model checking
Abstract— In bounded model checking (BMC)-based verification flows lack of reachability constraints often leads to false negatives. At present, it is daily practice of a veri...
Minh D. Nguyen, Dominik Stoffel, Markus Wedler, Wo...
SPIN
2010
Springer
13 years 5 months ago
Context-Bounded Translations for Concurrent Software: An Empirical Evaluation
Abstract. Context-Bounded Analysis has emerged as a practical automatic formal analysis technique for fine-grained, shared-memory concurrent software. Two recent papers (in CAV 20...
Naghmeh Ghafari, Alan J. Hu, Zvonimir Rakamaric
ISSTA
2010
ACM
13 years 9 months ago
Analysis of invariants for efficient bounded verification
SAT-based bounded verification of annotated code consists of translating the code together with the annotations to a propositional formula, and analyzing the formula for specifica...
Juan P. Galeotti, Nicolás Rosner, Carlos L&...