{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:03:50Z","timestamp":1725516230099},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540705888"},{"type":"electronic","value":"9783540705901"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-70590-1_9","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T16:07:43Z","timestamp":1218557263000},"page":"126-141","source":"Crossref","is-referenced-by-count":5,"title":["Usable Rules for Context-Sensitive Rewrite Systems"],"prefix":"10.1007","author":[{"given":"Ra\u00fal","family":"Guti\u00e9rrez","sequence":"first","affiliation":[]},{"given":"Salvador","family":"Lucas","sequence":"additional","affiliation":[]},{"given":"Xavier","family":"Urbain","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","first-page":"105","volume":"188","author":"B. Alarc\u00f3n","year":"2007","unstructured":"Alarc\u00f3n, B., Guti\u00e9rrez, R., Iborra, J., Lucas, S.: Proving Termination of Context-Sensitive Rewriting with MU-TERM. ENTCS\u00a0188, 105\u2013115 (2007)","journal-title":"ENTCS"},{"key":"9_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":"9_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"},{"key":"9_CR4","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/978-3-540-74621-8_5","volume-title":"Frontiers of Combining Systems","author":"B. Alarc\u00f3n","year":"2007","unstructured":"Alarc\u00f3n, B., Lucas, S.: Termination of Innermost Context-Sensitive Rewriting Using Dependency Pairs. In: Konev, B., Wolter, F. (eds.) FroCos 2007. LNCS (LNAI), vol.\u00a04720, pp. 73\u201387. Springer, Heidelberg (2007)"},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/3-540-62950-5_68","volume-title":"Rewriting Techniques and Applications","author":"T. Arts","year":"1997","unstructured":"Arts, T., Giesl, J.: Proving Innermost Normalisation Automatically. In: Comon, H. (ed.) RTA 1997. LNCS, vol.\u00a01232, pp. 157\u2013171. Springer, Heidelberg (1997)"},{"issue":"1\u20132","key":"9_CR6","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(1\u20132), 133\u2013178 (2000)","journal-title":"Theoretical Computer Science"},{"key":"9_CR7","unstructured":"Borralleras, C.: Ordering-Based Methods for Proving Termination Automatically. PhD thesis, Departament de Llenguatges i Sistemes Inform\u00e0tics, UPC (2003)"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Dur\u00e1n, F., Lucas, S., Meseguer, J., March\u00e9, C., Urbain, X.: Proving Operational Termination of Membership Equational Programs. Higher-Order and Symbolic Computation (to appear, 2008)","DOI":"10.1007\/s10990-008-9028-2"},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1007\/978-3-540-72788-0_33","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2007","author":"C. Fuhs","year":"2007","unstructured":"Fuhs, C., Giesl, J., Middeldorp, A., Schneider-Kamp, P., Thiemann, R., Zankl, H.: SAT Solving for Termination Analysis with Polynomial Interpretations. In: Marques-Silva, J., Sakallah, K.A. (eds.) SAT 2007. LNCS, vol.\u00a04501, pp. 340\u2013354. Springer, Heidelberg (2007)"},{"issue":"1","key":"9_CR10","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":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/3-540-45005-X_20","volume-title":"Developments in Language Theory","author":"J. Giesl","year":"2003","unstructured":"Giesl, J., Middeldorp, A.: Innermost Termination of Context-Sensitive Rewriting. In: Ito, M., Toyama, M. (eds.) DLT 2002. LNCS, vol.\u00a02450, pp. 231\u2013244. Springer, Heidelberg (2003)"},{"issue":"4","key":"9_CR12","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. Journal of Functional Programming\u00a014(4), 379\u2013427 (2004)","journal-title":"Journal of Functional Programming"},{"key":"9_CR13","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: Combining Techniques for Automated Termination Proofs. In: Baader, F., Voronkov, A. (eds.) LPAR 2004. LNCS (LNAI), vol.\u00a03452, pp. 301\u2013331. Springer, Heidelberg (2005)"},{"issue":"3","key":"9_CR14","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/s10817-006-9057-7","volume":"37","author":"J. Giesl","year":"2006","unstructured":"Giesl, J., Thiemann, R., Schneider-Kamp, P., Falke, S.: Mechanizing and Improving Dependency Pairs. Journal of Automatic Reasoning\u00a037(3), 155\u2013203 (2006)","journal-title":"Journal of Automatic Reasoning"},{"key":"9_CR15","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/BF01190827","volume":"5","author":"B. Gramlich","year":"1994","unstructured":"Gramlich, B.: Generalized Sufficient Conditions for Modular Termination of Rewriting. Applicable Algebra in Engineering, Communication and Computing\u00a05, 131\u2013151 (1994)","journal-title":"Applicable Algebra in Engineering, Communication and Computing"},{"key":"9_CR16","unstructured":"Guti\u00e9rrez, R., Lucas, S., Urbain, X.: Usable Rules for Context-Sensitive Rewrite System, DSIC-II\/03\/08. Technical report, UPV (2008)"},{"issue":"4","key":"9_CR17","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1016\/j.ic.2006.08.010","volume":"205","author":"N. Hirokawa","year":"2007","unstructured":"Hirokawa, N., Middeldorp, A.: Tyrolean Termination Tool: Techniques and Features. Information and Computation\u00a0205(4), 474\u2013511 (2007)","journal-title":"Information and Computation"},{"issue":"1","key":"9_CR18","first-page":"1","volume":"1998","author":"S. Lucas","year":"1998","unstructured":"Lucas, S.: Context-Sensitive Computations in Functional and Functional Logic Programs. Journal of Functional and Logic Programming\u00a01998(1), 1\u201361 (1998)","journal-title":"Journal of Functional and Logic Programming"},{"key":"9_CR19","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1145\/773184.773194","volume-title":"Proc. of PPDP 2001","author":"S. Lucas","year":"2001","unstructured":"Lucas, S.: Termination of on-demand rewriting and termination of OBJ programs. In: Proc. of PPDP 2001, pp. 82\u201393. ACM Press, New York (2001)"},{"issue":"1","key":"9_CR20","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/S0890-5401(02)93176-7","volume":"178","author":"S. Lucas","year":"2002","unstructured":"Lucas, S.: Context-Sensitive Rewriting Strategies. Information and Computation\u00a0178(1), 293\u2013343 (2002)","journal-title":"Information and Computation"},{"key":"9_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1007\/978-3-540-25979-4_14","volume-title":"Rewriting Techniques and Applications","author":"S. Lucas","year":"2004","unstructured":"Lucas, S.: MU-TERM: A Tool for Proving Termination of Context-Sensitive Rewriting. In: van Oostrom, V. (ed.) RTA 2004. LNCS, vol.\u00a03091, pp. 200\u2013209. Springer, Heidelberg (2004), http:\/\/zenon.dsic.upv.es\/muterm\/"},{"issue":"12","key":"9_CR22","doi-asserted-by":"publisher","first-page":"1782","DOI":"10.1016\/j.ic.2006.07.001","volume":"204","author":"S. Lucas","year":"2006","unstructured":"Lucas, S.: Proving Termination of Context-Sensitive Rewriting by Transformation. Information and Computation\u00a0204(12), 1782\u20131846 (2006)","journal-title":"Information and Computation"},{"key":"9_CR23","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-3661-8","volume-title":"Advanced Topics in Term Rewriting","author":"E. Ohlebusch","year":"2002","unstructured":"Ohlebusch, E.: Advanced Topics in Term Rewriting. Springer, Heidelberg (2002)"},{"issue":"4","key":"9_CR24","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/BF03177743","volume":"32","author":"X. Urbain","year":"2004","unstructured":"Urbain, X.: Modular & Incremental Automated Termination Proofs. Journal of Automated Reasoning\u00a032(4), 315\u2013355 (2004)","journal-title":"Journal of Automated Reasoning"}],"container-title":["Lecture Notes in Computer Science","Rewriting Techniques and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70590-1_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:08:21Z","timestamp":1605762501000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70590-1_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540705888","9783540705901"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70590-1_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}