162 search results - page 3 / 33 » Extraction in Coq: An Overview |
TPHOL
2003
IEEE
14 years 26 days ago
2003
IEEE
Abstract. It is well known that mathematical proofs often contain (abstract) algorithms, but although these algorithms can be understood by a human, it still takes a lot of time an...
TPHOL
2007
IEEE
14 years 1 months ago
2007
IEEE
We propose a method to extract purely functional contents from logical inductive types in the context of the Calculus of Inductive Constructions. This method is based on a mode con...
MPC
1995
Springer
13 years 11 months ago
1995
Springer
Abstract. This paper is about exceptions handling using classical techniques of program extraction. We propose an impredicative formalization in the calculus of constructions and w...
TGC
2010
Springer
13 years 5 months ago
2010
Springer
Static analysers are becoming so complex that it is crucial to ascertain the soundness of their results in a provable way. In this paper we develop a certified checker in Coq that ...
CADE
2008
Springer
14 years 8 months ago
2008
Springer
Tree automata completion is a technique for the verification of infinite state systems. It has already been used for the verification of cryptographic protocols and the prototyping...