Certification of proving termination of term rewriting by matrix interpretations

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

Volumn 4910 LNCS, Issue , 2008, Pages 328-339

  Koprowski, Adam ^a   Zantema, Hans ^a  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

PROGRAM INTERPRETERS; PROJECT MANAGEMENT; THEOREM PROVING;

COLOR PROJECT; MATRIX INTERPRETATION METHOD; TERM REWRITING; TERMINATION COMPETITION;

MATRIX ALGEBRA;

EID: 38549137410     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-77566-9_28     Document Type: Conference Paper

References (18)

1. The Coq proof assistant, http://coq.inria.fr
2. The RTA list of open problems, http://wwv.lsv.ens-cachan.fr/rtaloop
3. Termination competition, http://www.lri.fr/~marche/termination- competition
4. Termination problems data base, http://www.lri.fr/~marche/tpdb
5. Arts, T., Giesl, J.: Termination of term rewriting using dependency pairs. Theoretical Computer Science 236(1-2), 133-178 (2000)
6. Blanqui, F., Delobel, W., Coupet-Grimal, S., Hinderer, S., Koprowski, A.: CoLoR, a Coq library on rewriting and termination. In: 8th WST (2006)
7. Contejean, E., Courtieu, P., Forest, J., Pons, O., Urbain, X.: Certification of automated termination proofs. In: Konev, B., Wolter, F. (eds.) FroCoS 2007. LNCS(LNAI), vol. 4720, pp. 148-162. Springer, Heidelberg (2007)
8. Contejean, E., Marché, C., Monate, B., Urbain, X.: The CiME rewrite tool, http://cime.lri.fr
9. 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, pp. 574-588. Springer, Heidelberg (2006)
10. Endrullis, J., Waldmann, J., Zantema, H.: Matrix interpretations for proving termination of term rewriting. Journal of Automated Reasoning (accepted, 2007)
11. Giesl, J., Thiemann, R., Schneider-Kamp, P.: The dependency pair framework: Combining techniques for automated termination proofs. In: Baader, F., Voronkov, A. (eds.) LPAR 2004. LNCS (LNAI), vol. 3452, pp. 301-331. Springer, Heidelberg (2005)
12. Hirokawa, N., Middeldorp, A.: Tyrolean termination tool: Techniques and features. Information and Computation 205(4), 474-511 (2007)
13. Koprowski, A.: TPA: Termination proved automatically. In: Pfenning, F. (ed.) RTA 2006. LNCS, vol. 4098, pp. 257-266. Springer, Heidelberg (2006)
14. Koprowski, A., Zantema, H.: Certification of matrix interpretations in Coq. In: 9th WST (2007)
15. Koprowski, A., Zantema, H.: Certification of proving termination of term rewriting by matrix interpretations. Technical Report CS-Report 07/22, Eindhoven University of Technology (August 2007), http://www.win.tue.nl/ akoprows/papers/mint-cert-TR.pdf
16. Krauss, A.: Certified size-change termination. In: CADE 2007. LNCS (LNAI), vol. 4603, pp. 460-475. Springer, Heidelberg (2007)
17. Magaud, N.: Ring properties for square matrices. Coq contributions, http://coq.inria.fr/contribs-eng.html
18. Marché, C., Zantema, H.: The Termination Competition 2007. In: RTA 2007. LNCS, vol. 4533, pp. 303-313. Springer, Heidelberg (2007)