{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,10]],"date-time":"2026-07-10T11:50:17Z","timestamp":1783684217107,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642177958","type":"print"},{"value":"9783642177965","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-17796-5_12","type":"book-chapter","created":{"date-parts":[[2011,1,11]],"date-time":"2011-01-11T17:08:27Z","timestamp":1294765707000},"page":"201-208","source":"Crossref","is-referenced-by-count":19,"title":["Proving Termination Properties with mu-term"],"prefix":"10.1007","author":[{"given":"Beatriz","family":"Alarc\u00f3n","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ra\u00fal","family":"Guti\u00e9rrez","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Salvador","family":"Lucas","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rafael","family":"Navarro-Marset","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"12_CR1","unstructured":"Alarc\u00f3n, B.: Innermost Termination of Context-Sensitive Rewriting. Master\u2019s thesis, Departamento de Sistemas Inform\u00e1ticos y Computaci\u00f3n, Universidad Polit\u00e9cnica de Valencia, Valencia, Spain (2008)"},{"key":"12_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\u00a0188, 105\u2013115 (2007)","DOI":"10.1016\/j.entcs.2007.05.041"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Alarc\u00f3n, B., Guti\u00e9rrez, R., Lucas, S.: Context-Sensitive Dependency Pairs. Information and Computation\u00a0208, 922\u2013968 (2010)","DOI":"10.1016\/j.ic.2010.03.003"},{"key":"12_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":"12_CR5","doi-asserted-by":"crossref","unstructured":"Alarc\u00f3n, B., Lucas, S., Meseguer, J.: A Dependency Pair Framework for A\u2009\u2228\u2009C-Termination. In: \u00d6lveczky, P. (ed.) WRLA 2010. LNCS, vol.\u00a06381, pp. 35\u201351. Springer, Heidelberg (2010)","DOI":"10.1007\/978-3-642-16310-4_4"},{"key":"12_CR6","unstructured":"Alarc\u00f3n, B., Lucas, S., Navarro-Marset, R.: Proving Termination with Matrix Interpretations over the Reals. In: Geser, A., Waldmann, J. (eds.) Proc. of the 10th International Workshop on Termination, WST 2009, pp. 12\u201315 (2009)"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Arts, T., Giesl, J.: Termination of Term Rewriting Using Dependency Pairs. Theoretical Computer Science\u00a0236(1-2), 133\u2013178 (2000)","DOI":"10.1016\/S0304-3975(99)00207-8"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Borralleras, C., Lucas, S., Navarro-Marset, R., Rodr\u00edguez-Carbonell, E., Rubio, A.: Solving Non-linear Polynomial Arithmetic via SAT Modulo Linear Arithmetic. In: Schmidt, R.A. (ed.) CADE 2009. LNCS, vol.\u00a05663, pp. 294\u2013305. Springer, Heidelberg (2009)","DOI":"10.1007\/978-3-642-02959-2_23"},{"key":"12_CR9","doi-asserted-by":"crossref","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)","DOI":"10.1007\/3-540-45620-1_27"},{"key":"12_CR10","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":"12_CR11","unstructured":"Contejean, E., March\u00e9, C., Monate, B., Urbain, X.: Proving Termination of Rewriting with C i ME. In: Rubio, A. (ed.) Proc. of the 6th International Workshop on Termination, WST 2003, pp. 71\u201373 (2003)"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Dur\u00e1n, F., Lucas, S., Meseguer, J.: MTT: The Maude Termination Tool (System Description). In: Armando, A., Baumgartner, P., Dowek, G. (eds.) IJCAR 2008. LNCS (LNAI), vol.\u00a05195, pp. 313\u2013319. Springer, Heidelberg (2008)","DOI":"10.1007\/978-3-540-71070-7_27"},{"key":"12_CR13","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"},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"Giesl, J., Middeldorp, A.: Innermost Termination of Context-Sensitive Rewriting. In: Ito, M., Toyama, M. (eds.) DLT 2002. LNCS(LNAI), vol.\u00a02450, pp. 231\u2013244. Springer, Heidelberg (2003)","DOI":"10.1007\/3-540-45005-X_20"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Giesl, J., Middeldorp, A.: Transformation Techniques for Context-Sensitive Rewrite Systems. Journal of Functional Programming\u00a014(4), 379\u2013427 (2004)","DOI":"10.1017\/S0956796803004945"},{"key":"12_CR16","doi-asserted-by":"crossref","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)","DOI":"10.1007\/11814771_24"},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"Giesl, J., Thiemann, R., Schneider-Kamp, P., Falke, S.: Mechanizing and Improving Dependency Pairs. Journal of Automatic Reasoning\u00a037(3), 155\u2013203 (2006)","DOI":"10.1007\/s10817-006-9057-7"},{"key":"12_CR18","doi-asserted-by":"crossref","unstructured":"Gnaedig, I.: Termination of Order-sorted Rewriting. In: Kirchner, H., Levi, G. (eds.) ALP 1992. LNCS, vol.\u00a0632, pp. 37\u201352. Springer, Heidelberg (1992)","DOI":"10.1007\/BFb0013818"},{"key":"12_CR19","doi-asserted-by":"crossref","unstructured":"Gramlich, B., Lucas, S.: Modular Termination of Context-Sensitive Rewriting. In: Proc. of the 4th ACM SIGPLAN International Conference on Principles and Practice of Declarative Programming, PPDP 2002, pp. 50\u201361. ACM Press, New York (2002)","DOI":"10.1145\/571157.571163"},{"key":"12_CR20","doi-asserted-by":"crossref","unstructured":"Guti\u00e9rrez, R., Lucas, S.: Proving Termination in the Context-Sensitive Dependency Pair Framework. In: \u00d6lveczky, P.C. (ed.) WRLA 2010. LNCS, vol.\u00a06381, pp. 18\u201334. Springer, Heidelberg (2010)","DOI":"10.1007\/978-3-642-16310-4_3"},{"key":"12_CR21","doi-asserted-by":"crossref","unstructured":"Lucas, S.: Context-Sensitive Computations in Functional and Functional Logic Programs. Journal of Functional and Logic Programming\u00a01998(1), 1\u201361 (1998)","DOI":"10.1142\/9789814528849"},{"key":"12_CR22","doi-asserted-by":"crossref","unstructured":"Lucas, S.: Termination of Rewriting With Strategy Annotations. In: Nieuwenhuis, R., Voronkov, A. (eds.) LPAR 2001. LNCS (LNAI), vol.\u00a02250, pp. 666\u2013680. Springer, Heidelberg (2001)","DOI":"10.1007\/3-540-45653-8_46"},{"key":"12_CR23","doi-asserted-by":"crossref","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)","DOI":"10.1007\/978-3-540-25979-4_14"},{"key":"12_CR24","doi-asserted-by":"crossref","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)","DOI":"10.1051\/ita:2005029"},{"key":"12_CR25","doi-asserted-by":"crossref","unstructured":"Lucas, S.: Proving Termination of Context-Sensitive Rewriting by Transformation. Information and Computation\u00a0204(12), 1782\u20131846 (2006)","DOI":"10.1016\/j.ic.2006.07.001"},{"key":"12_CR26","doi-asserted-by":"crossref","unstructured":"Lucas, S., Meseguer, J.: Order-Sorted Dependency Pairs. In: Antoy, S., Albert, E. (eds.) Proc. of the 10th International ACM SIGPLAN Sympsium on Principles and Practice of Declarative Programming, PPDP 2008, pp. 108\u2013119. ACM Press, New York (2008)","DOI":"10.1145\/1389449.1389463"},{"key":"12_CR27","doi-asserted-by":"crossref","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)","DOI":"10.1007\/978-3-642-02348-4_20"},{"key":"12_CR28","doi-asserted-by":"crossref","unstructured":"Thiemann, R., Sternagel, C.: Loops under Strategies. In: Treinen, R. (ed.) RTA 2009. LNCS, vol.\u00a05595, pp. 17\u201331. Springer, Heidelberg (2009)","DOI":"10.1007\/978-3-642-02348-4_2"},{"key":"12_CR29","unstructured":"Winkler, S., Sato, H., Middeldorp, A., Kurihara, M.: Optimizing mkb TT. In: Lynch, C. (ed.) In: Lynch, C. (ed.) Proc. of the 21st International Conference on Rewriting Techniques and Applications, RTA 2010. Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a06, pp. 373\u2013384. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik (2010), http:\/\/drops.dagstuhl.de\/opus\/volltexte\/2010\/2664"}],"container-title":["Lecture Notes in Computer Science","Algebraic Methodology and Software Technology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17796-5_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T16:20:23Z","timestamp":1740846023000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17796-5_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642177958","9783642177965"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17796-5_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}