lazybvtoint at the SMT Competition 2020

05/07/2021
by   Yoni Zohar, et al.
0

lazybvtoint is a new prototype SMT-solver, that will participate in the incremental and non-incremental tracks of the logic.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

06/20/2018

CVC4 at the SMT Competition 2018

This paper is a description of the CVC4 SMT solver as entered into the 2...
08/02/2019

CVC4-SymBreak: Derived SMT solver at SMT Competition 2019

We present CVC4-SymBreak, a derived SMT solver based on CVC4, and a non-...
08/23/2020

An Incremental Abstraction Scheme for Solving Hard SMT-Instances over Bit-Vectors

Decision procedures for SMT problems based on the theory of bit-vectors ...
09/21/2020

On using SMT-solvers for Modeling and Verifying Dynamic Network Emulators

A novel model-based approach to verify dynamic networks is proposed; the...
10/12/2020

Post-Training BatchNorm Recalibration

We revisit non-blocking simultaneous multithreading (NB-SMT) introduced ...
04/17/2020

Non-Blocking Simultaneous Multithreading: Embracing the Resiliency of Deep Neural Networks

Deep neural networks (DNNs) are known for their inability to utilize und...
09/23/2017

An Incremental Slicing Method for Functional Programs

Several applications of slicing require a program to be sliced with resp...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.