16 search results - page 1 / 4 » Automated Testing and Debugging of SAT and QBF Solvers |
SAT
2010
Springer
13 years 8 months ago
2010
Springer
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...
ICCAD
2002
IEEE
14 years 1 months ago
2002
IEEE
Within the verification community, there has been a recent increase in interest in Quantified Boolean Formula evaluation (QBF) as many interesting sequential circuit verification ...
SAT
2004
Springer
13 years 10 months ago
2004
Springer
This paper reports about the 2004 comparative evaluation of solvers for quantified Boolean formulas (QBFs), the second in a series of non-competitive events established with the a...
ECAI
2004
Springer
13 years 8 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 ...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
This paper develops automated testing and debugging techniques for answer set solver development. We describe a flexible grammar-based black-box ASP fuzz testing tool which is abl...