| Livio Colussi. Correctness and e#ciency of pattern matching algorithms. Information and Computation, 95:225--251, 1991. |
.... some sense following Knuth s steps since he obtained the behavior of the KMP by calculating it from Cook s construction [39, page 338] Examples include Dijkstra s use of invariants [24] Bird s tabulation technique [8] Takeichi and Akama s equational reasoning [53] Colussi s use of Hoare logic [17], and just recently Hernandez and Rosenblueth s logic program derivation [31] Further variants of the KMP can be found, e.g. in Watson s PhD thesis [54] and in Crochemore and Hancart s chapter in the Handbook of Algorithms and Theory of Computation [22] 22 6.4 Other derivations of Boyer and ....
Livio Colussi. Correctness and e#ciency of pattern matching algorithms. Information and Computation, 95:225--251, 1991.
.... since Knuth s own construction (he ob9 tained it by calculating it from Cook s construction [24, page 338] Examples of the methods used are Dijkstra s invariants [12] Bird s recursion introduction and tabulation [5] Takeichi and Akama s equational reasoning [33] Colussi s Hoare logic [9], and Hernandez and Rosenblueth s logic program derivation [18] Bird s recursion introduction and tabulation is our closest related work. Bird derives the Morris Pratt matcher from a quadratic time stack algorithm using recursion introduction. The recursive failure function he derives is ....
Livio Colussi. Correctness and e#ciency of pattern matching algorithms. Information and Computation, 95:225--251, 1991.
No context found.
Livio Colussi. Correctness and e#ciency of pattern matching algorithms. Information and Computation, 95:225--251, 1991.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC