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 …

This thesis is set in the field of formal methods, more precisely in the domain of deductive
program verification. Our working context is the Why3 framework, a set of tools to implement …

In this article, we show how one can formalise in type theory mathematical objects, for which
dependent types are usually deemed unavoidable, using only simple types. We outline a …

Numerous contributions have been made for some years to allow users to exchange formal
proofs between different provers. The main propositions consist in ad hoc pointwise …

Mathematical proof is undoubtedly the cornerstone of mathematics. Indeed, no mathematical
work is definitively complete without the final QED. Mathematics educators know this …

In various provers and deductive verification tools, logical transformations are used
extensively in order to reduce a proof task into a number of simpler tasks. Logical …

Dans un contexte de vérification formelle de programmes, utilisant des démonstrateurs
automatiques, la base de confiance des environnements de vérification est typiquement très …

The Bindlib library for OCaml provides a set of tools for the manipulation of data structures
with variable binding. It is very well suited for the representation of abstract syntax trees, and …

Abstract B, Event-B and TLA+ are modelling notations based on set theory.
Dedukti/Lambdapi is a logical framework based on the λ Π-calculus modulo rewriting in …

𝕂 is a semantical framework for formally describing the semantics of programming
languages thanks to a BNF grammar and rewriting rules on configurations. It is also an …