100 search results - page 14 / 20 » sat 2005 |
100
Voted
DAC
2005
ACM
14 years 11 months ago
2005
ACM
We propose a normalization technique for verifying arithmetic circuits in a bounded model checking environment. Our technique operates on the arithmetic bit level (ABL) descriptio...
ISCAS
2005
IEEE
15 years 3 months ago
2005
IEEE
— This paper presents a parameter domain pruning method. Parameter domain pruning aims to identify parameter sub-domains that are more likely to produce feasible and good design ...
GLVLSI
2005
IEEE
15 years 3 months ago
2005
IEEE
Boolean Satisfiability (SAT) solvers are popular engines used throughout the verification world. Bounded sequential problems such as bounded model checking and bounded sequentia...
STACS
2005
Springer
15 years 3 months ago
2005
Springer
Exponential algorithms, i.e. algorithms of complexity O(cn ) for some c > 1, seem to be unavoidable in the case of NP-complete problems (unless P=NP), especially if the problem ...
CHARME
2005
Springer
15 years 3 months ago
2005
Springer
Partial order (PO) reduction methods are widely employed to combat state explosion during model-checking. In this paper, we develop a partial order reduction algorithm for rule-bas...