A state relation monad plus a two-stage proof style lets algorithms like DFS and KMP be specified and verified in Coq with proofs organized by logical structure.
Journal of Functional Programming 28, e20 (2018)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.PL 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
A Formal Framework for Naturally Specifying and Verifying Sequential Algorithms
A state relation monad plus a two-stage proof style lets algorithms like DFS and KMP be specified and verified in Coq with proofs organized by logical structure.