DeepAI AI Chat
Log In Sign Up

Bitwuzla at the SMT-COMP 2020

05/30/2020
by   Aina Niemetz, et al.
0

In this paper, we present Bitwuzla, our Satisfiability Modulo Theories (SMT) solver for the theories of bit-vectors, floating-points, arrays and uninterpreted functions and their combinations. We discuss selected features and provide details of its configuration and participation in the 2020 edition of the annual SMT competition.

READ FULL TEXT

page 1

page 2

02/07/2012

Optimization in SMT with LA(Q) Cost Functions

In the contexts of automated reasoning and formal verification, importan...
09/15/2023

Satisfiability.jl: Satisfiability Modulo Theories in Julia

Satisfiability modulo theories (SMT) is a core tool in formal verificati...
05/07/2019

Optimization Modulo the Theories of Signed Bit-Vectors and Floating-Point Numbers

Optimization Modulo Theories (OMT) is an important extension of SMT whic...
12/13/2022

SMT Sampling via Model-Guided Approximation

We investigate the domain of satisfiable formulas in satisfiability modu...
08/12/2021

Automating System Configuration

The increasing complexity of modern configurable systems makes it critic...
05/08/2019

Automatic Inference of Minimalist Grammars using an SMT-Solver

We introduce (1) a novel parser for Minimalist Grammars (MG), encoded as...
04/22/2022

Localizing Router Configuration Errors Using Minimal Correction Sets

Router configuration errors are unfortunately common and difficult to lo...