Sciweavers

3335 search results - page 108 / 667
» Grid result checking
Sort
View
150
Voted
CADE
2012
Springer
13 years 5 months ago
EPR-Based Bounded Model Checking at Word Level
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...
Moshe Emmer, Zurab Khasidashvili, Konstantin Korov...
111
Voted
FMCAD
2008
Springer
15 years 5 months ago
A Theory of Mutations with Applications to Vacuity, Coverage, and Fault Tolerance
The quality of formal specifications and the circuits they are written for can be evaluated through checks such as vacuity and coverage. Both checks involve mutations to the specif...
Orna Kupferman, Wenchao Li, Sanjit A. Seshia
ICCAD
2006
IEEE
128views Hardware» more  ICCAD 2006»
16 years 9 days ago
Improvements to combinational equivalence checking
The paper explores several ways to improve the speed and capacity of combinational equivalence checking based on Boolean satisfiability (SAT). State-of-the-art methods use simulat...
Alan Mishchenko, Satrajit Chatterjee, Robert K. Br...
ICCAD
2005
IEEE
121views Hardware» more  ICCAD 2005»
16 years 8 days 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...
130
Voted
DSD
2009
IEEE
111views Hardware» more  DSD 2009»
15 years 10 months ago
Robustness Check for Multiple Faults Using Formal Techniques
Feature sizes in VLSI circuits are steadily shrinking. This results in increasing susceptibility to soft errors, e.g. due to environmental radiation. Precautions against soft error...
Stefan Frehse, Görschwin Fey, André S&...