Skip to main content
Springer Nature Link
Log in

Another case study on reusability of transformational developments

Pattern Matching according to Knuth, Morris, and Pratt

  • Part I. Development Models and Reusability
  • Chapter
  • First Online:
Methods of Programming

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 544))

  • 133 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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 1985

    Google Scholar 

  2. Berghammer, R., Ehler, H.: On the use of elements of functional programming in program development by transformations. This Volume

    Google Scholar 

  3. 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, R.S., Moore, J.S.: A fast string searching algorithm. Comm. ACM 20:10, 762–772 (1977)

    Google Scholar 

  5. 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, 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, H.: Specification and transformation of programs — A formal approach to software development. Berlin: Springer 1990

    Google Scholar 

  8. 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, P.: Literate Program derivation: A case study. This volume

    Google Scholar 

  10. Völker, N.: Deriving String Matching Algorithms. Technical Report KU Nijmegen 1990 (to appear)

    Google Scholar 

  11. van der Woude, J.: Playing with patterns, searching for strings. Science of Computer Programming 12, 177–190 (1989)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Nijmegen, Toernooiveld 1, 6525, ED Nijmegen, The Netherlands

    H. A. Partsch & N. Völker

Authors
  1. H. A. Partsch
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. N. Völker
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Manfred Broy Martin Wirsing

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Partsch, H.A., Völker, N. (1991). Another case study on reusability of transformational developments. In: Broy, M., Wirsing, M. (eds) Methods of Programming. Lecture Notes in Computer Science, vol 544. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0018268

Download citation

  • DOI: https://doi.org/10.1007/BFb0018268

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54576-7

  • Online ISBN: 978-3-540-38491-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics