CVC4-SymBreak: Derived SMT solver at SMT Competition 2019

08/02/2019
by   Saket Dingliwal, et al.
0

We present CVC4-SymBreak, a derived SMT solver based on CVC4, and a non-competing participant of SMT-COMP 2019. Our technique exploits symmetries over the Boolean skeleton variables in an SMT problem to prune the search space. We use an ensemble of a solver with and without symmetries to be more effective. Our approach results in significantly faster solutions on a subset of available SMT benchmarks.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/07/2021

lazybvtoint at the SMT Competition 2020

lazybvtoint is a new prototype SMT-solver, that will participate in the ...
research
03/05/2018

OpenMath and SMT-LIB

OpenMath and SMT-LIB are languages with very different origins, but both...
research
07/02/2020

Smt-Switch: a solver-agnostic C++ API for SMT Solving

This extended abstract describes work in progress on Smt-Switch, an open...
research
04/16/2020

Solving bitvectors with MCSAT: explanations from bits and pieces (long version)

We present a decision procedure for the theory of fixed-sized bitvectors...
research
05/28/2021

Fair and Adventurous Enumeration of Quantifier Instantiations

SMT solvers generally tackle quantifiers by instantiating their variable...
research
04/15/2018

SMT Solving for Vesicle Traffic Systems in Cells

In biology, there are several questions that translate to combinatorial ...
research
02/28/2013

Scoup-SMT: Scalable Coupled Sparse Matrix-Tensor Factorization

How can we correlate neural activity in the human brain as it responds t...

Please sign up or login with your details

Forgot password? Click here to reset