Sciweavers

162 search results - page 1 / 33
» Extraction in Coq: An Overview
Sort
View
CIE
2008
Springer
13 years 8 months ago
Extraction in Coq: An Overview
The extraction mechanism of Coq allows one to transform Coq proofs and functions into functional programs. We illustrate the behavior of this tool by reviewing several variants of ...
Pierre Letouzey
ESOP
2004
Springer
14 years 8 days ago
Extracting a Data Flow Analyser in Constructive Logic
Abstract. We show how to formalise a constraint-based data flow analysis in the specification language of the Coq proof assistant. This involves defining a dependent type of lat...
David Cachera, Thomas P. Jensen, David Pichardie, ...
ENTCS
2006
153views more  ENTCS 2006»
13 years 6 months ago
Automatic Complexity Analysis for Programs Extracted from Coq Proof
We describe an automatic complexity analysis mechanism for programs extracted from proofs carried out with the proof assistant Coq. By extraction, we mean the automatic generation...
Jean-Pierre Jouannaud, Weiwen Xu
FM
2006
Springer
134views Formal Methods» more  FM 2006»
13 years 10 months ago
Formal Verification of a C Compiler Front-End
This paper presents the formal verification of a compiler front-end that translates a subset of the C language into the Cminor intermediate language. The semantics of the source an...
Sandrine Blazy, Zaynah Dargaye, Xavier Leroy
ENTCS
2008
121views more  ENTCS 2008»
13 years 7 months ago
Building Certified Static Analysers by Modular Construction of Well-founded Lattices
This paper presents fixpoint calculations on lattice structures as example of highly modular programming in a dependently typed functional language. We propose a library of Coq mo...
David Pichardie