论文信息 - Dynamic Algorithm Selection for SMT

Dynamic Algorithm Selection for SMT

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.

Nikhil Pimpalkhare

[1] Shipra Agrawal,et al. Analysis of Thompson Sampling for the Multi-armed Bandit Problem , 2011, COLT.

[2] Armin Biere,et al. Boolector at the SMT Competition 2016 , 2011 .

[3] Sylvain Conchon,et al. The SMT Competition 2015-2018 , 2019, J. Satisf. Boolean Model. Comput..

[4] Nikolaj Bjørner,et al. Z3: An Efficient SMT Solver , 2008, TACAS.

[5] Mislav Balunovic,et al. Learning to Solve SMT Formulas , 2018, NeurIPS.

[6] Wei Chu,et al. A contextual-bandit approach to personalized news article recommendation , 2010, WWW '10.

[7] Aina Niemetz,et al. MachSMT: A Machine Learning-based Algorithm Selector for SMT Solvers , 2021, TACAS.

[8] Bruno Dutertre,et al. Yices 2.2 , 2014, CAV.

[9] I. J. Myung,et al. Tutorial on maximum likelihood estimation , 2003 .