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

Information Processing Letters

Volumn 87, Issue 5, 2003, Pages 235-241

  Hernández, Manuel ^a   Rosenblueth, David A ^a  

^a UNIVERSIDAD NACIONAL AUTÓNOMA DE MÉXICO   (Mexico)

Author keywords

Partial deduction; Program derivation; String matching

Indexed keywords

ALGORITHMS; INFORMATION ANALYSIS; PROBLEM SOLVING; THEOREM PROVING;

STRING MATCHING;

PATTERN MATCHING;

EID: 0043093778     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(03)00309-0     Document Type: Article

References (6)

1. Boyer R.S., Moore J.S. A fast string searching algorithm. Comm. ACM. 20:(10):1977;762-772.
2. Crochemore M., Rytter W. Text Algorithms. 1994;Oxford University Press, Oxford.
3. Hernández M., Rosenblueth D.A. Development reuse and the logic program derivation of two string-matching algorithms. Proc. PPDP'01, Florence, Italy. 2001;38-48.
4. Knuth D.E., Morris J.H., Pratt V.R. Fast pattern matching in strings. SIAM J. Comput. 6:(2):1977;323-350.
5. Pettorossi A., Proietti M., Renault S. Enhancing partial deduction via unfold/fold rules. Proc. 6th LOPSTR, Stockholm, Sweden. Lecture Notes in Comput. Sci. 1207:1996;146-168 Springer, Berlin.
6. Stephen G.A. String Searching Algorithms. Lecture Notes Ser. Comput. 3:1994;World Scientific Publishing, Singapore.