59 citations · 188 across the 17 of their papers we have counts for
3 papers · 1 filter
Model Generation for Quantified Formulas: A Taint-Based Approach
Benjamin Farinier, Sébastien Bardin, Richard Bonichon +1
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 m…
CDCL-inspired Word-level Learning for Bit-vector Constraint Solving
Zakaria Chihani, François Bobot, Sébastien Bardin
The theory of quantifier-free bit-vectors (QF_BV) is of paramount importance in software verification. The standard approach for satisfiability checking reduces the bit-vector prob…
A Combined Approach for Constraints over Finite Domains and Arrays
Sébastien Bardin, Arnaud Gotlieb
Arrays are ubiquitous in the context of software verification. However, effective reasoning over arrays is still rare in CP, as local reasoning is dramatically ill-conditioned for…