364 search results - page 7 / 73 » Model checking with Boolean Satisfiability |
DFT
2005
IEEE
14 years 1 months ago
2005
IEEE
Fabricating large memory and processor arrays is subject to physical failures resulting in yield degradation. The strategy of incorporating spare rows and columns to obtain reason...
JUCS
2007
13 years 7 months ago
2007
: The distribution of overlaps of solutions of a random constraint satisfaction problem (CSP) is an indicator of the overall geometry of its solution space. For random k-SAT, nonri...
STTT
2010
13 years 2 months ago
2010
Abstract. We report here on an experimental investigation of LTL satisfiability checking via a reduction to model checking. By using large LTL formulas, we offer challenging model-...
DAC
1998
ACM
14 years 8 months ago
1998
ACM
Abstract-Our strategy for automatic generation of functional vectors is based on exercising selected paths in the given hardware description language (HDL) model. The HDL model des...
DLOG
2008
13 years 9 months ago
2008
We show how the reasoning tasks of checking various versions of conservativity for the description logic DL-Litebool can be reduced to satisfiability of quantified Boolean formulas...