{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:44:08Z","timestamp":1725489848690},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540746201"},{"type":"electronic","value":"9783540746218"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-74621-8_10","type":"book-chapter","created":{"date-parts":[[2007,8,22]],"date-time":"2007-08-22T07:46:32Z","timestamp":1187768792000},"page":"148-162","source":"Crossref","is-referenced-by-count":17,"title":["Certification of Automated Termination Proofs"],"prefix":"10.1007","author":[{"given":"Evelyne","family":"Contejean","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre","family":"Courtieu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Julien","family":"Forest","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Olivier","family":"Pons","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xavier","family":"Urbain","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/S0304-3975(99)00207-8","volume":"236","author":"T. Arts","year":"2000","unstructured":"Arts, T., Giesl, J.: Termination of term rewriting using dependency pairs. Theoretical Computer Science\u00a0236, 133\u2013178 (2000)","journal-title":"Theoretical Computer Science"},{"key":"10_CR2","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139172752","volume-title":"Term Rewriting and All That","author":"F. Baader","year":"1998","unstructured":"Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)"},{"issue":"3-4","key":"10_CR3","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1023\/A:1021939521172","volume":"29","author":"M. Bezem","year":"2002","unstructured":"Bezem, M., Hendriks, D., de Nivelle, H.: Automated proof construction in type theory using resolution. J. Autom. Reasoning\u00a029(3-4), 253\u2013275 (2002)","journal-title":"J. Autom. Reasoning"},{"key":"10_CR4","unstructured":"Blanqui, F., Coupet-Grimal, S., Delobel, W., Hinderer, S., Koprowski, A.: Color, a coq library on rewriting and termination. In: Geser and Sondergaard [16]"},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1007\/978-3-540-25979-4_5","volume-title":"Rewriting Techniques and Applications","author":"E. Contejean","year":"2004","unstructured":"Contejean, E.: A certified AC matching algorithm. In: van Oostrom, V. (ed.) RTA 2004. LNCS, vol.\u00a03091, pp. 70\u201384. Springer, Heidelberg (2004)"},{"key":"10_CR6","unstructured":"Contejean, E.: Coccinelle (2005), \n                    \n                      http:\/\/www.lri.fr\/~contejea\/Coccinelle\/coccinelle.html"},{"key":"10_CR7","series-title":"Lecture Notes in Artificial Intelligence","first-page":"7","volume-title":"CADE 2005","author":"E. Contejean","year":"2005","unstructured":"Contejean, E., Corbineau, P.: Reflecting proofs in first-order logic with equality. In: Nieuwenhuis, R. (ed.) CADE 2005. LNCS (LNAI), vol.\u00a03632, pp. 7\u201322. Springer, Heidelberg (2005)"},{"key":"10_CR8","unstructured":"Contejean, E., March\u00e9, C., Monate, B., Urbain, X.: Proving termination of rewriting with cime. In: Rubio [27], pp. 71\u201373, \n                    \n                      http:\/\/cime.lri.fr"},{"key":"10_CR9","series-title":"Lecture Notes in Computer Science","volume-title":"COLOG-88","author":"T. Coquand","year":"1990","unstructured":"Coquand, T., Paulin-Mohring, C.: Inductively defined types. In: Martin-L\u00f6f, P., Mints, G. (eds.) COLOG-88. LNCS, vol.\u00a0417, Springer, Heidelberg (1990)"},{"issue":"3","key":"10_CR10","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/0304-3975(82)90026-3","volume":"17","author":"N. Dershowitz","year":"1982","unstructured":"Dershowitz, N.: Orderings for term rewriting systems. Theoretical Computer Science\u00a017(3), 279\u2013301 (1982)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"10_CR11","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/S0747-7171(87)80022-6","volume":"3","author":"N. Dershowitz","year":"1987","unstructured":"Dershowitz, N.: Termination of rewriting. Journal of Symbolic Computation\u00a03(1), 69\u2013115 (1987)","journal-title":"Journal of Symbolic Computation"},{"key":"10_CR12","unstructured":"Dershowitz, N.: Termination Dependencies. In: Rubio [27] Technical Report DSIC II\/15\/03, Univ. Polit\u00e9cnica de Valencia, Spain"},{"key":"10_CR13","first-page":"243","volume-title":"Handbook of Theoretical Computer Science","author":"N. Dershowitz","year":"1990","unstructured":"Dershowitz, N., Jouannaud, J.-P.: Rewrite systems. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol.\u00a0B, pp. 243\u2013320. North-Holland, Amsterdam (1990)"},{"key":"10_CR14","unstructured":"Doligez, D.: Zenon. \n                    \n                      http:\/\/focal.inria.fr\/zenon\/"},{"key":"10_CR15","unstructured":"Endrullis, J.: Jambox, \n                    \n                      http:\/\/joerg.endrullis.de\/index.html\n                    \n                    \n                  ."},{"key":"10_CR16","unstructured":"Geser, A., Sondergaard, H. (eds.).: Extended Abstracts of the 8th International Workshop on Termination, WST 2006 (August 2006)"},{"key":"10_CR17","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","DOI":"10.1007\/11814771_24","volume-title":"Automated Reasoning","author":"J. Giesl","year":"2006","unstructured":"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.\u00a04130, Springer, Heidelberg (2006)"},{"issue":"3","key":"10_CR18","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/s10817-006-9057-7","volume":"37","author":"J. Giesl","year":"2006","unstructured":"Giesl, J., Thiemann, R., Schneider-Kamp, P., Falke, S.: Mechanizing and Improving Dependency Pairs. Journal of Automated Reasoning\u00a037(3), 155\u2013203 (2006)","journal-title":"Journal of Automated Reasoning"},{"key":"10_CR19","series-title":"Lecture Notes in Artificial Intelligence","first-page":"32","volume-title":"CADE 2003","author":"N. Hirokawa","year":"2003","unstructured":"Hirokawa, N., Middeldorp, A.: Automating the dependency pair method. In: Baader, F. (ed.) CADE 2003. LNCS (LNAI), vol.\u00a02741, pp. 32\u201346. Springer, Heidelberg (2003)"},{"key":"10_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/978-3-540-32033-3_14","volume-title":"Term Rewriting and Applications","author":"N. Hirokawa","year":"2005","unstructured":"Hirokawa, N., Middeldorp, A.: Tyrolean termination tool. In: Giesl, J. (ed.) RTA 2005. LNCS, vol.\u00a03467, pp. 175\u2013184. Springer, Heidelberg (2005)"},{"key":"10_CR21","unstructured":"Hubert, T.: Certification des preuves de terminaison en Coq. Rapport de DEA, Universit\u00e9 Paris 7, In French (September 2004)"},{"key":"10_CR22","unstructured":"Koprowski, A.: TPA, \n                    \n                      http:\/\/www.win.tue.nl\/tpa"},{"key":"10_CR23","unstructured":"Lankford, D.S.: Onproving term rewriting systems are Noetherian.Technical Report MTP-3, Mathematics Department, Louisiana Tech. Univ., (1979) Available at \n                    \n                      http:\/\/perso.ens-lyon.fr\/pierre.lescanne\/not_accessible.html"},{"key":"10_CR24","unstructured":"March\u00e9, C., Zantema, H.: The termination competition 2006. In Geser and Sondergaard [16], \n                    \n                      http:\/\/www.lri.fr\/~marche\/termination-competition\/"},{"issue":"3-4","key":"10_CR25","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1023\/A:1021975117537","volume":"29","author":"Q.H. Nguyen","year":"2002","unstructured":"Nguyen, Q.H., Kirchner, C., Kirchner, H.: External rewriting for skeptical proof assistants. J. Autom. Reasoning\u00a029(3-4), 309\u2013336 (2002)","journal-title":"J. Autom. Reasoning"},{"key":"10_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-45949-9","volume-title":"Isabelle\/HOL","author":"T. Nipkow","year":"2002","unstructured":"Nipkow, T., Paulson, L.C., Wenzel, M.: Isabelle\/HOL \u2014 A Proof Assistant for Higher-Order Logic. In: Nipkow, T., Paulson, L.C., Wenzel, M. (eds.) Isabelle\/HOL. LNCS, vol.\u00a02283, Springer, Heidelberg (2002)"},{"key":"10_CR27","unstructured":"Rubio, A., (ed.).: Extended Abstracts of the 6th International Workshop on Termination, WST 2003, Technical Report DSIC II\/15\/03, Univ. Polit\u00e9cnica de Valencia, Spain (June 2003)"},{"key":"10_CR28","unstructured":"The Coq Development Team. The Coq Proof Assistant Documentation \u2013 Version V8.1 (February 2007), \n                    \n                      http:\/\/coq.inria.fr\n                    \n                    \n                  ."},{"key":"10_CR29","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/BF03177743","volume":"32","author":"X. Urbain","year":"2004","unstructured":"Urbain, X.: Modular and incremental automated termination proofs. Journal of Automated Reasoning\u00a032, 315\u2013355 (2004)","journal-title":"Journal of Automated Reasoning"}],"container-title":["Lecture Notes in Computer Science","Frontiers of Combining Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74621-8_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T10:09:10Z","timestamp":1558260550000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74621-8_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540746201","9783540746218"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74621-8_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}