Extending Coq with Imperative Features and its Application to SAT Verification
Résumé
Coq has within its logic a programming language that can be used to replace many deduction steps into a single computation, this is the so-called reflection. In this paper, we present two extensions of the evaluation mechanism that preserve its correctness and make it possible to deal with cpu-intensive tasks such as proof checking of SAT traces.
Domaines
Langage de programmation [cs.PL]| Origine | Fichiers produits par l'(les) auteur(s) |
|---|