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

Satisfiability-based automated reasoning is an approach that is being successfully used in
software engineering to validate complex software, including for safety-critical systems. Such …

I develop a formal framework for propositional satifisfiability with the conflict-driven clause
learning (CDCL) procedure using the Isabelle/HOL proof assistant. The framework offers a …

Generating proofs of unsatisfiability is a valuable capability of most SAT solvers, and is an
active area of research for SMT solvers. This paper introduces the first method to efficiently …

Code that is highly optimized poses a problem for program-level verification: programmers
can employ various clever tricks that are non-trivial to reason about. For cryptography on low …

This extended abstract presents the contributions to automated reasoning made in the
context of the project Matryoshka, funded for five years by the European Research Council …

Code that is highly optimized poses a problem for programlevel verification: programmers
can employ various clever tricks that are non-trivial to reason about. For cryptography on low …

Code that is highly optimized poses a problem for programlevel verification: programmers
can employ various clever tricks that are non-trivial to reason about. For cryptography on low …

ARCADE stands for Automated Reasoning: Challenges, Applications, Directions, Exemplary
achievements, and this slogan captures the aim of the workshop series: to bring together key …

The second ARCADE workshop was held as a satellite event of CADE-27 as a forum for
discussions and for sharing ideas about current challenges, new application areas, and …