-
DBGen User Manual
This document introduces DBGen, an automatic generator of De Bruijn infrastructure for the Coq proof assistant. -
Automated verification of termination certificates
National audience -
Semi-automatic verification of cryptographic primitives
CertiCrypt is a framework that enables the machine-checked construction and verification of cryptographic proofs in the Coq proof assistant. CertiCrypt instruments the... -
Mechanized Formal Semantics and Verified Compilation for C++ Objects
C++ is one of the most widely used programming languages in practice, including for embedded critical software. Thus, it becomes interesting to apply formal methods to... -
Formal proofs in real algebraic geometry: from ordered fields to quantifier e...
International audience -
Proving formally the implementation of an efficient gcd algorithm for polynom...
Last version published in the proceedings of IJCAR 06, part of FLOC 06. -
Modular development of theories and name-space management for the Coq proof a...
Proof assistants offer a formal framework for formalizing and mechanically checking mathematical knowledge. Moreover, due to the numerous applications that follow from... -
The Coq Proof Assistant : Reference Manual : Version 7.2
Coq is a proof assistant based on a higher-order logic. Coq allows to handle calculus mathematical assertions and to check mechanically proofs of these assertions. It... -
Programming Language Specifications and Environments
These are course notes on programming language formal descriptions and their use to build programming environments and to prove properties of these languages. -
User Guide to the CTCOQ Proof Environment
CTCOQ is a graphical environment to perform proofs in Coq. -
A PCC Architecture based on Certified Abstract Interpretation
Proof Carrying Code (PCC) is a technique for downloading mobile code on a host machine while ensuring that the code adheres to the host's security policy. We show how... -
Simplifying Polynomial Expressions in a Proof Assistant
This paper presents a simple way of performing polynomial simplifications in a proof assistant. This method has been implemented and tested within the Coq prover. -
Construction of real algebraic numbers in Coq
International audience -
Realizability and parametricity in Pure Type Systems
This thesis focuses on the adaptation of realizability and parametricity to dependent types in the framework of Pure Type Systems. We describe a systematic method to... -
A list-machine benchmark for mechanized metatheory
Projet GALLIUM -
Formal Verification of Hardware Synthesis
International audience -
Matrices à blocs et en forme canonique
International audience
