We present a fast and reliable reconstruction of proofs generated by the SMT solver veriT in
Isabelle. The fine-grained proof format makes the reconstruction simple and efficient. For …

Existing proof-generating quantified Boolean formula (QBF) solvers must construct a
different type of proof depending on whether the formula is false (refutation) or true …

Abstract Satisfiability Modulo Theories (SMT) solvers have emerged as prominent tools in
formal methods applications. While originally targeted towards quantifier-free inputs, SMT …

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 …

SMTCoq is a plugin for the Coq interactive theorem prover to work in conjunction with
automated theorem provers based on Boolean Satisfiability (SAT) and Satisfiability Modulo …

In many formal methods applications it is common to rely on SMT solvers to automatically
discharge conditions that need to be checked and provide certificates of their results. In this …

Formal methods have repeatedly demonstrated their relevance in search and analysis of
bugs. If current methods are well suited to critical code analysis where mistakes are not a …

First-order formulas in CNF: t::= x| f (t,..., t) φ::= p (t,..., t)|¬ φ| φ∨ φ|∀ x1... xn. φ Given a
formula φ in FOL and background theories T1,..., Tn, finding a model M giving an …

Formal software verification systems must be designed to adapt to growth in the scope and
complexity of software, driven by expanding capabilities of computer hardware and domain …

Fe-Cu-Co alloys are the new generation of metal matrix for diamonds in powder metallurgy
processed cutting tools. In this work, samples of Fe-(30-45-60) wt% Cu and Fe-60% wtCu …