Disjunctive partial deduction of a right-to-left string-matching algorithm

Authors:
Manuel Hernández;David A. Rosenblueth
Affiliations:
Instituto de Investigaciones en Matemáticas Aplicadas y en Sistemas, Universidad Nacional Autónoma de México, Apdo. 20-726, 01000 México D. F., Mexico;Instituto de Investigaciones en Matemáticas Aplicadas y en Sistemas, Universidad Nacional Autónoma de México, Apdo. 20-726, 01000 México D. F., Mexico
Venue:
Information Processing Letters
Year:
2003

Citing 5
Cited 3

String searching algorithms

String searching algorithms
Text algorithms

Text algorithms
A fast string searching algorithm

Communications of the ACM
Enhancing Partial Deduction via Unfold/Fold Rules

LOPSTR '96 Proceedings of the 6th International Workshop on Logic Programming Synthesis and Transformation
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

Fast partial evaluation of pattern matching in strings

ACM Transactions on Programming Languages and Systems (TOPLAS)
On obtaining the Boyer-Moore string-matching algorithm by partial evaluation

Information Processing Letters
A taxonomy of some right-to-left string-matching algorithms

WFLP'09 Proceedings of the 18th international conference on Functional and Constraint Logic Programming

Quantified Score

Hi-index	0.89

Visualization

Abstract

In spite of its practical importance, the Boyer-Moore string-matching algorithm has hardly been studied in the context of partial evaluation. We show how to derive the search stage of a variant of this algorithm using "disjunctive" partial deduction.