“Smt-Switch: A Solver-Agnostic C++ API for SMT Solving (Extended Abstract)” by Makai Mann, Amalee Wilson, Cesare Tinelli, and Clark Barrett. In Proceedings of the 18^th International Workshop on Satisfiability Modulo Theories (SMT '20), July 2020.
This extended abstract describes work in progress on Smt-Switch, an open-source, solver-agnostic API for SMT solving. Smt-Switch provides an abstract interface, which can be implemented by different SMT solvers. Smt-Switch provides simple, uniform, and high-performance access to SMT solving for applications in areas such as automated reasoning, planning, and formal verification. The interface allows the user to create, traverse, and manipulate terms, as well as to dynamically dispatch queries to different underlying SMT solvers.
BibTeX entry:
@inproceedings{MWT+20,
author = {Makai Mann and Amalee Wilson and Cesare Tinelli and Clark
Barrett},
title = {Smt-Switch: A Solver-Agnostic C++ {API} for {SMT} Solving
(Extended Abstract)},
booktitle = {Proceedings of the {\it 18^{th}} International Workshop on
Satisfiability Modulo Theories (SMT '20)},
month = jul,
year = {2020},
url = {http://theory.stanford.edu/~barrett/pubs/MWT+20.pdf}
}
(This webpage was created with bibtex2web.)