Proofs from SMT solvers ensure correctness independently from implementation, which is
often a requirement when solvers are used in safety-critical applications or proof assistants …

Debugging unsatisfiable constraint models can be a tedious task. Current tools allow a user
to extract a subset of constraints that render the problem unsatisfiable (MUS). However, in …

Satisfiability modulo theories (SMT) solvers check the satisfiability of quantifier-free first-
order logic formulae over different theories. We consider the theory of non-linear real …

Modern SAT solvers are often integrated as sub-reasoning engines into more complex tools
to address problems beyond the Boolean satisfiability problem. Consider, for example …

Generating and Exploiting Automated Reasoning Proof Certificates Page 1 AUTOMATED
REASONING REFERS to a set of tools and techniques for automatically proving or disproving …

Recent advances in the verification of deep neural networks (DNNs) have opened the way
for broader usage of DNN verification technology in many application areas, including safety …

Certification helps to increase trust in formal verification of safety-critical systems which
require assurance on their correctness. In hardware model checking, a widely used formal …

Proof logging has long been the established method to certify correctness of Boolean
satisfiability (SAT) solvers, but has only recently been introduced for SAT-based optimization …

Satisfiability modulo theories (SMT) solvers are widely used to prove security and safety
properties of computer systems. For these applications, it is crucial that the result reported by …

We present a proof system for establishing the correctness of results produced by
optimization algorithms, with a focus on mixed-integer programming (MIP). Our system …