Theories over strings are among the most heavily researched logical theories in the SMT
community in the past decade, owing to the error-prone nature of string manipulations …

We present a framework for processing formulas in automatic theorem provers, with
generation of detailed proofs. The main components are a generic contextual recursion …

With the integration of SMT solvers into analysis frameworks aimed at ensuring a system's
end-to-end correctness, having a high level of confidence in these solvers' results has …

We present a certified SMT QF_BV solver CoqQFBV built from a verified bit blasting
algorithm, Kissat, and the verified SAT certificate checker GratChk in this paper. Our verified …

Automated theorem provers are now commonly used within interactive theorem provers to
discharge an increasingly large number of proof obligations. To maintain the trustworthiness …

Sledgehammer, a component of the interactive proof assistant Isabelle/HOL, aims to
increase proof automation by automatically discharging proof goals with the help of external …

In this paper, we propose a new approach for automated verification of informal proofs in
Euclidean geometry using a fragment of first-order logic called coherent logic and a …

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 …

As software grows increasingly pervasive in our everyday lives, it is important to ensure that
the software we rely on, especially in safety-critical systems, behaves as expected. Whereas …