{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,10]],"date-time":"2026-07-10T11:50:20Z","timestamp":1783684220943,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642163098","type":"print"},{"value":"9783642163104","type":"electronic"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-16310-4_3","type":"book-chapter","created":{"date-parts":[[2010,10,1]],"date-time":"2010-10-01T03:44:29Z","timestamp":1285904669000},"page":"18-34","source":"Crossref","is-referenced-by-count":6,"title":["Proving Termination in the Context-Sensitive Dependency Pair Framework"],"prefix":"10.1007","author":[{"given":"Ra\u00fal","family":"Guti\u00e9rrez","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Salvador","family":"Lucas","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Lucas, S.: Context-Sensitive Computations in Functional and Functional Logic Programs. Journal of Functional and Logic Programming\u00a0(1), 1\u201361 (1998)","DOI":"10.1142\/9789814528849"},{"issue":"1","key":"3_CR2","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1016\/j.tcs.2006.04.012","volume":"360","author":"R. Bruni","year":"2006","unstructured":"Bruni, R., Meseguer, J.: Semantic Foundations for Generalized Rewrite Theories. Theoretical Computer Science\u00a0360(1), 386\u2013414 (2006)","journal-title":"Theoretical Computer Science"},{"issue":"1-2","key":"3_CR3","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/s10990-008-9028-2","volume":"21","author":"F. Dur\u00e1n","year":"2008","unstructured":"Dur\u00e1n, F., Lucas, S., March\u00e9, C., Meseguer, J., Urbain, X.: Proving Operational Termination of Membership Equational Programs. Higher-Order and Symbolic Computation\u00a021(1-2), 59\u201388 (2008)","journal-title":"Higher-Order and Symbolic Computation"},{"key":"3_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/978-3-642-02348-4_22","volume-title":"Rewriting Techniques and Applications","author":"J. Endrullis","year":"2009","unstructured":"Endrullis, J., Hendriks, D.: From Outermost to Context-Sensitive Rewriting. In: Treinen, R. (ed.) RTA 2009. LNCS, vol.\u00a05595, pp. 305\u2013319. Springer, Heidelberg (2009)"},{"issue":"3","key":"3_CR5","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/j.ipl.2004.10.005","volume":"93","author":"M.L. Fern\u00e1ndez","year":"2005","unstructured":"Fern\u00e1ndez, M.L.: Relaxing Monotonicity for Innermostt Termination. Information Processing Letters\u00a093(3), 117\u2013123 (2005)","journal-title":"Information Processing Letters"},{"key":"3_CR6","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":"3_CR7","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)"},{"issue":"1-2","key":"3_CR8","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-2), 133\u2013178 (2000)","journal-title":"Theoretical Computer Science"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Alarc\u00f3n, B., Guti\u00e9rrez, R., Lucas, S.: Context-Sensitive Dependency Pairs. Information and Computation (2010) (to appear)","DOI":"10.1016\/j.ic.2010.03.003"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Guti\u00e9rrez, R., Lucas, S.: Proving Termination in the Context-Sensitive Dependency Pairs Framework. Technical report, Universidad Polit\u00e9cnica de Valencia (February 2010) Available as Technical Report DSIC-II\/02\/10.","DOI":"10.1007\/978-3-642-16310-4_3"},{"key":"3_CR11","doi-asserted-by":"publisher","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":"3","key":"3_CR12","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":"3_CR13","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: Oostrom, V. (ed.) RTA 2004. LNCS, vol.\u00a03091, pp. 200\u2013209. Springer, Heidelberg (2004), http:\/\/zenon.dsic.upv.es\/muterm\/"},{"key":"3_CR14","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/j.entcs.2007.05.041","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. Electronic Notes in Theoretical Computer Science\u00a0188, 105\u2013115 (2007)","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"3_CR15","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"},{"key":"3_CR16","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":"3","key":"3_CR17","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":"3_CR18","first-page":"108","volume-title":"Proc. of 10th International ACM SIGPLAN Sympsium on Principles and Practice of Declarative Programming, PPDP 2008","author":"S. Lucas","year":"2008","unstructured":"Lucas, S., Meseguer, J.: Order-Sorted Dependency Pairs. In: Antoy, S., Albert, E. (eds.) Proc. of 10th International ACM SIGPLAN Sympsium on Principles and Practice of Declarative Programming, PPDP 2008, pp. 108\u2013119. ACM Press, New York (2008)"},{"key":"3_CR19","series-title":"Lecture Notes in Artificial Intelligence","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: Automatic Termination Proofs in the Dependency Pair Framework. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), vol.\u00a04130, pp. 281\u2013286. Springer, Heidelberg (2006), http:\/\/www-i2.informatik.rwth-aachen.de\/AProVE"},{"key":"3_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/978-3-642-02348-4_20","volume-title":"Rewriting Techniques and Applications","author":"F. Schernhammer","year":"2009","unstructured":"Schernhammer, F., Gramlich, B.: VMTL - A Modular Termination Laboratory. In: Treinen, R. (ed.) RTA 2009. LNCS, vol.\u00a05595, pp. 285\u2013294. Springer, Heidelberg (2009)"},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"Endrullis, J.: Jambox, Automated Termination Proofs For String and Term Rewriting (2009), http:\/\/joerg.endrullis.de\/jambox.html","DOI":"10.1007\/978-3-642-02348-4_19"}],"container-title":["Lecture Notes in Computer Science","Rewriting Logic and Its Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16310-4_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T04:31:04Z","timestamp":1740544264000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16310-4_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642163098","9783642163104"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16310-4_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}