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

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

doi:10.1007/978-3-030-80223-3_26

Cited by 9 publications

(2 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This allows to reuse all the libraries for manipulating SMT-LIB formulas that are available for various languages (e.g. [10,15,1]). Besides these generic libraries, we have also developed a set of tools to work with the language, including converters to and from other formats and formalisms (including Aiger, BTOR and Constrained Horn Clauses).…”

Section: Introductionmentioning

confidence: 99%

The VMT-LIB Language and Tools

Cimatti,

Griggio,

Tonetta

2021

Preprint

View full text Add to dashboard Cite

We present VMT-LIB, a language for the representation of verification problems of linear-time temporal properties on infinite-state symbolic transition systems. VMT-LIB is an extension of the standard SMT-LIB language for SMT solvers, developed with the goal of facilitating the interoperability and exchange of benchmark problems among different verification tools. Besides describing its syntax and semantics, we also present a set of open-source tools to work with the language.

show abstract

Section: Introductionmentioning

confidence: 99%

The VMT-LIB Language and Tools

Cimatti,

Griggio,

Tonetta

2021

Preprint

View full text Add to dashboard Cite

show abstract

“…In some cases, MathSAT5 is called on an extension of the original bit-vector problem. The interface to both external solvers uses smt-switch [9]. According to the rules published by the organizers of SMT-COMP 2020, lazybv2int is a wrapper tool (see [2]) and not a portfolio solver, and thus is allowed to compete.…”

mentioning

confidence: 99%

lazybvtoint at the SMT Competition 2020

Zohar,

Irfan,

Mann

et al. 2021

Preprint

Self Cite

View full text Add to dashboard Cite

lazybv2int is a new prototype SMT-solver, that will participate in the incremental and non-incremental tracks of the QF BV logic.Overview. lazybv2int is a prototype SMT-solver for the theory of fixed-width bit-vectors and uninterpreted functions. This is the first year it will compete in SMT-COMP. It will participate in the incremental and non-incremental QF BV tracks. The basic algorithm of the tool relies on a translation from bit-vectors to non-linear integer arithmetic with uninterpreted functions, followed by a CEGAR loop [7] that lazily instantiates bit-vector axioms over the translation. The idea of using integer reasoning for bit-vector solving is not new (see, e.g., [1,4]), however, it is worth revisiting due to recent improvements in solvers for non-linear integer arithmetic [5,8,10]. We expect this solver to perform better on benchmarks that involve arithmetic bit-vector constraints and large bit-widths because the encoding of arithmetic constraints is straightforward and independent of bit-width, as opposed to the encoding of bit-wise constraints which is less natural and hindered by larger bit-widths. The tool is open-source and is available at https://github.com/yoni206/lazybv2int.

show abstract