Formalizing Stålmarck's Algorithm in Coq [chapter]

Pierre Letouzey, Laurent Théry
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), #
more » ... disjunction), → (implication), = (equivalence), and a set of variables (v i ) i∈N . For example, the
doi:10.1007/3-540-44659-1_24 fatcat:gkivphalwjcpfg7thquwzfrqdu