AI Chat AI Image Generator AI Video Text to Speech

The VLSAT-3 Benchmark Suite

12/07/2021

∙

by Pierre Bouvier, et al.

∙

∙

This report presents VLSAT-3 (an acronym for "Very Large Boolean SATisfiability problems"),the third part of a benchmark suite to be used in scientific experimentsand software competitions addressing SAT and SMT (Satisfiability Modulo Theories) solving issues.VLSAT-3 contains 1200 (600 satisfiable and 600 unsatisfiable) quantifier-free first-order logic formulasof increasing complexity, proposed in SMT-LIB format under a permissive Creative Commons license.More than 90 during the 16th International Satisfiability Modulo TheoriesCompetition (SMT-COMP 2021).

research

∙ 09/08/2021

The VLSAT-2 Benchmark Suite

This report presents VLSAT-2 (an acronym for "Very Large Boolean SATisfi...

0 Pierre Bouvier, et al. ∙

research

∙ 12/05/2017

Language and Proofs for Higher-Order SMT (Work in Progress)

Satisfiability modulo theories (SMT) solvers have throughout the years b...

0 Haniel Barbosa, et al. ∙

research

∙ 01/16/2014

Computing Small Unsatisfiable Cores in Satisfiability Modulo Theories

The problem of finding small unsatisfiable cores for SAT formulas has re...

0 Alessandro Cimatti, et al. ∙

research

∙ 08/06/2019

Non-Invasive Reverse Engineering of Finite State Machines Using Power Analysis and Boolean Satisfiability

In this paper, we present a non-invasive reverse engineering attack base...

0 Harsh Vamja, et al. ∙

research

∙ 08/17/2021

Symbolic Automatic Relations and Their Applications to SMT and CHC Solving

Despite the recent advance of automated program verification, reasoning ...

0 Takumi Shimoda, et al. ∙

research

∙ 11/19/2020

The VLSAT-1 Benchmark Suite

This report presents VLSAT-1 (an acronym for "Very Large Boolean SATisfi...

0 Pierre Bouvier, et al. ∙

research

∙ 07/06/2021

Proof Generation in CDSAT

The main ideas in the CDSAT (Conflict-Driven Satisfiability) framework f...

0 Maria Paola Bonacina, et al. ∙