{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:35:59Z","timestamp":1725489359123},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540734475"},{"type":"electronic","value":"9783540734499"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73449-9_21","type":"book-chapter","created":{"date-parts":[[2007,8,13]],"date-time":"2007-08-13T16:49:53Z","timestamp":1187023793000},"page":"273-287","source":"Crossref","is-referenced-by-count":6,"title":["Proving Termination of Rewrite Systems Using Bounds"],"prefix":"10.1007","author":[{"given":"Martin","family":"Korp","sequence":"first","affiliation":[]},{"given":"Aart","family":"Middeldorp","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","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)"},{"key":"21_CR2","unstructured":"Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications (2002), Available at, \n                  \n                    www.grappa.univ-lille3.fr\/tata"},{"key":"21_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1007\/3-540-10843-2_36","volume-title":"Automata, Languages and Programming","author":"N. Dershowitz","year":"1981","unstructured":"Dershowitz, N.: Termination of linear rewriting systems (preliminary version). In: Even, S., Kariv, O. (eds.) Automata, Languages and Programming. LNCS, vol.\u00a0115, pp. 448\u2013458. Springer, Heidelberg (1981)"},{"key":"21_CR4","unstructured":"Endrullis, J.: Jambox: Automated termination proofs for string\/term rewriting (2006), Available from \n                  \n                    http:\/\/joerg.endrullis.de\/"},{"key":"21_CR5","unstructured":"Endrullis, J., Hofbauer, D., Waldmann, J.: Decomposing terminating rewrite relations. In: Proc. 8th WST, pp. 39\u201343 (2006)"},{"key":"21_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/BFb0052368","volume-title":"Proc. 9th RTA","author":"T. Genet","year":"1998","unstructured":"Genet, T.: Decidable approximations of sets of descendants and sets of normal forms. In: Nipkow, T. (ed.) Proc. 9th RTA. LNCS, vol.\u00a01379, pp. 151\u2013165. Springer, Heidelberg (1998)"},{"issue":"3-4","key":"21_CR7","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/s00200-004-0162-8","volume":"15","author":"A. Geser","year":"2004","unstructured":"Geser, A., Hofbauer, D., Waldmann, J.: Match-bounded string rewriting systems. AAECC\u00a015(3-4), 149\u2013171 (2004)","journal-title":"AAECC"},{"issue":"4","key":"21_CR8","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/s10817-005-9024-8","volume":"34","author":"A. Geser","year":"2005","unstructured":"Geser, A., Hofbauer, D., Waldmann, J.: Termination proofs for string rewriting systems via inverse match-bounds. JAR\u00a034(4), 365\u2013385 (2005)","journal-title":"JAR"},{"issue":"3","key":"21_CR9","first-page":"471","volume":"16","author":"A. Geser","year":"2005","unstructured":"Geser, A., Hofbauer, D., Waldmann, J., Zantema, H.: Finding finite automata that certify termination of string rewriting systems. IJFCS\u00a016(3), 471\u2013486 (2005)","journal-title":"IJFCS"},{"issue":"4","key":"21_CR10","first-page":"512","volume":"205","author":"A. Geser","year":"2007","unstructured":"Geser, A., Hofbauer, D., Waldmann, J., Zantema, H.: On tree automata that certify termination of left-linear term rewriting systems. I&C\u00a0205(4), 512\u2013534 (2007)","journal-title":"I&C"},{"key":"21_CR11","unstructured":"Geupel, O.: Overlap closures and termination of term rewriting systems. Report MIP-8922, Universit\u00e4t Passau (1989)"},{"key":"21_CR12","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"281","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, pp. 281\u2013286. Springer, Heidelberg (2006)"},{"key":"21_CR13","unstructured":"Huet, G., Lankford, D.S.: On the uniform halting problem for term rewriting systems. Rapport Laboria 283, INRIA (1978)"},{"key":"21_CR14","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1007\/3-540-45744-5_49","volume-title":"Automated Reasoning","author":"A. Middeldorp","year":"2001","unstructured":"Middeldorp, A.: Approximating dependency graphs using tree automata techniques. In: Gor\u00e9, R.P., Leitsch, A., Nipkow, T. (eds.) IJCAR 2001. LNCS (LNAI), vol.\u00a02083, pp. 593\u2013610. Springer, Heidelberg (2001)"},{"issue":"2","key":"21_CR15","first-page":"499","volume":"178","author":"T. Nagaya","year":"2002","unstructured":"Nagaya, T., Toyama, Y.: Decidability for left-linear growing term rewriting systems. I&C\u00a0178(2), 499\u2013514 (2002)","journal-title":"I&C"},{"key":"21_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-3-540-25979-4_6","volume-title":"Rewriting Techniques and Applications","author":"J. Waldmann","year":"2004","unstructured":"Waldmann, J.: Matchbox: A tool for match-bounded string rewriting. In: van Oostrom, V. (ed.) RTA 2004. LNCS, vol.\u00a03091, pp. 85\u201394. Springer, Heidelberg (2004)"},{"key":"21_CR17","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/s10817-005-6545-0","volume":"34","author":"H. Zantema","year":"2005","unstructured":"Zantema, H.: Termination of rewriting proved automatically. JAR\u00a034, 105\u2013139 (2005)","journal-title":"JAR"}],"container-title":["Lecture Notes in Computer Science","Term Rewriting and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73449-9_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:12:34Z","timestamp":1619518354000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73449-9_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540734475","9783540734499"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73449-9_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}