2218 search results - page 163 / 444 » Testing Expressibility Is Hard |
158
click to vote
AUSAI
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. This paper presents a comparative study between a state-ofthe-art clause weighting local search method for satisfiability testing and a variant modified to obtain longe...
142
click to vote
WORDS
2003
IEEE
15 years 11 months ago
2003
IEEE
Timing analysis is a crucial test for dependable hard real-time systems (DHRTS). The calculation of the worst-case execution time (WCET) is mandatory. As modern compilers are capa...
165
click to vote
CAV
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. Bounded Model Checking based on SAT methods has recently been introduced as a complementary technique to BDD-based Symbolic Model Checking. The basic idea is to search fo...
163
click to vote
DAC
1999
ACM
15 years 10 months ago
1999
ACM
Verification is one of the most critical and time-consuming tasks in today's design processes. This paper demonstrates the verification process of a 8.8 million gate design u...
161
click to vote
DATE
1999
IEEE
15 years 10 months ago
1999
IEEE
This work presents a new diagnosis method for use in an adaptive analog tester. The tester is able to detect faults in any linear circuit by learning a reference behavior in a fir...