A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf
.
Formalizing Stålmarck's Algorithm in Coq
[chapter]
2000
Lecture Notes in Computer Science
We present the development of a machine-checked implementation of Stålmarck's algorithm. First, we prove the correctness and the completeness of an abstract representation of the algorithm. Then, we give an effective implementation of the algorithm that we prove correct. The algorithm Stålmarck's algorithm is a tautology checker. It deals with boolean formulae, i.e. expressions formed with the two constants (true), ⊥ (false), the unary symbol ¬ (negation), the binary symbols & (conjunction), #
doi:10.1007/3-540-44659-1_24
fatcat:gkivphalwjcpfg7thquwzfrqdu