Sciweavers

2218 search results - page 163 / 444
» Testing Expressibility Is Hard
Sort
View
AUSAI
2004
Springer
14 years 2 months ago
Longer-Term Memory in Clause Weighting Local Search for SAT
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...
Valnir Ferreira Jr., John Thornton
WORDS
2003
IEEE
14 years 2 months ago
Timing Analysis of Optimised Code
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...
Raimund Kirner, Peter P. Puschner
CAV
2000
Springer
89views Hardware» more  CAV 2000»
14 years 1 months ago
Tuning SAT Checkers for Bounded Model Checking
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...
Ofer Strichman
DAC
1999
ACM
14 years 1 months ago
Verification and Management of a Multimillion-Gate Embedded Core Design
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...
Johann Notbauer, Thomas W. Albrecht, Georg Niedris...
DATE
1999
IEEE
144views Hardware» more  DATE 1999»
14 years 1 months ago
A Method to Diagnose Faults in Linear Analog Circuits using an Adaptive Tester
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...
Érika F. Cota, Luigi Carro, Marcelo Lubasze...