Stålmarck's Algorithm in Coq: A Three-Level Approach - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports Year : 2002

Stålmarck's Algorithm in Coq: A Three-Level Approach

Laurent Théry

Abstract

One of the most efficient method to check if a boolean proposition is a tautology is Stålmarck's algorithm. This paper reports on some experiments in integrating this algorithm inside the Coq theorem prover in a safe way.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
RR-4353.pdf (322.86 Ko) Télécharger le fichier
Loading...

Dates and versions

inria-00072235 , version 1 (23-05-2006)

Identifiers

  • HAL Id : inria-00072235 , version 1

Cite

Laurent Théry. Stålmarck's Algorithm in Coq: A Three-Level Approach. RR-4353, INRIA. 2002. ⟨inria-00072235⟩
41 View
78 Download

Share

Gmail Facebook X LinkedIn More