{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:30:50Z","timestamp":1725474650187},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540499947"},{"type":"electronic","value":"9783540499954"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11944836_28","type":"book-chapter","created":{"date-parts":[[2006,11,28]],"date-time":"2006-11-28T04:48:02Z","timestamp":1164689282000},"page":"297-308","source":"Crossref","is-referenced-by-count":12,"title":["Context-Sensitive Dependency Pairs"],"prefix":"10.1007","author":[{"given":"Beatriz","family":"Alarc\u00f3n","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ra\u00fal","family":"Guti\u00e9rrez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Salvador","family":"Lucas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"28_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":"28_CR2","doi-asserted-by":"crossref","unstructured":"Alarc\u00f3n, B., Guti\u00e9rrez, R., Iborra, J., Lucas, S.: Proving Termination of Context-Sensitive Rewriting with MU-TERM. Electronic Notes in Theoretical Computer Science (to appear, 2007)","DOI":"10.1016\/j.entcs.2007.05.041"},{"key":"28_CR3","series-title":"LNAI","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":"28_CR4","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, 2006)"},{"issue":"1","key":"28_CR5","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":"28_CR6","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1145\/570186.570189","volume-title":"Proc. of RULE 2002","author":"B. Gramlich","year":"2002","unstructured":"Gramlich, B., Lucas, S.: Simple termination of context-sensitive rewriting. In: Proc. of RULE 2002, pp. 29\u201341. ACM Press, New York (2002)"},{"key":"28_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/3-540-48685-2_23","volume-title":"Rewriting Techniques and Applications","author":"J. Giesl","year":"1999","unstructured":"Giesl, J., Middeldorp, A.: Transforming Context-Sensitive Rewrite Systems. In: Narendran, P., Rusinowitch, M. (eds.) RTA 1999. LNCS, vol.\u00a01631, pp. 271\u2013285. Springer, Heidelberg (1999)"},{"issue":"4","key":"28_CR8","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":"28_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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, vol.\u00a03452, pp. 301\u2013331. Springer, Heidelberg (2005)"},{"key":"28_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/978-3-540-25979-4_18","volume-title":"Rewriting Techniques and Applications","author":"N. Hirokawa","year":"2004","unstructured":"Hirokawa, N., Middeldorp, A.: Dependency Pairs Revisited. In: van Oostrom, V. (ed.) RTA 2004. LNCS, vol.\u00a03091, pp. 249\u2013268. Springer, Heidelberg (2004)"},{"key":"28_CR11","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1016\/j.ic.2004.10.004","volume":"199","author":"N. Hirokawa","year":"2005","unstructured":"Hirokawa, N., Middeldorp, A.: Automating the dependency pair method. Information and Computation\u00a0199, 172\u2013199 (2005)","journal-title":"Information and Computation"},{"issue":"1","key":"28_CR12","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"},{"issue":"1","key":"28_CR13","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":"28_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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), Available at: http:\/\/www.dsic.upv.es\/~slucas\/csr\/termination\/muterm"},{"key":"28_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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":"3","key":"28_CR16","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1051\/ita:2005029","volume":"39","author":"S. Lucas","year":"2005","unstructured":"Lucas, S.: Polynomials over the reals in proofs of termination: from theory to practice. RAIRO Theoretical Informatics and Applications\u00a039(3), 547\u2013586 (2005)","journal-title":"RAIRO Theoretical Informatics and Applications"},{"key":"28_CR17","doi-asserted-by":"crossref","unstructured":"Lucas, S.: Proving termination of context-sensitive rewriting by transformation. Information and Computation (to appear, 2006)","DOI":"10.1016\/j.ic.2006.07.001"},{"key":"28_CR18","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, Berlin (2002)"},{"volume-title":"Term Rewriting Systems","year":"2003","key":"28_CR19","unstructured":"TeReSe (ed.): Term Rewriting Systems. Cambridge University Press, Cambridge (2003)"},{"key":"28_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1007\/3-540-62950-5_69","volume-title":"Rewriting Techniques and Applications","author":"H. Zantema","year":"1997","unstructured":"Zantema, H.: Termination of Context-Sensitive Rewriting. In: Comon, H. (ed.) RTA 1997. LNCS, vol.\u00a01232, pp. 172\u2013186. Springer, Heidelberg (1997)"}],"container-title":["Lecture Notes in Computer Science","FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11944836_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:17:47Z","timestamp":1619507867000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11944836_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540499947","9783540499954"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/11944836_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}