Automatic generation of efficient string matching algorithms by generalized partial computation

Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation

Volumn , Issue SEP., 2002, Pages 1-8

  Futamura, Yoshihiko ^a   Konishi, Zenjiro ^a   Glück, Robert ^a  

^a WASEDA UNIVERSITY   (Japan)

Author keywords

Automatic program generation; Boyer Moore pattern matcher; Knuth Morris Pratt pattern matcher; Naive pattern matcher

Indexed keywords

ALGORITHMS; AUTOMATIC PROGRAMMING; COMPUTER PROGRAMMING LANGUAGES; INFERENCE ENGINES; OPTIMIZATION; PATTERN MATCHING; SEMANTICS; THEOREM PROVING;

BOYER-MOORE PATTERN MATCHER; GENERALIZED PARTIAL COMPUTATION; KNUTH-MORRIS-PRATT PATTERN MATCHER;

PROGRAM PROCESSORS;

EID: 0036953614     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/568173.568174     Document Type: Conference Paper

References (14)

1. Ager, M.S., Danvy, O. and Rohde, H.K.: On Obtaining the KMP String Matcher by Partial Evaluation, ASIA-PEPM 2002, September, 2002.
2. Amtoft, T., Consel, C., Danvy, O. and Malmkjaer, K.: The abstraction and instantiation of string-matching programs, BRICS RS-01-12, Department of Computer Science, University of Aarhus, April 2001.
3. Boyer, R.S. and Moore, J.S.: A fast string searching algorithm, Comm. ACM 20 (10) (1977) 762-772.
4. Cole, R.: Tight bounds on the complexity of the Boyer-Moore string matching algorithm, SIAM Journal on Computing, Vol.23, Issue 5 (October 1994), 1075-1091.
5. Consel, C. and Danvy, O.: Partial evaluation of pattern matching in strings, Information Processing Letters, 30 (2), January 1989, 79-86.
6. Cormen, T.H., Leiserson, C.E. and Rivest, R.L.: Introduction to Algorithms (first edition), MIT Press, 1990.
7. Futamura, Y. and Nogi, K. Generalized partial computation. in Bjørner, D. and Ershov, A. P. and Jones, N. D. (eds), Partial Evaluation and Mixed Computation, 133-151, North-Holland, 1988.
8. Futamura, Y., Nogi, K. and Takano, A.: Essence of generalized partial computation, Theoretical Computer Science 90 (1991), 61-79.
9. Futamura, Y., Konishi, Z. and Glück, R.: Program Transformation system based on Generalized Partial Computation, New Generation Computing, Vol.20, No. 1, Nov 2001. 75-99.
10. Glück R. and Klimov A.V. Occam's razor in metacomputation: the notion of a perfect process tree. In: CousotP., et al. (eds.), Static Analysis. Lecture Notes in Comp. Science, Vol. 724, Springer-Verlag 1993, 112-123.
11. Jones, N. D.: An Introduction to Partial Evaluation, ACM Computing Surveys, Vol.28, No.3, September 1996, 480-503.
12. Knuth, D.E., Morris, J. and Pratt, V.: Fast pattern matching in strings. SIAM Journal on Computing, 6(1973), 325-350.
13. Pettorossi, A. and Proietti, M. Rules and Strategies for Transforming Functional and Logic Programs, ACM Computing Surveys, Vol.28, No.2, June 1996, 360-414.
14. Sørensen, M. H., Glück, R., Jones N. D., A positive supercompiler. In: Journal of Functional Programming, 6(6), 1996. 811-838.