Fault Localization and Correction with QBF

DOI10.1007/978-3-540-72788-0_34MaRDI QIDQ3612477zbMATH OpenOpenAlexFDO

Authors Stefan Staber, Roderick Bloem

Publication date 10 March 2009

Published in Theory and Applications of Satisfiability Testing – SAT 2007 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-72788-0_34

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Fault detection; testing in circuits and networks (94C12)

Recommendations

• Correct Hardware Design and Verification Methods
• scientific article; zbMATH DE number 5542982
• Finding and fixing faults
• Circuit-based search space pruning in QBF
• Automated testing and debugging of SAT and QBF solvers

Cited in

(14)

• Lower bound techniques for QBF expansion
• Local reasoning about the presence of bugs: incorrectness separation logic
• Long-distance Q-resolution with dependency schemes
• Unified QBF certification and its applications
• Efficiently solving quantified bit-vector formulas
• Long distance Q-resolution with dependency schemes
• scientific article; zbMATH DE number 7228403 (Why is no real title available?)
• Finding and fixing faults
• Explaining counterexamples using causality
• Efficient reduction of nondeterministic automata with application to language inclusion testing
• scientific article; zbMATH DE number 7029312 (Why is no real title available?)
• Automated testing and debugging of SAT and QBF solvers
• Size, cost and capacity: a semantic technique for hard random QBFs
• Correct Hardware Design and Verification Methods

Describes a project that uses

Uses Software

• sKizzo

This page was built for publication: Fault Localization and Correction with QBF

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3612477)