Automated Testing and Debugging of SAT and QBF Solvers

  • Robert Brummayer
  • , Florian Lonsing
  • , Armin Biere

Research output: Chapter in Book/Report/Conference proceedingConference proceedingspeer-review

Abstract

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 development. Our fuzz testing techniques are able to find critical solver defects that lead to crashes, invalid satisfying assignments and incorrect satisfiability results. Moreover, we show that sequential and concurrent delta debugging techniques are highly effective in minimizing failure-inducing inputs.
Original languageEnglish
Title of host publicationProc. 13th Intl. Conf. on Theory and Applications of Satisfiability Testing (SAT'10)
PublisherSpringer
Pages44-57
Number of pages14
Volume6175
ISBN (Print)3642141854, 9783642141850
DOIs
Publication statusPublished - Jul 2010

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6175 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Fields of science

  • 102011 Formal languages
  • 102 Computer Sciences
  • 101 Mathematics

JKU Focus areas

  • Computation in Informatics and Mathematics

Cite this