Dynamic Algorithm Selection for SMT

Abstract

We describe an online approach to SMT solver selection using nearest neighbor classification and runtime estimation. We implement and evaluate our approach with MedleySolver, finding that it makes nearly optimal selections and evaluates a dataset of queries three times faster than any indivdual solver.

BibTeX

@inproceedings{Pimpalkhare:ASE20,
  author    = {Nikhil Pimpalkhare},
  title     = {Dynamic Algorithm Selection for {SMT}},
  booktitle = {ASE},
  pages     = {1376--1378},
  publisher = {{IEEE}},
  year      = {2020},
}

Dynamic Algorithm Selection for SMT

Abstract

Related papers