{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T19:53:33Z","timestamp":1762458813583},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642119989"},{"type":"electronic","value":"9783642119996"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11999-6_4","type":"book-chapter","created":{"date-parts":[[2010,3,16]],"date-time":"2010-03-16T00:52:29Z","timestamp":1268700749000},"page":"44-61","source":"Crossref","is-referenced-by-count":1,"title":["Termination of Context-Sensitive Rewriting with Built-In Numbers and Collection Data Structures"],"prefix":"10.1007","author":[{"given":"Stephan","family":"Falke","sequence":"first","affiliation":[]},{"given":"Deepak","family":"Kapur","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"636","DOI":"10.1007\/978-3-540-89439-1_44","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"B. Alarc\u00f3n","year":"2008","unstructured":"Alarc\u00f3n, B., Emmes, F., Fuhs, C., Giesl, J., Guti\u00e9rrez, R., Lucas, S., Schneider-Kamp, P., Thiemann, R.: Improving context-sensitive dependency pairs. In: Cervesato, I., Veith, H., Voronkov, A. (eds.) LPAR 2008. LNCS (LNAI), vol.\u00a05330, pp. 636\u2013651. Springer, Heidelberg (2008)"},{"key":"4_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/11944836_28","volume-title":"FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science","author":"B. Alarc\u00f3n","year":"2006","unstructured":"Alarc\u00f3n, B., Guti\u00e9rrez, R., Lucas, S.: Context-sensitive dependency pairs. In: Arun-Kumar, S., Garg, N. (eds.) FSTTCS 2006. LNCS, vol.\u00a04337, pp. 297\u2013308. Springer, Heidelberg (2006)"},{"key":"4_CR3","first-page":"91","volume":"188","author":"B. Alarc\u00f3n","year":"2007","unstructured":"Alarc\u00f3n, B., Guti\u00e9rrez, R., Lucas, S.: Improving the context-sensitive dependency graph. ENTCS\u00a0188, 91\u2013103 (2007)","journal-title":"ENTCS"},{"issue":"1-2","key":"4_CR4","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. TCS\u00a0236(1-2), 133\u2013178 (2000)","journal-title":"TCS"},{"key":"4_CR5","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)"},{"issue":"2-3","key":"4_CR6","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/0304-3975(89)90003-0","volume":"67","author":"L. Bachmair","year":"1989","unstructured":"Bachmair, L., Dershowitz, N.: Completion for rewriting modulo a congruence. TCS\u00a067(2-3), 173\u2013201 (1989)","journal-title":"TCS"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-540-71316-6_8","volume-title":"Programming Languages and Systems","author":"F. Blanqui","year":"2007","unstructured":"Blanqui, F., Hardin, T., Weis, P.: On the implementation of construction functions for non-free concrete data types. In: De Nicola, R. (ed.) ESOP 2007. LNCS, vol.\u00a04421, pp. 95\u2013109. Springer, Heidelberg (2007)"},{"key":"4_CR8","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1007\/3-540-45620-1_27","volume-title":"Automated Deduction - CADE-18","author":"C. Borralleras","year":"2002","unstructured":"Borralleras, C., Lucas, S., Rubio, A.: Recursive path orderings can be context-sensitive. In: Voronkov, A. (ed.) CADE 2002. LNCS (LNAI), vol.\u00a02392, pp. 314\u2013331. Springer, Heidelberg (2002)"},{"key":"4_CR9","series-title":"Lecture Notes in Computer Science","volume-title":"All About Maude - A High-Performance Logical Framework","author":"M. Clavel","year":"2007","unstructured":"Clavel, M., Dur\u00e1n, F., Eker, S., Lincoln, P., Mart\u00ed-Oliet, N., Meseguer, J., Talcott, C.: All About Maude - A High-Performance Logical Framework. LNCS, vol.\u00a04350. Springer, Heidelberg (2007)"},{"key":"4_CR10","unstructured":"Falke, S.: Term Rewriting with Built-In Numbers and Collection Data Structures. PhD thesis, University of New Mexico, Albuquerque, NM, USA (2009)"},{"key":"4_CR11","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/978-3-540-73595-3_32","volume-title":"Automated Deduction \u2013 CADE-21","author":"S. Falke","year":"2007","unstructured":"Falke, S., Kapur, D.: Dependency pairs for rewriting with non-free constructors. In: Pfenning, F. (ed.) CADE 2007. LNCS (LNAI), vol.\u00a04603, pp. 426\u2013442. Springer, Heidelberg (2007)"},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/978-3-540-70590-1_7","volume-title":"Rewriting Techniques and Applications","author":"S. Falke","year":"2008","unstructured":"Falke, S., Kapur, D.: Dependency pairs for rewriting with built-in numbers and semantic data structures. In: Voronkov, A. (ed.) RTA 2008. LNCS, vol.\u00a05117, pp. 94\u2013109. Springer, Heidelberg (2008)"},{"key":"4_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/978-3-642-02959-2_22","volume-title":"Automated Deduction \u2013 CADE-22","author":"S. Falke","year":"2009","unstructured":"Falke, S., Kapur, D.: A term rewriting approach to the automated termination analysis of imperative programs. In: Schmidt, R.A. (ed.) Automated Deduction \u2013 CADE-22. LNCS, vol.\u00a05663, pp. 277\u2013293. Springer, Heidelberg (2009)"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Falke, S., Kapur, D.: Termination of context-sensitive rewriting with built-in numbers and collection data structures. Technical Report TR-CS-2009-01 (2009)","DOI":"10.1016\/j.entcs.2009.03.036"},{"key":"4_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/3-540-48685-2_24","volume-title":"Rewriting Techniques and Applications","author":"M.C.F. Ferreira","year":"1999","unstructured":"Ferreira, M.C.F., Ribeiro, A.L.: Context-sensitive AC-rewriting. In: Narendran, P., Rusinowitch, M. (eds.) RTA 1999. LNCS, vol.\u00a01631, pp. 286\u2013300. Springer, Heidelberg (1999)"},{"key":"4_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/978-3-642-02348-4_3","volume-title":"Rewriting Techniques and Applications","author":"C. Fuhs","year":"2009","unstructured":"Fuhs, C., Giesl, J., Pl\u00fccker, M., Schneider-Kamp, P., Falke, S.: Proving termination of integer term rewriting. In: Treinen, R. (ed.) Rewriting Techniques and Applications. LNCS, vol.\u00a05595, pp. 32\u201347. Springer, Heidelberg (2009)"},{"issue":"4","key":"4_CR17","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1017\/S0956796803004945","volume":"14","author":"J. Giesl","year":"2004","unstructured":"Giesl, J., Middeldorp, A.: Transformation techniques for context-sensitive rewrite systems. JFP\u00a014(4), 379\u2013427 (2004)","journal-title":"JFP"},{"key":"4_CR18","series-title":"LNAI","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. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), vol.\u00a04130, pp. 281\u2013286. Springer, Heidelberg (2006)"},{"key":"4_CR19","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/978-3-540-32275-7_21","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"J. Giesl","year":"2005","unstructured":"Giesl, J., Thiemann, R., Schneider-Kamp, P.: The dependency pair framework. In: Baader, F., Voronkov, A. (eds.) LPAR 2004. LNCS (LNAI), vol.\u00a03452, pp. 301\u2013331. Springer, Heidelberg (2005)"},{"key":"4_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-540-70590-1_9","volume-title":"Rewriting Techniques and Applications","author":"R. Guti\u00e9rrez","year":"2008","unstructured":"Guti\u00e9rrez, R., Lucas, S., Urbain, X.: Usable rules for context-sensitive rewrite systems. In: Voronkov, A. (ed.) RTA 2008. LNCS, vol.\u00a05117, pp. 126\u2013141. Springer, Heidelberg (2008)"},{"issue":"4","key":"4_CR21","first-page":"474","volume":"205","author":"N. Hirokawa","year":"2007","unstructured":"Hirokawa, N., Middeldorp, A.: Tyrolean termination tool: Techniques and features. IC\u00a0205(4), 474\u2013511 (2007)","journal-title":"IC"},{"key":"4_CR22","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1023\/A:1005983105493","volume":"21","author":"H. Hong","year":"1998","unstructured":"Hong, H., Jaku\u0161, D.: Testing positiveness of polynomials. JAR\u00a021, 23\u201338 (1998)","journal-title":"JAR"},{"issue":"4","key":"4_CR23","doi-asserted-by":"publisher","first-page":"1155","DOI":"10.1137\/0215084","volume":"15","author":"J.-P. Jouannaud","year":"1986","unstructured":"Jouannaud, J.-P., Kirchner, H.: Completion of a set of rules modulo a set of equations. SIAM J. Comput.\u00a015(4), 1155\u20131194 (1986)","journal-title":"SIAM J. Comput."},{"key":"4_CR24","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":"4_CR25","unstructured":"Lucas, S.: Context-sensitive computations in functional and functional logic programs. JFLP\u00a01998(1) (1998)"},{"key":"4_CR26","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1007\/3-540-45653-8_46","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"S. Lucas","year":"2001","unstructured":"Lucas, S.: Termination of rewriting with strategy annotations. In: Nieuwenhuis, R., Voronkov, A. (eds.) LPAR 2001. LNCS (LNAI), vol.\u00a02250, pp. 669\u2013684. Springer, Heidelberg (2001)"},{"issue":"1","key":"4_CR27","first-page":"294","volume":"178","author":"S. Lucas","year":"2002","unstructured":"Lucas, S.: Context-sensitive rewriting strategies. IC\u00a0178(1), 294\u2013343 (2002)","journal-title":"IC"},{"key":"4_CR28","first-page":"234","volume":"64","author":"S. Lucas","year":"2002","unstructured":"Lucas, S.: Lazy rewriting and context-sensitive rewriting. ENTCS\u00a064, 234\u2013254 (2002)","journal-title":"ENTCS"},{"key":"4_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1007\/978-3-540-24727-2_23","volume-title":"Foundations of Software Science and Computation Structures","author":"S. Lucas","year":"2004","unstructured":"Lucas, S.: Polynomials for proving termination of context-sensitive rewriting. In: Walukiewicz, I. (ed.) FOSSACS 2004. LNCS, vol.\u00a02987, pp. 318\u2013332. Springer, Heidelberg (2004)"},{"issue":"12","key":"4_CR30","first-page":"1782","volume":"204","author":"S. Lucas","year":"2006","unstructured":"Lucas, S.: Proving termination of context-sensitive rewriting by transformation. IC\u00a0204(12), 1782\u20131846 (2006)","journal-title":"IC"}],"container-title":["Lecture Notes in Computer Science","Functional and Constraint Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11999-6_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:46:15Z","timestamp":1606167975000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11999-6_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642119989","9783642119996"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11999-6_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}