AI Chat AI Image Generator AI Video Text to Speech

Satisfiability.jl: Satisfiability Modulo Theories in Julia

09/15/2023

∙

by Emiko Soroka, et al.

∙

∙

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.

Emiko Soroka
1 publication
Mykel J. Kochenderfer
144 publications
Sanjay Lall
7 publications

page 1

page 2

page 3

page 4

research

∙ 05/30/2020

Bitwuzla at the SMT-COMP 2020

In this paper, we present Bitwuzla, our Satisfiability Modulo Theories (...

0 Aina Niemetz, et al. ∙

research

∙ 07/20/2017

Representing Hybrid Automata by Action Language Modulo Theories

Both hybrid automata and action languages are formalisms for describing ...

0 Joohyung Lee, et al. ∙

research

∙ 10/12/2021

Toward SMT-Based Refinement Types in Agda

Dependent types offer great versatility and power, but developing proofs...

0 Gan Shen, et al. ∙

research

∙ 09/17/2020

Formulog: Datalog for SMT-Based Static Analysis (Extended Version)

Satisfiability modulo theories (SMT) solving has become a critical part ...

0 Aaron Bembenek, et al. ∙

research

∙ 01/11/2019

Model Checking Clinical Decision Support Systems Using SMT

Individual clinical Knowledge Artifacts (KA) are designed to be used in ...

0 Mohammad Hekmatnejad, et al. ∙

research

∙ 10/06/2022

Threat Repair with Optimization Modulo Theories

We propose a model-based procedure for automatically preventing security...

0 Thorsten Tarrach, et al. ∙

research

∙ 04/15/2020

Computing Tropical Prevarieties with Satisfiability Modulo Theory (SMT) Solvers

I am presenting a novel way to use SMT (Satisfiability Modulo Theory) to...

0 Christoph Lüders, et al. ∙