{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:43:38Z","timestamp":1725565418139},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540221531"},{"type":"electronic","value":"9783540259794"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-25979-4_7","type":"book-chapter","created":{"date-parts":[[2010,9,10]],"date-time":"2010-09-10T21:32:53Z","timestamp":1284154373000},"page":"95-104","source":"Crossref","is-referenced-by-count":15,"title":["TORPA: Termination of Rewriting Proved Automatically"],"prefix":"10.1007","author":[{"given":"Hans","family":"Zantema","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_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":"7_CR2","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/0167-6423(87)90030-X","volume":"9","author":"A. Ben-Cherifa","year":"1987","unstructured":"Ben-Cherifa, A., Lescanne, P.: Termination of rewriting systems by polynomial interpretations and its implementation. Science of Computer Programming\u00a09, 137\u2013159 (1987)","journal-title":"Science of Computer Programming"},{"key":"7_CR3","unstructured":"Boralleras, C., Rubio, A.: Termptation: termination proof techniques automation, Available at http:\/\/www.lsi.upc.es\/~albert\/"},{"key":"7_CR4","unstructured":"Contejean, E., March\u00e9, C., Monate, B., Urbain, X.: The CiME rewrite tool, Available at http:\/\/cime.lri.fr\/"},{"key":"7_CR5","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, 279\u2013301 (1982)","journal-title":"Theoretical Computer Science"},{"key":"7_CR6","unstructured":"Giesl, J., et al.: Automated program verification environment (AProVE), Available at http:\/\/www-i2.informatik.rwth-aachen.de\/AProVE\/"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Geser, A., Hofbauer, D., Waldmann, J.: Match-bounded string rewriting. Technical Report 2003-09, National Institute of Aerospace, Hampton, VA (2003) (submitted for publication in a journal)","DOI":"10.1007\/978-3-540-45138-9_39"},{"key":"7_CR8","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":"7_CR9","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":"7_CR10","unstructured":"Lankford, D.S.: On proving term rewriting systems are noetherian. Technical report MTP 3, Louisiana Technical University (1979)"},{"key":"7_CR11","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1006\/jsco.1994.1003","volume":"17","author":"H. Zantema","year":"1994","unstructured":"Zantema, H.: Termination of term rewriting: Interpretation and type elimination. Journal of Symbolic Computation\u00a017, 23\u201350 (1994)","journal-title":"Journal of Symbolic Computation"},{"key":"7_CR12","doi-asserted-by":"crossref","first-page":"89","DOI":"10.3233\/FI-1995-24124","volume":"24","author":"H. Zantema","year":"1995","unstructured":"Zantema, H.: Termination of term rewriting by semantic labelling. Fundamenta Informaticae\u00a024, 89\u2013105 (1995)","journal-title":"Fundamenta Informaticae"},{"key":"7_CR13","first-page":"181","volume-title":"Term Rewriting Systems, by Terese","author":"H. Zantema","year":"2003","unstructured":"Zantema, H.: Termination. In: Term Rewriting Systems, by Terese, pp. 181\u2013259. Cambridge University Press, Cambridge (2003)"},{"key":"7_CR14","unstructured":"Zantema, H.: Termination of string rewriting proved automatically. Technical Report CS-report 03-14, Eindhoven University of Technology, Submitted, available via (2003), http:\/\/www.win.tue.nl\/inf\/onderzoek\/en_index.html"}],"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_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,11]],"date-time":"2020-06-11T09:16:05Z","timestamp":1591866965000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-25979-4_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540221531","9783540259794"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-25979-4_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}