{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,17]],"date-time":"2026-07-17T02:28:57Z","timestamp":1784255337915,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540221531","type":"print"},{"value":"9783540259794","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-25979-4_15","type":"book-chapter","created":{"date-parts":[[2010,9,11]],"date-time":"2010-09-11T01:32:53Z","timestamp":1284168773000},"page":"210-220","source":"Crossref","is-referenced-by-count":74,"title":["Automated Termination Proofs with AProVE"],"prefix":"10.1007","author":[{"given":"J\u00fcrgen","family":"Giesl","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ren\u00e9","family":"Thiemann","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Peter","family":"Schneider-Kamp","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stephan","family":"Falke","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"15_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/10721975_18","volume-title":"Rewriting Techniques and Applications","author":"T. Arts","year":"2000","unstructured":"Arts, T.: System description: The dependency pair method. In: Bachmair, L. (ed.) RTA 2000. LNCS, vol.\u00a01833, pp. 261\u2013264. Springer, Heidelberg (2000)"},{"key":"15_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":"15_CR3","unstructured":"Arts, T., Giesl, J.: A collection of examples for termination of term rewriting using dependency pairs. Technical Report AIB-2001-093, RWTH Aachen (2001)"},{"key":"15_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1007\/10721959_27","volume-title":"Automated Deduction - CADE-17","author":"C. Borralleras","year":"2000","unstructured":"Borralleras, C., Ferreira, M., Rubio, A.: Complete monotonic semantic path orderings. In: McAllester, D. (ed.) CADE 2000. LNCS, vol.\u00a01831, pp. 346\u2013364. Springer, Heidelberg (2000)"},{"key":"15_CR5","unstructured":"Contejean, E., March\u00e9, C., Monate, B., Urbain, X.: CiME, http:\/\/cime.lri.fr"},{"key":"15_CR6","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. J. Symb. Comp.\u00a03, 69\u2013116 (1987)","journal-title":"J. Symb. Comp."},{"key":"15_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1007\/3-540-59340-3_2","volume-title":"Term Rewriting","author":"N. Dershowitz","year":"1995","unstructured":"Dershowitz, N.: 33 examples of termination. In: Comon, H., Jouannaud, J.-P. (eds.) TCS School 1993. LNCS, vol.\u00a0909, pp. 16\u201326. Springer, Heidelberg (1995)"},{"issue":"1,2","key":"15_CR8","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/s002000100065","volume":"12","author":"N. Dershowitz","year":"2001","unstructured":"Dershowitz, N., Lindenstrauss, N., Sagiv, Y., Serebrenik, A.: A general framework for automatic termination analysis of logic programs. Applicable Algebra in Engineering, Communication and Computing\u00a012(1,2), 117\u2013156 (2001)","journal-title":"Applicable Algebra in Engineering, Communication and Computing"},{"key":"15_CR9","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/BF01237233","volume":"28","author":"J. Dick","year":"1990","unstructured":"Dick, J., Kalmus, J., Martin, U.: Automating the Knuth-Bendix ordering. Acta Informatica\u00a028, 95\u2013119 (1990)","journal-title":"Acta Informatica"},{"key":"15_CR10","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1145\/571157.571164","volume-title":"Proc. 4th PPDP","author":"O. Fissore","year":"2002","unstructured":"Fissore, O., Gnaedig, I., Kirchner, H.: Cariboo: An induction based proof tool for termination with strategies. In: Proc. 4th PPDP, pp. 62\u201373. ACM, New York (2002)"},{"key":"15_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1007\/3-540-59200-8_77","volume-title":"Rewriting Techniques and Applications","author":"J. Giesl","year":"1995","unstructured":"Giesl, J.: Generating polynomial orderings for termination proofs. In: Hsiang, J. (ed.) RTA 1995. LNCS, vol.\u00a0914, pp. 426\u2013431. Springer, Heidelberg (1995)"},{"issue":"1,2","key":"15_CR12","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s002000100063","volume":"12","author":"J. Giesl","year":"2001","unstructured":"Giesl, J., Arts, T.: Verification of Erlang processes by dependency pairs. Appl. Algebra in Engineering, Communication and Computing\u00a012(1,2), 39\u201372 (2001)","journal-title":"Appl. Algebra in Engineering, Communication and Computing"},{"issue":"1","key":"15_CR13","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1006\/jsco.2002.0541","volume":"34","author":"J. Giesl","year":"2002","unstructured":"Giesl, J., Arts, T., Ohlebusch, E.: Modular termination proofs for rewriting using dependency pairs. Journal of Symbolic Computation\u00a034(1), 21\u201358 (2002)","journal-title":"Journal of Symbolic Computation"},{"key":"15_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/978-3-540-39813-4_11","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"J. Giesl","year":"2003","unstructured":"Giesl, J., Thiemann, R., Schneider-Kamp, P., Falke, S.: Improving dependency pairs. In: Y. Vardi, M., Voronkov, A. (eds.) LPAR 2003. LNCS, vol.\u00a02850, pp. 165\u2013179. Springer, Heidelberg (2003)"},{"key":"15_CR15","doi-asserted-by":"crossref","unstructured":"Giesl, J., Thiemann, R., Schneider-Kamp, P., Falke, S.: Mechanizing dependency pairs. Technical Report AIB-2003-083, RWTH Aachen, Germany (2003)","DOI":"10.1007\/978-3-540-39813-4_11"},{"key":"15_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/3-540-44881-0_23","volume-title":"Rewriting Techniques and Applications","author":"J. Giesl","year":"2003","unstructured":"Giesl, J., Zantema, H.: Liveness in rewriting. In: Nieuwenhuis, R. (ed.) RTA 2003. LNCS, vol.\u00a02706, pp. 321\u2013336. Springer, Heidelberg (2003)"},{"key":"15_CR17","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":"15_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/3-540-44881-0_22","volume-title":"Rewriting Techniques and Applications","author":"N. Hirokawa","year":"2003","unstructured":"Hirokawa, N., Middeldorp, A.: Tsukuba termination tool. In: Nieuwenhuis, R. (ed.) RTA 2003. LNCS, vol.\u00a02706, pp. 311\u2013320. Springer, Heidelberg (2003)"},{"key":"15_CR19","unstructured":"Kamin, S., L\u00e9vy, J.J.: Two generalizations of the recursive path ordering. Unpublished Manuscript, University of Illinois, IL, USA (1980)"},{"key":"15_CR20","first-page":"263","volume-title":"Comp. Problems in Abstract Algebra","author":"D. Knuth","year":"1970","unstructured":"Knuth, D., Bendix, P.: Simple word problems in universal algebras. In: Leech, J. (ed.) Comp. Problems in Abstract Algebra, pp. 263\u2013297. Pergamon, Oxford (1970)"},{"key":"15_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/3-540-45127-7_12","volume-title":"Rewriting Techniques and Applications","author":"K. Korovin","year":"2001","unstructured":"Korovin, K., Voronkov, A.: Verifying orientability of rewrite rules using the knuth-bendix order. In: Middeldorp, A. (ed.) RTA 2001. LNCS, vol.\u00a02051, pp. 137\u2013153. Springer, Heidelberg (2001)"},{"key":"15_CR22","unstructured":"Lankford, D.: On proving term rewriting systems are Noetherian. Technical Report MTP-3, Louisiana Technical University, Ruston, LA, USA (1979)"},{"key":"15_CR23","doi-asserted-by":"crossref","unstructured":"Lee, C.S., Jones, N.D., Ben-Amram, A.M.: The size-change principle for program termination. In: Proc. POPL 2001, pp. 81\u201392 (2001)","DOI":"10.1145\/360204.360210"},{"issue":"1,2","key":"15_CR24","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/s002000100064","volume":"12","author":"E. Ohlebusch","year":"2001","unstructured":"Ohlebusch, E.: Termination of logic programs: Transformational approaches revisited. Appl. Algebra in Engineering, Comm. and Comp.\u00a012(1,2), 73\u2013116 (2001)","journal-title":"Appl. Algebra in Engineering, Comm. and Comp."},{"key":"15_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1007\/10721975_20","volume-title":"Rewriting Techniques and Applications","author":"E. Ohlebusch","year":"2000","unstructured":"Ohlebusch, E., Claves, C., March\u00e9, C.: TALP: A tool for the termination analysis of logic programs. In: Bachmair, L. (ed.) RTA 2000. LNCS, vol.\u00a01833, pp. 270\u2013273. Springer, Heidelberg (2000)"},{"key":"15_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/3-540-59200-8_44","volume-title":"Rewriting Techniques and Applications","author":"J. Steinbach","year":"1995","unstructured":"Steinbach, J.: Automatic termination proofs with transformation orderings. In: Hsiang, J. (ed.) RTA 1995. LNCS, vol.\u00a0914, pp. 11\u201325. Springer, Heidelberg (1995); Full version appeared as Technical Report SR-92-23, Universit\u00e4t Kaiserslautern, Germany"},{"key":"15_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1007\/3-540-44881-0_19","volume-title":"Rewriting Techniques and Applications","author":"R. Thiemann","year":"2003","unstructured":"Thiemann, R., Giesl, J.: Size-change termination for term rewriting. In: Nieuwenhuis, R. (ed.) RTA 2003. LNCS, vol.\u00a02706, pp. 264\u2013278. Springer, Heidelberg (2003)"},{"key":"15_CR28","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/978-3-540-25984-8_4","volume-title":"Automated Reasoning","author":"R. Thiemann","year":"2004","unstructured":"Thiemann, R., Giesl, J., Schneider-Kamp, P.: Improved modular termination proofs using dependency pairs. In: Basin, D., Rusinowitch, M. (eds.) IJCAR 2004. LNCS (LNAI), vol.\u00a03097, pp. 75\u201390. Springer, Heidelberg (2004)"},{"key":"15_CR29","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/3-540-45744-5_42","volume-title":"Automated Reasoning","author":"X. Urbain","year":"2001","unstructured":"Urbain, X.: Automated incremental termination proofs for hierarchically defined term rewriting systems. In: Gor\u00e9, R.P., Leitsch, A., Nipkow, T. (eds.) IJCAR 2001. LNCS (LNAI), vol.\u00a02083, pp. 485\u2013498. Springer, Heidelberg (2001)"},{"key":"15_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-540-25979-4_7","volume-title":"Rewriting Techniques and Applications","author":"H. Zantema","year":"2004","unstructured":"Zantema, H.: TORPA: Termination of rewriting proved automatically. In: van Oostrom, V. (ed.) RTA 2004. LNCS, vol.\u00a03091, pp. 95\u2013104. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Rewriting Techniques and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-25979-4_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,3]],"date-time":"2023-06-03T07:29:31Z","timestamp":1685777371000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-25979-4_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540221531","9783540259794"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-25979-4_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}