Download PDFOpen PDF in browser

Exploring Predictability of SAT/SMT Solvers

14 pagesPublished: May 15, 2012

Abstract

This paper seeks to explore the predictability of SAT and SMT solvers in response to different kinds of changes to benchmarks. We consider both semantics-preserving and possibly semantics-modifying transformations, and provide preliminary data about solver predictability. We also propose carrying learned theory lemmas over from an original run to runs on similar benchmarks, and show the benefits of this idea as a heuristic for improving predictability of SMT solvers.

Keyphrases: performance metrics, predictability, SAT, SMT

In: Aaron Stump, Geoff Sutcliffe and Cesare Tinelli (editors). EMSQMS 2010. Workshop on Evaluation Methods for Solvers, and Quality Metrics for Solutions, vol 6, pages 5--18

Download PDFOpen PDF in browser