Sciweavers

10 search results - page 1 / 2
» Automated Design Debugging With Maximum Satisfiability
Sort
View
TCAD
2010
154views more  TCAD 2010»
12 years 11 months ago
Automated Design Debugging With Maximum Satisfiability
As contemporary VLSI designs grow in complexity, design debugging has rapidly established itself as one of the largest bottlenecks in the design cycle today. Automated debug soluti...
Yibin Chen, Sean Safarpour, João Marques-Si...
FMCAD
2007
Springer
13 years 8 months ago
Improved Design Debugging Using Maximum Satisfiability
In today's SoC design cycles, debugging is one of the most time consuming manual tasks. CAD solutions strive to reduce the inefficiency of debugging by identifying error sourc...
Sean Safarpour, Hratch Mangassarian, Andreas G. Ve...
GLVLSI
2008
IEEE
150views VLSI» more  GLVLSI 2008»
13 years 4 months ago
Using unsatisfiable cores to debug multiple design errors
Due to the increasing complexity of today's circuits a high degree of automation in the design process is mandatory. The detection of faults and design errors is supported qu...
André Sülflow, Görschwin Fey, Rod...
SAT
2010
Springer
148views Hardware» more  SAT 2010»
13 years 8 months ago
Automated Testing and Debugging of SAT and QBF Solvers
Robustness and correctness are essential criteria for SAT and QBF solvers. We develop automated testing and debugging techniques designed and optimized for SAT and QBF solver devel...
Robert Brummayer, Florian Lonsing, Armin Biere
DATE
2008
IEEE
142views Hardware» more  DATE 2008»
13 years 6 months ago
Algorithms for Maximum Satisfiability using Unsatisfiable Cores
Many decision and optimization problems in Electronic Design Automation (EDA) can be solved with Boolean Satisfiability (SAT). Moreover, well-known extensions of SAT also find app...
João Marques-Silva, Jordi Planes