224 search results - page 15 / 45 » Algorithms for Solving Boolean Satisfiability in Combination... |
123
click to vote
ICCAD
1991
IEEE
15 years 3 months ago
1991
IEEE
This paper presents an efficient algorithm for the generation of diagnostic test patterns which distinguish between two arbitrary single stuck-at faults. The algorithm is able to ...
108
click to vote
ECAI
2004
Springer
15 years 3 months ago
2004
Springer
Quantified Constraint Satisfaction Problems (QCSPs) are CSPs in which some variables are universally quantified. For each possible value of such variables, we have to find ways to ...
ICCAD
2006
IEEE
15 years 8 months ago
2006
IEEE
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...
DAC
2005
ACM
16 years 20 days ago
2005
ACM
We present an efficient search strategy for satisfiability checking on circuits represented at the register-transfer-level (RTL). We use the RTL circuit structure by extending con...
ACSD
2005
IEEE
15 years 5 months ago
2005
IEEE
Perfectly synchronous systems immediately react to the inputs of their environment, which may lead to so-called causality cycles between actions and their trigger conditions. Algo...