The Boyer Moore Galil string searching strategies revisited
SIAM Journal on Computing
Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Partial evaluation of pattern matching in strings
Information Processing Letters
A note on synthesis and classification of sorting algorithms
Acta Informatica
A very fast substring search algorithm
Communications of the ACM
Partial evaluation of pattern matching in constraint logic programming languages
PEPM '91 Proceedings of the 1991 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Journal of the ACM (JACM)
String searching algorithms
Text algorithms
A taxonomy of sublinear multiple keyword pattern matching algorithms
Science of Computer Programming
Algebra of programming
A fast string searching algorithm
Communications of the ACM
Unfold/Fold Transformations For Definite Clause Programs
PLILP '94 Proceedings of the 6th International Symposium on Programming Language Implementation and Logic Programming
Enhancing Partial Deduction via Unfold/Fold Rules
LOPSTR '96 Proceedings of the 6th International Workshop on Logic Programming Synthesis and Transformation
Literate Program Derivation: A Case Study
Method of Programming, Selected Papers on the CIP-Project
Deriving Efficient Graph Algorithms (Summary)
Proceedings of the Carnegie Mellon Workshop on Logic of Programs
Development reuse and the logic program derivation of two string-matching algorithms
Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming
The abstraction and instantiation of string-matching programs
The essence of computation
Disjunctive partial deduction of a right-to-left string-matching algorithm
Information Processing Letters
Proceedings of the 2005 ACM SIGPLAN workshop on Haskell
On obtaining the Boyer-Moore string-matching algorithm by partial evaluation
Information Processing Letters
On the Design and Development of Program Families
IEEE Transactions on Software Engineering
| Hi-index | 0.00 |
This paper presents a taxonomy of some exact, right-to-left, string-matching algorithms. The taxonomy is based on results obtained by using logic program transformation over a naive and nondeterministic specification. A derivation of the search part and some notes about the preprocessing part of each algorithm is presented. The derivations show several design decisions behind each algorithm, and allow us to organize the algorithms within a taxonomic tree, giving us a better understanding of these algorithms and possible mechanical procedures to derive them.