2000 character limit reached
Satisfiability.jl: Satisfiability Modulo Theories in Julia (2309.08778v2)
Published 15 Sep 2023 in cs.LO and cs.MS
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.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.