Skip to main content
SpringerLink
Log in

The Termination Competition

  • Conference paper
Term Rewriting and Applications (RTA 2007)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4533))

Included in the following conference series:

Abstract

Since 2004, a Termination Competition is organized every year. This competition boosted a lot the development of automatic termination tools, but also the design of new techniques for proving termination. We present the background, results, and conclusions of the three first editions, and discuss perspectives and challenges for the future.

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. Manna, Z., Ness, S.: On the termination of Markov algorithms. In: ICSS. pp. 789–792 (1970), http://perso.ens-lyon.fr/pierre.lescanne/not_accessible.html

  2. Lescanne, P.: Computer experiments with the REVE term rewriting system generator. In: Proc. POPL 1983 (1983)

    Google Scholar 

  3. Forgaard, R., Detlefs, D.: Reve 2.4: A program for generating and analyzing term rewriting systems. Massachusetts Institute (1984)

    Google Scholar 

  4. Steinbach, J.: Generating polynomial orderings. Information Processing Letters 49, 85–93 (1994)

    Article  MATH  Google Scholar 

  5. Dershowitz, N.: 33 examples of termination. In: Comon, H., Jouannaud, J.-P. (eds.) Spring School of Theoretical Computer Science. LNCS, vol. 909, pp. 16–26. Springer, Heidelberg (1995)

    Google Scholar 

  6. Steinbach, J., Kühler, U.: Check your ordering – termination proofs and open problems. Technical Report SEKI Report SR-90-25, Univ. Kaiserslautern (1990)

    Google Scholar 

  7. Arts, T., Giesl, J.: Termination of term rewriting using dependency pairs. Theoretical Computer Science 236, 133–178 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  8. Giesl, J., Schneider-Kamp, P., Thiemann, R.: The AProVE tool (RWTH, Aachen, Germany), http://aprove.informatik.rwth-aachen.de/

  9. Fissore, O., Gnaedig, I., Kirchner, H.: CARIBOO: A multi-strategy termination proof tool based on induction. In: Rubio, A. (ed.) WST, pp. 77–79 (2003)

    Google Scholar 

  10. Contejean, E., Marché, C., Urbain, X.: The CiME rewrite toolbox (LRI, Orsay, France), http://cime.lri.fr

  11. Waldmann, J.: The MatchBox tool (HTWK, Leipzig, Germany), http://dfa.imn.htwk-leipzig.de/matchbox/

  12. Borralleras, C., Rubio, A.: The termptation tool (Universitat Politecnica de Catalunya, Spain), http://www.lsi.upc.es/~albert/term.html

  13. Hirokawa, N., Middeldorp, A.: Tyrolean Termination Tool (Innsbruck Universität, Austria), http://colo6-c703.uibk.ac.at/ttt/

  14. Claves, C., Ohlebusch, E.: The TALP tool (University of Bielefeld, Germany), http://bibiserv.techfak.uni-bielefeld.de/talp/

  15. Codish, M., Taboch, C.: the TerminWeb tool (Ben Gurion University, Israel), http://www.cs.bgu.ac.il/~mcodish/TerminWeb/

  16. Serebrenik, A., De Schreye, D.: The Hasta-La-Vista tool (K.U. Leuven, Belgium)

    Google Scholar 

  17. Zantema, H.: The TORPA tool (Technische Universteit Eindhoven, The Netherlands), http://www.win.tue.nl/~hzantema/torpa.html

  18. Koprowski, A.: The TPA tool (Technische Universteit Eindhoven, The Netherlands), http://www.win.tue.nl/tpa

  19. van der Wulp, J.: The TEPARLA tool (Technische Universteit Eindhoven, The Netherlands), http://www.win.tue.nl/~hzantema/torpa.html

  20. Endrullis, J.: The JamBox tool (Free University in Amsterdam, The Netherlands), http://joerg.endrullis.de/

  21. Korp, M.: The TTTbox (Innsbruck Universität, Austria), http://homepage.uibk.ac.at/~csad2836/TTTbox.html

  22. Lucas, S.: Mu-term, a tool for proving termination of rewriting with replacement restrictions (2003), http://www.dsic.upv.es/~slucas/csr/termination/muterm/

  23. Hofbauer, D.: The MultumNonMulta tool (Kassel, Germany), http://www.theory.informatik.uni-kassel.de/~dieter/multum/

  24. Hofbauer, D., Waldmann, J.: Termination of {aa→bc,bb→ac,cc→ab}. Information Processing Letters 98(4), 156–158 (2006)

    Article  MathSciNet  Google Scholar 

  25. Hofbauer, D., Waldmann, J.: Termination of string rewriting with matrix interpretations. In: Pfenning, F. (ed.) RTA 2006. LNCS, vol. 4098, Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  26. Endrullis, J., Waldmann, J., Zantema, H.: Matrix interpretations for proving termination of term rewriting. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), vol. 4130, Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  27. Codish, M., Schneider-Kamp, P., Lagoon, V., Thiemann, R., Giesl, J.: Sat solving for argument filterings. In: Hermann, M., Voronkov, A. (eds.) LPAR 2006. LNCS (LNAI), vol. 4246, pp. 30–44. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  28. Giesl, J., Thiemann, R., Schneider-Kamp, P.: Proving and disproving termination of higher-order functions. In: Gramlich, B. (ed.) FroCoS. LNCS (LNAI), vol. 3717, pp. 216–231. Springer, Heidelberg (2005)

    Google Scholar 

  29. Hirokawa, N., Middeldorp, A.: Polynomial interpretations with negative coefficients. In: Buchberger, B., Campbell, J.A. (eds.) AISC 2004. LNCS (LNAI), vol. 3249, pp. 185–198. Springer, Heidelberg (2004)

    Google Scholar 

  30. Hirokawa, N., Middeldorp, A.: Dependency pairs revisited. In: van Oostrom, V. (ed.) RTA 2004. LNCS, vol. 3091, pp. 249–268. Springer, Heidelberg (2004)

    Google Scholar 

  31. Geser, A., Hofbauer, D., Waldmann, J., Zantema, H.: On tree automata that certify termination of left-linear term rewriting systems. Information and Computation 205(4), 512–534 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  32. Blanqui, F.: CoLoR project (INRIA Lorraine, France), http://color.loria.fr/

  33. Urbain, X., Forest, J., Courtieu, P.: The A3PAT project (Cédric, CNAM, Paris, France), http://www3.ensiie.fr/~urbain/a3pat

  34. Podelski, A.: The TERMINATOR project (Microsoft Research, Cambridge, UK), http://research.microsoft.com/TERMINATOR/

  35. Zantema, H., Waldmann, J.: Termination by quasi-periodic interpretations. In: Baader, F. (ed.) RTA 2007. LNCS, Springer, Heidelberg (2007)

    Google Scholar 

  36. Contejean, E., Marché, C., Rabehasaina, L.: Rewrite systems for natural, integral, and rational arithmetic. In: Comon, H. (ed.) Rewriting Techniques and Applications. LNCS, vol. 1232, Springer, Heidelberg (1997)

    Google Scholar 

  37. Deplagne, É.: Sequent Calculus Viewed Modulo. In: Pilière, C. (ed.) ESSLLI Student Session, Univ. Birmingham, pp. 66–76 (2000)

    Google Scholar 

  38. Zantema, H.: Termination of term rewriting by semantic labelling. Fundamenta Informaticae 24, 89–105 (1995)

    MATH  MathSciNet  Google Scholar 

  39. Cohen, D., Watson, P.: An efficient representation of arithmetic for term rewriting. In: Book, R.V. (ed.) RTA’91. LNCS, vol. 488, pp. 240–251. Springer, Heidelberg (1991)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. INRIA Futurs, ProVal, Parc Orsay Université, F-91893,  

    Claude Marché

  2. Lab. de Recherche en Informatique, Univ Paris-Sud, CNRS, Orsay, F-91405,  

    Claude Marché

  3. Department of Computer Science, Technische Universiteit Eindhoven, P.O. Box 513, 5600 MB, Eindhoven, The Netherlands

    Hans Zantema

Authors
  1. Claude Marché
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hans Zantema
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Franz Baader

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Marché, C., Zantema, H. (2007). The Termination Competition. In: Baader, F. (eds) Term Rewriting and Applications. RTA 2007. Lecture Notes in Computer Science, vol 4533. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73449-9_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-73449-9_23

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-73447-5

  • Online ISBN: 978-3-540-73449-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation