Skip to main content
SpringerLink
Log in

Matchbox: A Tool for Match-Bounded String Rewriting

  • Conference paper
Rewriting Techniques and Applications (RTA 2004)

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

Included in the following conference series:

Abstract

The program Matchbox implements the exact computation of the set of descendants of a regular language, and of the set of non-terminating strings, with respect to an (inverse) match-bounded string rewriting system. Matchbox can search for proof or disproof of a Boolean combination of match-height properties of a given rewrite system, and some of its transformed variants. This is applied in various ways to search for proofs of termination and non-termination. Matchbox is the first program that delivers automated proofs of termination for some difficult string rewriting systems.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Dershowitz, N.: Termination of linear rewriting systems. In: Even, S., Kariv, O. (eds.) ICALP 1981. LNCS, vol. 115, pp. 448–458. Springer, Heidelberg (1981)

    Google Scholar 

  2. Dershowitz, N.: Termination of rewriting. J. Symbolic Comput. 3(1–2), 69–115 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  3. Geser, A.: Decidability of Termination of Grid String Rewriting Rules. SIAM J. Comput. 31(4), 1156–1168 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  4. Geser, A., Hofbauer, D., Waldmann, J.: Match-bounded string rewriting systems. In: Rovan, B., Vojtáš, P. (eds.) MFCS 2003. LNCS, vol. 2747, pp. 449–459. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  5. Geser, A., Hofbauer, D., Waldmann, J.: Match-bounded string rewriting systems and automated termination proofs. In: Rubio, A. (ed.) Proc. 6th Int. Workshop on Termination WST-03, Technical Report DSIC-II/15/03, Universidad Politécnica de Valencia, Spain, pp. 19–22 (2003)

    Google Scholar 

  6. Geser, A., Hofbauer, D., Waldmann, J.: Match-bounded string rewriting systems. NIA Report 2003-09, National Institute of Aerospace, Hampton, VA, USA., Available at http://research.nianet.org/~geser/papers/nia-matchbounded.html

  7. Geser, A., Hofbauer, D., Waldmann, J.: Termination proofs for string rewriting systems via inverse match-bounds. NIA Report 2003-XX, National Institute of Aerospace, Hampton, VA, USA., Available at http://research.nianet.org/~geser/papers/nia-inverse.html

  8. Geser, A., Hofbauer, D., Waldmann, J.: Deciding Termination for Ancestor Match-Bounded String Rewriting Systems. submitted to RTA-04

    Google Scholar 

  9. Hibbard, T.N.: Context-limited grammars. J. ACM 21(3), 446–453 (1974)

    Article  MATH  MathSciNet  Google Scholar 

  10. Hofbauer, D., Waldmann, J.: Deleting string rewriting systems preserve regularity. In: Ésik, Z., Fülöp, Z. (eds.) DLT 2003. LNCS, vol. 2710, pp. 337–348. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  11. Lankford, D.S., Musser, D.R.: A finite termination criterion. Technical Report, Information Sciences Institute, Univ. of Southern California, Marina-del-Rey, CA (1978)

    Google Scholar 

  12. Rahn, M., Waldmann, J.: The Leipzig autotool System for Grading Student Homework. In: Hanus, M., Krishnamurthi, S., Thompson, S. (eds.) Proc. Functional and Declarative Programming in Education FDPE-02. Technical Report No. 0210, Universitt Kiel (2002)

    Google Scholar 

  13. Ravikumar, B.: Peg-solitaire, string rewriting systems and finite automata. In: Leong, H.-V., Jain, S., Imai, H. (eds.) ISAAC 1997. LNCS, vol. 1350, pp. 233–242. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  14. Zantema, H.: TORPA: Termination Of Rewriting Proved Automatically, version 1.2 (2004), Available at http://www.win.tue.nl/~hzantema/torpa.html

Download references

Author information

Authors and Affiliations

  1. Fachbereich IMN, Hochschule für Technik, Wirtschaft und Kultur (FH) Leipzig, Postfach 30 11 66, D-04251, Leipzig, Germany

    Johannes Waldmann

Authors
  1. Johannes Waldmann
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Philosophy, Utrecht University, Heidelberglaan 8, 3584 CS, Utrecht, The Netherlands

    Vincent van Oostrom

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Waldmann, J. (2004). Matchbox: A Tool for Match-Bounded String Rewriting. In: van Oostrom, V. (eds) Rewriting Techniques and Applications. RTA 2004. Lecture Notes in Computer Science, vol 3091. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25979-4_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-25979-4_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22153-1

  • Online ISBN: 978-3-540-25979-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation