Certification of automated termination proofs

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

Volumn 4720 LNAI, Issue , 2007, Pages 148-162

  Contejean, Evelyne ^a   Courtieu, Pierre ^b   Forest, Julien ^b   Pons, Olivier ^b   Urbain, Xavier ^b  

^a UFR 919 Laboratoire d'Informatique Pour la Mécanique et les Sciences de l'Ingénieur   (France)

^b University of Paris Cité

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; DECISION MAKING; INTERACTIVE COMPUTER SYSTEMS; USER INTERFACES;

AUTOMATED TERMINATION PROOFS; AUTOMATED TOOLS; PROOF ASSISTANTS;

RELIABILITY ANALYSIS;

EID: 38049052465     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74621-8_10     Document Type: Conference Paper

References (29)

1. Arts, T., Giesl, J.: Termination of term rewriting using dependency pairs. Theoretical Computer Science 236, 133-178 (2000)
2. Baader, F., Nipkow, T.: Term Rewriting and AU That. Cambridge University Press, Cambridge (1998)
3. Bezem, M., Hendriks, D., de Nivelle, H.: Automated proof construction in type theory using resolution. J. Autom. Reasoning 29(3-4), 253-275 (2002)
4. Blanqui, F., Coupet-Grimal, S., Delobel, W., Hinderer, S., Koprowski, A.: Color, a coq library on rewriting and termination. In: Geser and Sondergaard [16]
5. Contejean, E.: A certified AC matching algorithm. In: van Oostrom, V. (ed.) RTA 2004. LNCS, vol. 3091, pp. 70-84. Springer, Heidelberg (2004)
6. Contejean, E.: Coccinelle (2005), http://www.lri.fr/~contejea/Coccinelle/ coccinelle.html
7. Contejean, E., Corbineau, P.: Reflecting proofs in first-order logic with equality. In: Nieuwenhuis, R. (ed.) CADE 2005. LNCS (LNAI), vol. 3632, pp. 7-22. Springer, Heidelberg (2005)
8. Contejean, E., Marché, C., Monate, B., Urbain, X.: Proving termination of rewriting with cime. In: Rubio [27], pp. 71-73, http://cime.lri.fr
9. Coquand, T., Paulin-Mohring, C.: Inductively defined types. In: Martin-Löf, P., Mints, G. (eds.) COLOG-88. LNCS, vol. 417, Springer, Heidelberg (1990)
10. Dershowitz, N.: Orderings for term rewriting systems. Theoretical Computer Science 17(3), 279-301 (1982)
11. Dershowitz, N.: Termination of rewriting. Journal of Symbolic Computation 3(1), 69-115 (1987)
12. Dershowitz, N.: Termination Dependencies. In: Rubio [27] Technical Report DSIC 11/15/03, Univ. Politécnica de Valencia, Spain
13. Dershowitz, N., Jouannaud, J.-P.: Rewrite systems. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol. B, pp. 243-320. North-Holland, Amsterdam (1990)
14. Doligez, D.: Zenon, http://focal.inria.fr/zenon/
15. Endrullis, J.: Jambox, http://joerg.endrullis.de/index.html.
16. Geser, A., Sondergaard, H. (eds.).: Extended Abstracts of the 8th International Workshop on Termination, WST'06 (August 2006)
17. Giesl, J., Schneider-Kamp, P., Thiemann, R.: Aprove 1.2: Automatic termination proofs in the dependency pair framework. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), vol. 4130, Springer, Heidelberg (2006)
18. Giesl, J., Thiemann, R., Schneider-Kamp, P., Falke, S.: Mechanizing and Improving Dependency Pairs. Journal of Automated Reasoning 37(3), 155-203 (2006)
19. Hirokawa, N., Middeldorp, A.: Automating the dependency pair method. In: Baader, F. (ed.) CADE 2003. LNCS (LNAI), vol. 2741, pp. 32-46. Springer, Heidelberg (2003)
20. Hirokawa, N., Middeldorp, A.: Tyrolean termination tool. In: Giesl, J. (ed.) RTA 2005. LNCS, vol. 3467, pp. 175-184. Springer, Heidelberg (2005)
21. Hubert, T.: Certification des preuves de terminaison en Coq. Rapport de DEA, Université Paris 7, In French (September 2004)
22. Koprowski, A.: TPA, http://www.win.tue.nl/tpa
23. Lankford, D.S.: On proving term rewriting systems are Noetherian.Technical Report MTP-3, Mathematics Department, Louisiana Tech. Univ., (1979) Available at http://perso.ens-lyon.fr/pierre.lescanne/ not_accessible.html
24. Marché, C., Zantema, H.: The termination competition 2006. In Geser and Sondergaard [16], http://www.Iri.fr/~marche/termination-competition/
25. Nguyen, Q.H., Kirchner, C., Kirchner, H.: External rewriting for skeptical proof assistants. J. Autom. Reasoning 29(3-4), 309-336 (2002)
26. Nipkow, T., Paulson, L.C., Wenzel, M.: Isabelle/HOL - A Proof Assistant for Higher-Order Logic. In: Nipkow, T., Paulson, L.C., Wenzel, M. (eds.) Isabelle/HOL. LNCS, vol. 2283, Springer, Heidelberg (2002)
27. Rubio, A., (ed.).: Extended Abstracts of the 6th International Workshop on Termination, WST'03, Technical Report DSIC 11/15/03, Univ. Politécnica de Valencia, Spain (June 2003)
28. The Coq Development Team. The Coq Proof Assistant Documentation - Version V8.1, (February 2007), http://coq.inria.fr.
29. Urbain, X.: Modular and incremental automated termination proofs. Journal of Automated Reasoning 32, 315-355 (2004)