{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,4]],"date-time":"2026-10-04T05:39:27Z","timestamp":1791092367928,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540746201","type":"print"},{"value":"9783540746218","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74621-8_5","type":"book-chapter","created":{"date-parts":[[2007,8,22]],"date-time":"2007-08-22T11:46:32Z","timestamp":1187783192000},"page":"73-87","source":"Crossref","is-referenced-by-count":5,"title":["Termination of Innermost Context-Sensitive Rewriting Using Dependency Pairs"],"prefix":"10.1007","author":[{"given":"Beatriz","family":"Alarc\u00f3n","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Salvador","family":"Lucas","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"5_CR1","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":"5_CR2","doi-asserted-by":"crossref","unstructured":"Alarc\u00f3n, B., Guti\u00e9rrez, R., Lucas, S.: Improving the context-sensitive dependency graph. Electronic Notes in Theoretical Computer Science (to appear, 2007)","DOI":"10.1016\/j.entcs.2007.05.040"},{"key":"5_CR3","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":"5_CR4","unstructured":"Borralleras, C.: Ordering-based methods for proving termination automatically. PhD Thesis, Departament de Llenguatges i Sistemes Inform\u00e0tics, Universitat Polit\u00e8cnica de Catalunya (May 2003)"},{"issue":"1","key":"5_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":"5_CR6","doi-asserted-by":"crossref","unstructured":"Giesl, J., Middeldorp, A.: Innermost termination of context-sensitive rewriting. Aachener Informatik-Berichte (AIBs) 2002-04, RWTH Aachen (2002)","DOI":"10.1007\/3-540-45005-X_20"},{"key":"5_CR7","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":"5_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":"5_CR9","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)"},{"key":"5_CR10","doi-asserted-by":"crossref","first-page":"3","DOI":"10.3233\/FI-1995-24121","volume":"24","author":"B. Gramlich","year":"1995","unstructured":"Gramlich, B.: Abstract Relations between Restricted Termination and Confluence Properties of Rewrite Systems. Fundamenta Informaticae\u00a024, 3\u201323 (1995)","journal-title":"Fundamenta Informaticae"},{"key":"5_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/3-540-61464-8_45","volume-title":"RTA 1996","author":"B. Gramlich","year":"1996","unstructured":"Gramlich, B.: On Proving Termination by Innermost Termination. In: Ganzinger, H. (ed.) RTA 1996. LNCS, vol.\u00a01103, pp. 93\u2013107. Springer, Heidelberg (1996)"},{"key":"5_CR12","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1145\/571157.571163","volume-title":"Proc. of PPDP 2002","author":"B. Gramlich","year":"2002","unstructured":"Gramlich, B., Lucas, S.: Modular Termination of Context-Sensitive Rewriting. In: Proc. of PPDP 2002, pp. 50\u201361. ACM Press, New York (2002)"},{"key":"5_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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":"5_CR14","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":"5_CR15","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":"5_CR16","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)"},{"key":"5_CR17","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":"5_CR18","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":"5_CR19","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)"},{"issue":"12","key":"5_CR20","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":"5_CR21","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)"},{"key":"5_CR22","volume-title":"Term Rewriting Systems","author":"TeReSe","year":"2003","unstructured":"TeReSe: Term Rewriting Systems. Cambridge University Press, Cambridge (2003)"}],"container-title":["Lecture Notes in Computer Science","Frontiers of Combining Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74621-8_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,22]],"date-time":"2021-08-22T04:51:53Z","timestamp":1629607913000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74621-8_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540746201","9783540746218"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74621-8_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[]}}