{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T20:27:40Z","timestamp":1725481660211},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540402541"},{"type":"electronic","value":"9783540448815"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-44881-0_22","type":"book-chapter","created":{"date-parts":[[2007,3,5]],"date-time":"2007-03-05T11:39:56Z","timestamp":1173094796000},"page":"311-320","source":"Crossref","is-referenced-by-count":20,"title":["Tsukuba Termination Tool"],"prefix":"10.1007","author":[{"given":"Nao","family":"Hirokawa","sequence":"first","affiliation":[]},{"given":"Aart","family":"Middeldorp","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,6,18]]},"reference":[{"key":"22_CR1","series-title":"Lect Notes Comput Sci","first-page":"261","volume-title":"Proc. 11th RTA","author":"T. Arts","year":"2001","unstructured":"T. Arts. System description: The dependency pair method. In Proc. 11th RTA, volume 1833 of LNCS, pages 261\u2013264, 2001."},{"key":"22_CR2","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/S0304-3975(99)00207-8","volume":"236","author":"T. Arts","year":"2000","unstructured":"T. Arts and J. Giesl. Termination of term rewriting using dependency pairs. Theoretical Computer Science, 236:133\u2013178, 2000.","journal-title":"Theoretical Computer Science"},{"unstructured":"T. Arts and J. Giesl. A collection of examples for termination of term rewriting using dependency pairs. Technical Report AIB-2001-09, RWTH Aachen, 2001. Available at http:\/\/aib.informatik.rwth-aachen.de\/ .","key":"22_CR3"},{"key":"22_CR4","first-page":"346","volume":"1831","author":"C. Borralleras","year":"2000","unstructured":"C. Borralleras, M. Ferreira, and A. Rubio. Complete monotonic semantic path orderings. In Proc. 17th CADE, volume 1831 of LNAI, pages 346\u2013364, 2000.","journal-title":"Proc. 17th CADE"},{"unstructured":"E. Contejean, C. March\u00e9, B. Monate, and X. Urbain. CiME version 2, 2000. Available at http:\/\/cime.lri.fr\/ .","key":"22_CR5"},{"key":"22_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1007\/3-540-59340-3_2","volume-title":"French Spring School of Theoretical Computer Science","author":"N. Dershowitz","year":"1995","unstructured":"N. Dershowitz. 33 Examples of termination. In French Spring School of Theoretical Computer Science, volume 909 of LNCS, pages 16\u201326, 1995."},{"issue":"1","key":"22_CR7","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1006\/jsco.2002.0541","volume":"34","author":"J. Giesl","year":"2002","unstructured":"J. Giesl, T. Arts, and E. Ohlebusch. Modular termination proofs for rewriting using dependency pairs. Journal of Symbolic Computation, 34(1):21\u201358, 2002.","journal-title":"Journal of Symbolic Computation"},{"unstructured":"http:\/\/www.research.att.com\/sw\/tools\/graphviz\/ .","key":"22_CR8"},{"doi-asserted-by":"crossref","unstructured":"N. Hirokawa and A. Middeldorp. Automating the dependency pair method. In Proc. 19th CADE, LNAI, 2003. To appear.","key":"22_CR9","DOI":"10.1007\/978-3-540-45085-6_4"},{"doi-asserted-by":"crossref","unstructured":"D.J. King and J. Launchbury. Structuring depth-first search algorithms in Haskell. In Proc. 22nd POPL, pages 344\u2013354, 1995.","key":"22_CR10","DOI":"10.1145\/199448.199530"},{"key":"22_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/3-540-45127-7_12","volume-title":"Proc. 12th RTA","author":"K. Korovin","year":"2001","unstructured":"K. Korovin and A. Voronkov. Verifying orientability of rewrite rules using the Knuth-Bendix order. In Proc. 12th RTA, volume 2051 of LNCS, pages 137\u2013153, 2001."},{"doi-asserted-by":"crossref","unstructured":"A. Middeldorp. Approximations for strategies and termination. In Proc. 2nd WRS, volume 70(6) of Electronic Notes in Theoretical Computer Science, 2002.","key":"22_CR12","DOI":"10.1016\/S1571-0661(04)80598-X"},{"unstructured":"http:\/\/caml.inria.fr\/ocaml\/ .","key":"22_CR13"},{"issue":"4","key":"22_CR14","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/S0020-0190(02)00272-7","volume":"84","author":"E. Ohlebusch","year":"2002","unstructured":"E. Ohlebusch. Hierarchical termination revisited. Information Processing Letters, 84(4):207\u2013214, 2002.","journal-title":"Information Processing Letters"},{"key":"22_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/3-540-59200-8_44","volume-title":"Proc. 6th RTA","author":"J. Steinbach","year":"1995","unstructured":"J. Steinbach. Automatic termination proofs with transformation orderings. In Proc. 6th RTA, volume 914 of LNCS, pages 11\u201325, 1995."},{"unstructured":"J. Steinbach and U. K\u00fchler. Check your ordering \u2014 termination proofs and open problems. Technical Report SR-90-25, Universit\u00e4t Kaiserslautern, 1990.","key":"22_CR16"},{"key":"22_CR17","doi-asserted-by":"crossref","first-page":"47","DOI":"10.3233\/FI-1995-24123","volume":"24","author":"J. Steinbach","year":"1995","unstructured":"Joachim Steinbach. Simplification orderings: History of results. Fundamenta Informaticae, 24:47\u201387, 1995.","journal-title":"Fundamenta Informaticae"},{"key":"22_CR18","first-page":"485","volume":"2083","author":"X. Urbain","year":"2001","unstructured":"X. Urbain. Automated incremental termination proofs for hierarchically defined term rewriting systems. In Proc. IJCAR, volume 2083 of LNAI, pages 485\u2013498, 2001.","journal-title":"Proc. IJCAR"},{"doi-asserted-by":"crossref","unstructured":"X. Urbain. Modular & incremental automated termination proofs. Journal of Automated Reasoning, 2003. To appear.","key":"22_CR19","DOI":"10.1007\/BF03177743"}],"container-title":["Lecture Notes in Computer Science","Rewriting Techniques and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44881-0_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,20]],"date-time":"2020-04-20T06:57:22Z","timestamp":1587365842000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44881-0_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540402541","9783540448815"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-44881-0_22","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}