{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T02:52:49Z","timestamp":1743043969283,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540710653"},{"type":"electronic","value":"9783540710677"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-71067-7_17","type":"book-chapter","created":{"date-parts":[[2008,10,3]],"date-time":"2008-10-03T08:55:16Z","timestamp":1223024116000},"page":"183-198","source":"Crossref","is-referenced-by-count":4,"title":["Certifying a Termination Criterion Based on Graphs, without Graphs"],"prefix":"10.1007","author":[{"given":"Pierre","family":"Courtieu","sequence":"first","affiliation":[]},{"given":"Julien","family":"Forest","sequence":"additional","affiliation":[]},{"given":"Xavier","family":"Urbain","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","series-title":"Lecture Notes in Computer Science","volume-title":"TAPSOFT\u201997: Theory and Practice of Software Development","author":"T. Arts","year":"1997","unstructured":"Arts, T., Giesl, J.: Automatically Proving Termination Where Simplification Orderings Fail. In: Bidoit, M., Dauchet, M. (eds.) CAAP 1997, FASE 1997, and TAPSOFT 1997. LNCS, vol.\u00a01214. Springer, Heidelberg (1997)"},{"key":"17_CR2","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":"17_CR3","unstructured":"Arts, T., Giesl, J.: A collection of examples for termination of term rewriting using dependency pairs. Technical report, RWTH Aachen (September 2001)"},{"issue":"1,2","key":"17_CR4","first-page":"39","volume":"12","author":"T. Arts","year":"2001","unstructured":"Arts, T., Giesl, J.: Verification of Erlang Processes by Dependency Pairs. Application Algebra in Engineering, Communication and Computing\u00a012(1,2), 39\u201372 (2001)","journal-title":"Application Algebra in Engineering, Communication and Computing"},{"key":"17_CR5","doi-asserted-by":"publisher","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)"},{"key":"17_CR6","series-title":"North-Holland mathematical library","volume-title":"Graphs","author":"C. Berge","year":"1991","unstructured":"Berge, C.: Graphs, 3rd edn. North-Holland mathematical library, vol.\u00a06. North-Holland, Amsterdam (1991)","edition":"3"},{"key":"17_CR7","unstructured":"Blanqui, F., Coupet-Grimal, S., Delobel, W., Hinderer, S., Koprowski, A.: Color, a coq library on rewriting and termination. In: Geser, A., Sondergaard, H. (eds.) Extended Abstracts of the 8th International Workshop on Termination, WST 2006 (August 2006)"},{"key":"17_CR8","unstructured":"Contejean, \u00c9.: The Coccinelle library for rewriting, \n                    \n                      http:\/\/www.lri.fr\/~contejea\/Coccinelle\/coccinelle.html"},{"key":"17_CR9","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/978-3-540-74621-8_10","volume-title":"Frontiers of Combining Systems","author":"\u00c9. Contejean","year":"2007","unstructured":"Contejean, \u00c9., Courtieu, P., Forest, J., Pons, O., Urbain, X.: Certification of automated termination proofs. In: Konev, B., Wolter, F. (eds.) FroCos 2007. LNCS (LNAI), vol.\u00a04720, pp. 148\u2013162. Springer, Heidelberg (2007)"},{"key":"17_CR10","unstructured":"Contejean, \u00c9., March\u00e9, C., Monate, B., Urbain, X.: Proving termination of rewriting with c\n                  i\n                  me. In: Rubio, A. (ed.) Extended Abstracts of the 6th International Workshop on Termination, WST 2003, June 2003, pp. 71\u201373 (2003), \n                    \n                      http:\/\/cime.lri.fr"},{"key":"17_CR11","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":"17_CR12","unstructured":"Endrullis, J.: Jambox, \n                    \n                      http:\/\/joerg.endrullis.de\/index.html"},{"key":"17_CR13","first-page":"21","volume":"34","author":"J. Giesl","year":"2002","unstructured":"Giesl, J.: Thomas Arts, and Enno Ohlebusch. Modular Termination Proofs for Rewriting Using Dependency Pairs\u00a034, 21\u201358 (2002)","journal-title":"Modular Termination Proofs for Rewriting Using Dependency Pairs"},{"key":"17_CR14","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":"17_CR15","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":"17_CR16","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/978-3-540-45085-6_4","volume-title":"Automated Deduction \u2013 CADE-19","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":"17_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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":"17_CR18","unstructured":"Koprowski, A.: TPA., \n                    \n                      http:\/\/www.win.tue.nl\/tpa"},{"key":"17_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/10704567_3","volume-title":"Principles and Practice of Declarative Programming","author":"K. Kusakari","year":"1999","unstructured":"Kusakari, K., Nakamura, M., Toyama, Y.: Argument filtering transformation. In: Nadathur, G. (ed.) PPDP 1999. LNCS, vol.\u00a01702, pp. 47\u201361. Springer, Heidelberg (1999)"},{"key":"17_CR20","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.T.: Isabelle\/HOL. LNCS, vol.\u00a02283. Springer, Heidelberg (2002)"},{"key":"17_CR21","unstructured":"The Coq Development Team. The Coq Proof Assistant Documentation \u2013 Version V8.1 (February 2007), \n                    \n                      http:\/\/coq.inria.fr"}],"container-title":["Lecture Notes in Computer Science","Theorem Proving in Higher Order Logics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-71067-7_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,3]],"date-time":"2019-03-03T10:28:50Z","timestamp":1551608930000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-71067-7_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540710653","9783540710677"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-71067-7_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}