Deriving the Aho-Corasick algorithms : a case study into the synergy of programming methods
van Hpj Rik Geldrop · TU/e Research Portal · 1993
Imperative programs can be derived using methods like stepwise refinement, but they do not lend themselves very well to transformational programming. The BirdMeertens approach offers a powerful transformation calculus for functional programs, but it pays little or no attention to imperative algorithms. In this paper we will show how the two approaches can be combined by giving a transformational derivation of some efficient and practical imperative programs, viz. the Aho-Corasick string pattern matching algorithms