Extending Coq with Imperative Features and its Application to SAT Verification - Inria - Institut national de recherche en sciences et technologies du numérique
Conference Papers Year : 2010

Extending Coq with Imperative Features and its Application to SAT Verification

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.

Domains

Programming Languages [cs.PL]
Fichier principal
Vignette du fichier
fastcoq.pdf (188.29 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Arnaud Spiwack  : Connect in order to contact the contributor

https://inria.hal.science/inria-00502496

Submitted on : Thursday, August 26, 2010-11:51:20 AM

Last modification on : Friday, December 6, 2024-3:19:23 AM

Long-term archiving on : Tuesday, October 23, 2012-3:06:27 PM

Download

Dates and versions

inria-00502496 , version 1 (15-07-2010)
inria-00502496 , version 2 (26-08-2010)

Identifiers

  • HAL Id : inria-00502496 , version 2

Cite

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 XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

X CNRS INRIA LIX X-LIX X-DEP-INFO INRIA2
479 View
569 Download

Share

More