This paper presents Smt-Switch, an open-source, solver-agnostic API for SMT solving. Smt-Switch provides simple, uniform, and high-performance access to SMT solving for applications in areas such as automated reasoning, planning, and formal verification. It defines an abstract interface, which can be implemented by different SMT solvers. The interface allows the user to create, traverse, and manipulate terms, as well as dynamically dispatch queries to various underlying SMT solvers.
|Title of host publication||Theory and Applications of Satisfiability Testing – SAT 2021 - 24th International Conference, 2021, Proceedings|
|Editors||Chu-Min Li, Felip Manyà|
|Publisher||Springer Science and Business Media Deutschland GmbH|
|Number of pages||10|
|State||Published - 2021|
|Event||24th International Conference on Theory and Applications of Satisfiability Testing, SAT 2021 - Barcelona, Spain|
Duration: 5 Jul 2021 → 9 Jul 2021
|Name||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Conference||24th International Conference on Theory and Applications of Satisfiability Testing, SAT 2021|
|Period||5/07/21 → 9/07/21|
Bibliographical notePublisher Copyright:
© 2021, Springer Nature Switzerland AG.