Satisfiability.jl: Satisfiability Modulo Theories in Julia
Not on the map. Why?
Abstract (arXiv)
Satisfiability modulo theories (SMT) is a core tool in formal verification. While the SMT-LIB specification language can be used to interact with theorem proving software, a high-level interface allows for faster and easier specifications of complex SMT formulae. In this paper we present a novel open-source package for interacting with SMT-LIB compliant solvers in the Julia programming language.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 15 Sep 2023.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2024: 1.
1 paper.