Satisfiability.jl: Satisfiability Modulo Theories in Julia
Logic in Computer Science
2024-12-05 v2 Mathematical Software
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.
Cite
@article{arxiv.2309.08778,
title = {Satisfiability.jl: Satisfiability Modulo Theories in Julia},
author = {Emiko Soroka and Mykel J. Kochenderfer and Sanjay Lall},
journal= {arXiv preprint arXiv:2309.08778},
year = {2024}
}
Comments
7 pages, revised from a previous longer version to comply with a conference length requirement. Submitted to NASA Formal Methods 2024