Zur Hauptnavigation wechseln Zur Suche wechseln Zum Hauptinhalt wechseln

Turbo-Charging Lemmas on Demand with Don't Care Reasoning

  • Aina Niemetz
  • , Mathias Preiner
  • , Armin Biere

Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung

Abstract

Lemmas on demand is an abstraction/refinement technique for procedures deciding Satisfiability Modulo Theories (SMT), which iteratively refines full candidate models of the formula abstraction until convergence. In this paper, we introduce a dual propagation-based technique for optimizing lemmas on demand by extracting partial candidate models via don’t care reasoning on full candidate models. Further, we compare our approach to a justification-based approach similar to techniques employed in the context of model checking. We implemented both optimizations in our SMT solver Boolector and provide an extensive experimental evaluation, which shows that by enhancing lemmas on demand with don’t care reasoning, the number of lemmas generated, and consequently the solver runtime, is reduced considerably.
OriginalspracheEnglisch
TitelProc. 14th Intl. Conf. on Formal Methods in Computer Aided Design (FMCAD'14)
Herausgeber*innenKoen Claessen, Viktor Kuncak
VerlagFMCAD Inc
Seiten179-186
Seitenumfang8
ISBN (elektronisch)9780983567844
DOIs
PublikationsstatusVeröffentlicht - 16 Dez. 2014

Publikationsreihe

Name2014 Formal Methods in Computer-Aided Design, FMCAD 2014

Wissenschaftszweige

  • 102 Informatik
  • 603109 Logik
  • 202006 Computer Hardware

JKU-Schwerpunkte

  • Computation in Informatics and Mathematics

Dieses zitieren