String-matching consists in finding all the occurrences of a word w in a text t. Several algorithms have been found for solving this problem. They are presented by Aho in a recent book [l]. Among these algorithms, the Boyer-Moore approach [S, 1 l] seems to lead to the fastest algorithms for the search phase. Even if the original version of the Bayer-Moore algorithm has a quadratic worst case, i...

In this paper, we investigate the potential of the Boyer-Moore waterfall model for the automation of inductive proofs within a modern proof assistant. We analyze the basic concepts and methodology underlying this 30-year-old model and implement a new, fully integrated tool in the theorem prover HOL Light that can be invoked as a tactic. We also describe several extensions and enhancements to th...

Non-invariant solutions of the Boyer-Finley equation determine exact solutions of the Einstein field equations with only one rotational Killing vector. For the case of Euclidean signature such a metric was constructed by Calderbank and Tod. Recently Martina, Sheftel and Winternitz applied the method of group foliation to the Boyer-Finley equation and reproduced the Calderbank-Tod solution toget...