Model generation for quantified formulas: a taint-based approach
From MaRDI portal
Abstract: 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.
Recommendations
- Satisfiability solving and model generation for quantified first-order logic formulas
- Quantifier instantiation techniques for finite model finding in SMT
- Solving quantified verification conditions using satisfiability modulo theories
- Solving Quantified Verification Conditions Using Satisfiability Modulo Theories
- Constraint solving for finite model finding in SMT solvers
Cited in
(4)
This page was built for publication: Model generation for quantified formulas: a taint-based approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6039409)