From: Tobias Nipkow <nipkow@in.tum.de>
The string search algorithm by Knuth, Morris and Pratt
Fabian Hellauer and Peter Lammich
The Knuth-Morris-Pratt algorithm is often used to show that the problem of
finding a string s in a text t can be solved deterministically in O(|s| + |t|)
time. We use the Isabelle Refinement Framework to formulate and verify the
algorithm. Via refinement, we apply some optimisations and finally use the
Sepref tool to obtain executable code in Imperative/HOL.
https://www.isa-afp.org/entries/Knuth_Morris_Pratt.html
Enjoy!
smime.p7s
From: Joachim Breitner <joachim@cis.upenn.edu>
Hi,
kudos for putting in the effort of producing such a nicely formatted
and commented Isabelle theory!
Joachim
signature.asc
Last updated: Nov 21 2024 at 12:39 UTC