Sciweavers

295 search results - page 54 / 59
» SAT, SMT and Applications
Sort
View
CP
2005
Springer
15 years 7 months ago
Boosting Distributed Constraint Satisfaction
Abstract Competition and cooperation can boost the performance of a combinatorial search process. Both can be implemented with a portfolio of algorithms which run in parallel, give...
Georg Ringwelski, Youssef Hamadi
90
Voted
FROCOS
2005
Springer
15 years 7 months ago
Combination of Isabelle/HOL with Automatic Tools
We describe results and status of a sub project of the Verisoft [1] project. While the Verisoft project aims at verification of a complete computer system starting with hardware a...
Sergey Tverdyshev
105
Voted
ECAI
2000
Springer
15 years 6 months ago
Search Pruning Conditions for Boolean Optimization
This paper proposes new algorithms for the Binate Covering Problem (BCP), a well-known restriction of Boolean Optimization. Binate Covering finds application in many areas of Com...
Vasco M. Manquinho, João P. Marques Silva
114
Voted
ISCAS
1999
IEEE
106views Hardware» more  ISCAS 1999»
15 years 6 months ago
Test pattern generation for width compression in BIST
The main objectives of Built-In Self Test (BIST) are the design of test pattern generator circuits which achieve the highest fault coverage, require the shortest sequence of test ...
Paulo F. Flores, Horácio C. Neto, K. Chakra...
DATE
2004
IEEE
184views Hardware» more  DATE 2004»
15 years 5 months ago
Automatic Verification of Safety and Liveness for XScale-Like Processor Models Using WEB Refinements
We show how to automatically verify that complex XScale-like pipelined machine models satisfy the same safety and liveness properties as their corresponding instruction set archit...
Panagiotis Manolios, Sudarshan K. Srinivasan