332 search results - page 12 / 67 » A Direct Algorithm for Multi-valued Bounded Model Checking |
130
click to vote
VLSID
2010
IEEE
14 years 9 months ago
2010
IEEE
Directed test generation is important for the functional verification of complex system-on-chip designs. SAT based bounded model checking is promising for counterexample generatio...
FAW
2008
Springer
15 years 1 months ago
2008
Springer
We prove that there exists an O(log(n))-labeling scheme for every first-order formula with free set variables in every class of graphs that is nicely locally cwd-decomposable, whic...
CAV
2008
Springer
15 years 1 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...
PPDP
2001
Springer
15 years 4 months ago
2001
Springer
In this paper we present a new type system for logic programs. Our system combines ideas of the classical polymorphic, but not very precise, system due to Mycroft and O'Keefe...
104
click to vote
CAV
2012
Springer
13 years 2 months ago
2012
Springer
A SAT-based incremental, inductive algorithm for model checking CTL properties is proposed. As in classic CTL model checking, the parse graph of the property shapes the analysis. H...