Model Generation for Quantified Formulas: A Taint-Based Approach

02/15/2018
by   Benjamin Farinier, et al.
0

We focus in this paper on generating models of quantified first-order formulas over built-in theories, which is paramount in software verification and bug finding. While standard methods are either geared toward proving the absence of solution or targeted to specific theories, we propose a generic approach based on a reduction to the quantifier-free case. Our technique allows thus to reuse all the efficient machinery developed for that context. Experiments show a substantial improvement over state-of-the-art methods.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/01/2021

Extending Prolog for Quantified Boolean Horn Formulas

Prolog is a well known declarative programming language based on proposi...
research
04/25/2019

Interpolation and the Array Property Fragment

Interpolation based software model checkers have been successfully emplo...
research
09/29/2018

Quantifier Elimination With Structural Learning

We consider the Quantifier Elimination (QE) problem for propositional CN...
research
03/25/2023

Using Unit Propagation with Universal Reduction in DQBF Preprocessing

Several effective preprocessing techniques for Boolean formulas with and...
research
02/11/2018

New Models for Generating Hard Random Boolean Formulas and Disjunctive Logic Programs

We propose two models of random quantified boolean formulas and their na...
research
08/26/2019

Verifying Bit-vector Invertibility Conditions in Coq (Extended Abstract)

This work is a part of an ongoing effort to prove the correctness of inv...

Please sign up or login with your details

Forgot password? Click here to reset