Pith. sign in

REVIEW 1 cited by

Satisfiability.jl: Satisfiability Modulo Theories in Julia

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2309.08778 v2 pith:EIA3OQQ2 submitted 2023-09-15 cs.LO cs.MS

Emiko Soroka , Mykel J. Kochenderfer , Sanjay Lall This is my paper · ORCID
classification cs.LOcs.MS
keywords satisfiabilityjulialanguagemodulosmt-libtheoriesallowscomplex
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original 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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. StochasticBarrier.jl: A Toolbox for Stochastic Barrier Function Synthesis

    eess.SY 2026-02 conditional novelty 5.0 of 10

    StochasticBarrier.jl synthesizes stochastic barrier functions for linear, polynomial, and piecewise-affine system models, and its benchmarks show large speedups over existing MATLAB/Python tools.

Pith tools