National audienceIn order to increase user confidence, many automated theorem provers provide certificates that can be independently verified. In this paper, we report on our progress in developing a standalone tool for checking the correctness of certificates for the termination of term rewrite systems, and formally proving its correctness in the proof assistant Coq. To this end, we use the extraction mechanism of Coq and the library on rewriting theory and termination called CoLoR
International audienceProving programs correct is hard. During the last decades computer scientists ...
AbstractCurrent tools for automated deduction are often powerful and complex. Due to their complexit...
Making sure that a computer program behaves as expected, especially in critical applications (health...
National audienceIn order to increase user confidence, many automated theorem provers provide certif...
International audienceTermination is an important property of programs; notably required for program...
International audienceCoq is a tool allowing to certify proofs. This paper describes a Coq library f...
National audienceNowadays, formal methods rely on tools of different kinds: proof assistants with wh...
Abstract. Coq is a tool allowing to certify proofs. This paper describes a Coq library for certifyin...
Since the first termination competition1 in 2004 it is of great interest, whether a proof—that has b...
International audienceSoftware engineering, automated reasoning, rule-based programming or specifica...
Abstract. There are many automatic tools to prove termination of term rewrite systems, nowadays. Mos...
Higher-order rewriting is a framework in which one can write higher-order programs and study their p...
Coq is a tool allowing to certify proofs. This paper describes a Coq library for certifying terminat...
We present the rewriting toolkit CiME3. Amongst other original features, this version enjoys two kin...
International audienceProving programs correct is hard. During the last decades computer scientists ...
AbstractCurrent tools for automated deduction are often powerful and complex. Due to their complexit...
Making sure that a computer program behaves as expected, especially in critical applications (health...
National audienceIn order to increase user confidence, many automated theorem provers provide certif...
International audienceTermination is an important property of programs; notably required for program...
International audienceCoq is a tool allowing to certify proofs. This paper describes a Coq library f...
National audienceNowadays, formal methods rely on tools of different kinds: proof assistants with wh...
Abstract. Coq is a tool allowing to certify proofs. This paper describes a Coq library for certifyin...
Since the first termination competition1 in 2004 it is of great interest, whether a proof—that has b...
International audienceSoftware engineering, automated reasoning, rule-based programming or specifica...
Abstract. There are many automatic tools to prove termination of term rewrite systems, nowadays. Mos...
Higher-order rewriting is a framework in which one can write higher-order programs and study their p...
Coq is a tool allowing to certify proofs. This paper describes a Coq library for certifying terminat...
We present the rewriting toolkit CiME3. Amongst other original features, this version enjoys two kin...
International audienceProving programs correct is hard. During the last decades computer scientists ...
AbstractCurrent tools for automated deduction are often powerful and complex. Due to their complexit...
Making sure that a computer program behaves as expected, especially in critical applications (health...
.png%3Fwidth%3D300&w=3840&q=75)
Add to ORKG