Extending Coq with Imperative Features and its Application to SAT Verification

Michaël Armand 1 Benjamin Grégoire 1 Arnaud Spiwack 2, 3 Laurent Théry 1
1 MARELLE - Mathematical, Reasoning and Software
CRISAM - Inria Sophia Antipolis - Méditerranée
2 LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau]
3 TYPICAL - Types, Logic and computing
LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau], Inria Saclay - Ile de France
Abstract : 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.
Document type :
Conference papers
Liste complète des métadonnées

Cited literature [18 references]  Display  Hide  Download
https://hal.inria.fr/inria-00502496
Contributor : Arnaud Spiwack <>
Submitted on : Thursday, August 26, 2010 - 11:51:20 AM
Last modification on : Wednesday, March 27, 2019 - 4:41:28 PM
Document(s) archivé(s) le : Tuesday, October 23, 2012 - 3:06:27 PM

File

fastcoq.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00502496, version 2

Collections

INRIA | LIX | X | PARISTECH | X-LIX | X-DEP-INFO

Citation

Michaël Armand, Benjamin Grégoire, Arnaud Spiwack, Laurent Théry. Extending Coq with Imperative Features and its Application to SAT Verification. Interactive Theorem Proving, Jul 2010, Edinburgh, United Kingdom. ⟨inria-00502496v2⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

505

Files downloads

332

Contact


archive-ouverte@inria.fr