Arctic termination ... Below zero

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5117 LNCS, Issue , 2008, Pages 202-216

  Koprowski, Adam ^a   Waldmann, Johannes ^b  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b LEIPZIG UNIVERSITY OF APPLIED SCIENCES   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION THEORY;

DEPENDENCY PAIRS; FORMAL VERIFICATIONS; INTERNATIONAL CONFERENCES; MATRIX METHODS; NATURAL NUMBERS; PROOF ASSISTANTS; SEMI-RING; STRING REWRITING; TERM REWRITING; TERMINATION PROBLEMS;

MATRIX ALGEBRA;

EID: 48949084905     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70590-1_14     Document Type: Conference Paper

References (27)

1. Amadio, R.M.: Synthesis of max-plus quasi-interpretations. Fundamenta Informaticae 65(1-2), 29-60 (2005)
2. Arts, T., Giesl, J.: Termination of term rewriting using dependency pairs. TCS 236(1-2), 133-178 (2000)
3. Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)
4. Blanqui, F., Delobel, W., Coupet-Grimal, S., Hinderer, S., Koprowski, A.: CoLoR, a Coq library on rewriting and termination. In: WST (2006), http://color.loria.fr
5. Eén, N., Sörensson, N.: An extensible sat-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 502-518. Springer, Heidelberg (2004)
6. Endrullis, J.: Jambox, http://joerg.endrullis.de
7. Endrullis, J., Waldmann, J., Zantema, H.: Matrix interpretations for proving termination of term rewriting. Journal of Automated Reasoning (to appear, 2007)
8. Fuchs, L.: Partially Ordered Algebraic Systems. Addison-Wesley, Reading (1962)
9. Gaubert, S., Plus, M.: Methods and applications of (max, +) linear algebra. In: Reischuk, R., Morvan, M. (eds.) STACS 1997. LNCS, vol. 1200, pp. 261-282. Springer, Heidelberg (1997)
10. Giesl, J., Arts, T., Ohlebusch, E.: Modular termination proofs for rewriting using dependency pairs. Journal of Symbolic Computation 34(1), 21-58 (2002)
11. Giesl, J., Thiemann, R., Schneider-Kamp, P., Falke, S.: Automated termination proofs with AProVE. In: van Oostrom, V. (ed.) RTA 2004. LNCS, vol. 3091, pp. 210-220. Springer, Heidelberg (2004)
12. Giesl, J., Thiemann, R., Swiderski, S., Schneider-Kamp, P.: Proving termination by bounded increase. In: Pfenning, F. (ed.) CADE 2007. LNCS (LNAI), vol. 4603, pp. 443-459. Springer, Heidelberg (2007)
13. Golan, J.S.: Semirings and their Applications. Kluwer, Dordrecht (1999)
14. 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)
15. Hirokawa, N., Middeldorp, A.: Tyrolean termination tool: Techniques and features. Information and Computation 205(4), 474-511 (2007)
16. Hofbauer, D., Lautemann, C.: Termination proofs and the length of derivations. In: Dershowitz, N. (ed.) RTA 1989. LNCS, vol. 355, pp. 167-177. Springer, Heidelberg (1989)
17. Hofbauer, D., Waldmann, J.: Termination of string rewriting with matrix interpretations. In: Pfenning, F. (ed.) RTA 2006. LNCS, vol. 4098, pp. 328-342. Springer, Heidelberg (2006)
18. Koprowski, A.: TPA: Termination proved automatically. In: Pfenning, F. (ed.) RTA 2006. LNCS, vol. 4098, pp. 257-266. Springer, Heidelberg (2006), http://www.win.tue.nl/tpa
19. Koprowski, A., Zantema, H.: Certification of proving termination of term rewriting by matrix interpretations. In: SOFSEM. LNCS, vol. 4910, pp. 328-339 (2008)
20. Krob, D.: The equality problem for rational series with multiplicities in the tropical semiring is undecidable. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol. 623, pp. 101-112. Springer, Heidelberg (1992)
21. Waldmann, J.: Matchbox: A tool for match-bounded string rewriting. In: van Oostrom, V. (ed.) RTA 2004. LNCS, vol. 3091, pp. 85-94. Springer, Heidelberg (2004), http://dfa.imn.htwk-leipzig.de/matchbox
22. Waldmann, J.: Arctic termination. In: WST (2007)
23. Waldmann, J.: Weighted automata for proving termination of string rewriting. Journal of Automata, Languages and Combinatorics (to appear, 2007)
24. Zantema, H., Waldmann, J.: Termination by quasi-periodic interpretations. In: Baader, F. (ed.) RTA 2007. LNCS, vol. 4533, pp. 404-418. Springer, Heidelberg (2007)
25. The Coq proof assistant, http://coq.inria.fr
26. Termination competition, http://www.lri.fr/~marche/termination- competition
27. Termination problems data base, http://www.lri.fr/~marche/tpdb