Satisfiability.jl: Satisfiability Modulo Theories in Julia
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916506483294208 |
|---|---|
| author | Soroka, Emiko Kochenderfer, Mykel J. Lall, Sanjay |
| author_facet | Soroka, Emiko Kochenderfer, Mykel J. Lall, Sanjay |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2309_08778 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Satisfiability.jl: Satisfiability Modulo Theories in Julia Soroka, Emiko Kochenderfer, Mykel J. Lall, Sanjay Logic in Computer Science Mathematical Software D.2.4 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. |
| title | Satisfiability.jl: Satisfiability Modulo Theories in Julia |
| topic | Logic in Computer Science Mathematical Software D.2.4 |
| url | https://arxiv.org/abs/2309.08778 |