Putting the `K' into Bird's derivation of Knuth-Morris-Pratt string matching

Peter Gammie 🌐

August 25, 2020

This is a development version of this entry. It might change over time and is not stable. Please refer to release versions for citations.

Abstract

Richard Bird and collaborators have proposed a derivation of an intricate cyclic program that implements the Morris-Pratt string matching algorithm. Here we provide a proof of total correctness for Bird's derivation and complete it by adding Knuth's optimisation.

License

BSD License

Topics

Session BirdKMP

Depends on

Cite

× 
@article{BirdKMP-AFP,
  author  = {Peter Gammie},
  title   = {Putting the `K' into Bird's derivation of Knuth-Morris-Pratt string matching},
  journal = {Archive of Formal Proofs},
  month   = {August},
  year    = {2020},
  note    = {\url{https://isa-afp.org/entries/BirdKMP.html},
             Formal proof development},
  ISSN    = {2150-914x},
}
Download

Download

× Download latest

Older releases: