Smt-Switch: A Solver-Agnostic C++ API for SMT Solving

Makai Mann, Amalee Wilson, Yoni Zohar, Lindsey Stuntz, Ahmed Irfan, Kristopher Brown, Caleb Donovick, Allison Guman, Cesare Tinelli, Clark Barrett

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

3 Scopus citations


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.

Original languageEnglish
Title of host publicationTheory and Applications of Satisfiability Testing – SAT 2021 - 24th International Conference, 2021, Proceedings
EditorsChu-Min Li, Felip Manyà
PublisherSpringer Science and Business Media Deutschland GmbH
Number of pages10
ISBN (Print)9783030802226
StatePublished - 2021
Externally publishedYes
Event24th International Conference on Theory and Applications of Satisfiability Testing, SAT 2021 - Barcelona, Spain
Duration: 5 Jul 20219 Jul 2021

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume12831 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference24th International Conference on Theory and Applications of Satisfiability Testing, SAT 2021

Bibliographical note

Publisher Copyright:
© 2021, Springer Nature Switzerland AG.


Dive into the research topics of 'Smt-Switch: A Solver-Agnostic C++ API for SMT Solving'. Together they form a unique fingerprint.

Cite this