Satisfiability.jl: Satisfiability Modulo Theories in Julia

Emiko Soroka, Mykel J. Kochenderfer, Sanjay Lall

Abstract: 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.