Satisfiability.jl: Satisfiability Modulo Theories in Julia

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 discuss the design and implementation of a novel publicly-available interface for interacting with SMT-LIB compliant solvers in the Julia programming language.