AbstractCurrent tools for automated deduction are often powerful and complex. Due to their complexity there is a risk that they contain bugs and thus deliver wrong results. To ensure reliability of these tools, one possibility is to develop certifiers which check the results of tools with the help of a trusted proof assistant. We present a framework which illustrates the essential steps to develop stand-alone certifiers which efficiently check generated proofs outside the employed proof assistant. Our framework has already been used to develop certifiers for various properties, including termination, confluence, completion, and tree automata related properties
When a proof-checking kernel completes the checking of a formal proof, that kernel asserts that a sp...
Formal verification of complex algorithms is challenging. Verifying their implementations in reasona...
International audienceIn the context of deductive program veri cation, both the speci fication and t...
AbstractCurrent tools for automated deduction are often powerful and complex. Due to their complexit...
Current tools for automated deduction are often powerful and complex. Due to their complexity there ...
National audienceIn order to increase user confidence, many automated theorem provers provide certif...
Formal verification of complex algorithms is challenging. Verifying their implementations goes beyon...
Formal trust in an abstract property, be it a mathematical result or a quality of the behavior of a ...
2 CÉDRIC – Conservatoire national des arts et métiers Abstract. Nowadays, formal methods rely on too...
AbstractThis paper introduces a notion of certified computation whereby an algorithm not only produc...
International audienceAmong formal methods, the deductive verification approach allows establishing ...
Since the first termination competition1 in 2004 it is of great interest, whether a proof—that has b...
Unification and antiunification are essential algorithms used by symbolic execution engines and veri...
AbstractGuaranteeing correctness of compilation is a vital precondition for correct software. Code g...
International audienceNowadays certification is widely employed by automated termination tools for t...
When a proof-checking kernel completes the checking of a formal proof, that kernel asserts that a sp...
Formal verification of complex algorithms is challenging. Verifying their implementations in reasona...
International audienceIn the context of deductive program veri cation, both the speci fication and t...
AbstractCurrent tools for automated deduction are often powerful and complex. Due to their complexit...
Current tools for automated deduction are often powerful and complex. Due to their complexity there ...
National audienceIn order to increase user confidence, many automated theorem provers provide certif...
Formal verification of complex algorithms is challenging. Verifying their implementations goes beyon...
Formal trust in an abstract property, be it a mathematical result or a quality of the behavior of a ...
2 CÉDRIC – Conservatoire national des arts et métiers Abstract. Nowadays, formal methods rely on too...
AbstractThis paper introduces a notion of certified computation whereby an algorithm not only produc...
International audienceAmong formal methods, the deductive verification approach allows establishing ...
Since the first termination competition1 in 2004 it is of great interest, whether a proof—that has b...
Unification and antiunification are essential algorithms used by symbolic execution engines and veri...
AbstractGuaranteeing correctness of compilation is a vital precondition for correct software. Code g...
International audienceNowadays certification is widely employed by automated termination tools for t...
When a proof-checking kernel completes the checking of a formal proof, that kernel asserts that a sp...
Formal verification of complex algorithms is challenging. Verifying their implementations in reasona...
International audienceIn the context of deductive program veri cation, both the speci fication and t...