Automatic generation of efficient string matching algorithms by generalized partial computation

@inproceedings{Futamura2002AutomaticGO,
  title={Automatic generation of efficient string matching algorithms by generalized partial computation},
  author={Yoshihiko Futamura and Zenjiro Konishi and Robert Gl{\"u}ck},
  booktitle={ASIA-PEPM},
  year={2002}
}
This paper shows that Generalized Partial Computation (GPC) can automatically generate efficient string matching algorithms. GPC is a program transformation method utilizing partial information about input data and auxiliary functions as well as the logical structure of a source program. GPC uses both a classical partial evaluator and an inference engine such as a theorem prover to optimize programs. First, we show that a Boyer-Moore (BM) type pattern matcher without the bad-character heuristic… CONTINUE READING