Model-Based Testing for Verification Back-Ends

Cyrille Artho, Armin Biere, Martina Seidl

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

Abstract

Many verification tools used in practice rely on sophisticated SAT and SMT solvers. These reasoning engines are assumed and expected to be correct, but, in general, too complex to be fully verified. Therefore, effective testing techniques have to be employed. In this paper, we show how to employ model-based testing (MBT) to test sequences of application programming interface (API) calls and different system configurations. We applied this approach to our SAT solver Lingeling and compared it to existing testing approaches, revealing the effectiveness of MBT for the development of reliable SAT solvers.
Original languageEnglish
Title of host publicationProceedings of the 7th International Conference on Tests & Proofs
Pages39-55
Number of pages17
DOIs
Publication statusPublished - Jun 2013

Fields of science

  • 102011 Formal languages
  • 102 Computer Sciences
  • 101 Mathematics

JKU Focus areas

  • Computation in Informatics and Mathematics

Cite this