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

Laurent Théry 1
1 LEMME - Software and mathematics
CRISAM - Inria Sophia Antipolis - Méditerranée
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.
Document type :
Reports
Complete list of metadatas

Cited literature [1 references]  Display  Hide  Download

https://hal.inria.fr/inria-00072235
Contributor : Rapport de Recherche Inria <>
Submitted on : Tuesday, May 23, 2006 - 8:11:04 PM
Last modification on : Thursday, February 14, 2019 - 5:48:01 PM
Long-term archiving on : Sunday, April 4, 2010 - 10:59:40 PM

Identifiers

  • HAL Id : inria-00072235, version 1

Collections

Citation

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

Share

Metrics

Record views

102

Files downloads

101