Advertisement

Another case study on reusability of transformational developments

Pattern Matching according to Knuth, Morris, and Pratt
  • H. A. Partsch
  • N. Völker
Part I. Development Models and Reusability
Part of the Lecture Notes in Computer Science book series (LNCS, volume 544)

Keywords

Pattern Match Transformation Step Empty String Transformational Development Pattern Match Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Bauer et al. 85]
    Bauer, F.L., Berghammer, R., Broy, M, Dosch, W., Geiselbrechtinger, F., Gnatz, R., Hangel, E., Hesse, W., Krieg-Brückner, B., Laut, A., Matzner, T., Möller, B., Nickl, F., Partsch, H., Pepper, P., Samelson, K., Wirsing, M., Wössner, H.: The Munich project CIP. Volume I: The wide spectrum language CIP-L. Lecture Notes in Computer Science 183, Berlin: Springer 1985Google Scholar
  2. [Berghammer, Ehler 90]
    Berghammer, R., Ehler, H.: On the use of elements of functional programming in program development by transformations. This VolumeGoogle Scholar
  3. [Bird et al. 88]
    Bird, R.S., Gibbons, J., Jones, G.: Formal derivation of a pattern matching algorithm. Programming Research Group, Oxford University, Technical Report 1988. Also: Science of Computer Programming 12, 93–104 (1989)Google Scholar
  4. [Boyer, Moore 77]
    Boyer, R.S., Moore, J.S.: A fast string searching algorithm. Comm. ACM 20:10, 762–772 (1977)Google Scholar
  5. [Knuth et al. 77]
    Knuth, D.E., Morris, J.H., Pratt, V.B.: Fast pattern matching in strings. SIAM Journal of Computing 6, 323–350 (1977)Google Scholar
  6. [Partsch 90a]
    Partsch, H.: Reusability of transformational developments. In: Broy, M. (ed.): Informatik im Kreuzungspunkt von Numerischer Mathematik, Rechnerentwurf, Programmierung, Algebra und Logik. Berlin: Springer 1990 (to appear)Google Scholar
  7. [Partsch 90b]
    Partsch, H.: Specification and transformation of programs — A formal approach to software development. Berlin: Springer 1990Google Scholar
  8. [Partsch, Stomp 89]
    Partsch, H., Stomp, F.A.: A fast pattern matching algorithm derived by transformational and assertional reasoning. KU Nijmegen, Technical Report 1989. Also: Formal Aspects of Computing 1990 (to appear)Google Scholar
  9. [Pepper 90]
    Pepper, P.: Literate Program derivation: A case study. This volumeGoogle Scholar
  10. [Völker 90]
    Völker, N.: Deriving String Matching Algorithms. Technical Report KU Nijmegen 1990 (to appear)Google Scholar
  11. [van der Woude 89]
    van der Woude, J.: Playing with patterns, searching for strings. Science of Computer Programming 12, 177–190 (1989)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • H. A. Partsch
    • 1
  • N. Völker
    • 1
  1. 1.Department of Computer ScienceUniversity of NijmegenED NijmegenThe Netherlands

Personalised recommendations