{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:18:16Z","timestamp":1725549496267},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540253044"},{"type":"electronic","value":"9783540318620"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31862-0_26","type":"book-chapter","created":{"date-parts":[[2010,3,12]],"date-time":"2010-03-12T13:28:55Z","timestamp":1268400535000},"page":"356-371","source":"Crossref","is-referenced-by-count":4,"title":["A Proof of Weak Termination Providing the Right Way to Terminate"],"prefix":"10.1007","author":[{"given":"Olivier","family":"Fissore","sequence":"first","affiliation":[]},{"given":"Isabelle","family":"Gnaedig","sequence":"additional","affiliation":[]},{"given":"H\u00e9l\u00e8ne","family":"Kirchner","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"26_CR1","unstructured":"Arts, T., Giesl, J.: Proving innermost normalization automatically. Technical Report 96\/39, Technische Hochschule Darmstadt, Germany (1996)"},{"key":"26_CR2","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)"},{"key":"26_CR3","doi-asserted-by":"crossref","unstructured":"Borovansk\u00fd, P., Kirchner, C., Kirchner, H., Moreau, P.-E., Ringeissen, C.: An overview of ELAN. In: Kirchner, C., Kirchner, H. (eds.) Proceedings of the second International Workshop on Rewriting Logic and Applications, Pont-\u00e0-Mousson (France). Electronic Notes in Theoretical Computer Science, vol.\u00a015 (September 1998), Report LORIA 98-R-316, http:\/\/www.elsevier.nl\/locate\/entcs\/volume15.html","DOI":"10.1016\/S1571-0661(05)82552-6"},{"key":"26_CR4","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/S0304-3975(01)00359-0","volume":"285","author":"M. Clavel","year":"2002","unstructured":"Clavel, M., Dur\u00e1n, F., Eker, S., Lincoln, P., Mart\u00ed-Oliet, N., Meseguer, J., Quesada, J.F.: Maude: Specification and programming in rewriting logic. Theoretical Computer Science\u00a0285, 187\u2013243 (2002)","journal-title":"Theoretical Computer Science"},{"key":"26_CR5","first-page":"322","volume-title":"Computational Logic. Essays in honor of Alan Robinson","author":"H. Comon","year":"1991","unstructured":"Comon, H.: Disunification: a survey. In: Lassez, J.-L., Plotkin, G. (eds.) Computational Logic. Essays in honor of Alan Robinson, ch.\u00a09, pp. 322\u2013359. The MIT press, Cambridge (1991)"},{"key":"26_CR6","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/0304-3975(82)90026-3","volume":"17","author":"N. Dershowitz","year":"1982","unstructured":"Dershowitz, N.: Orderings for term-rewriting systems. Theoretical Computer Science\u00a017, 279\u2013301 (1982)","journal-title":"Theoretical Computer Science"},{"key":"26_CR7","first-page":"244","volume-title":"Handbook of Theoretical Computer Science","author":"N. Dershowitz","year":"1990","unstructured":"Dershowitz, N., Jouannaud, J.-P.: Handbook of Theoretical Computer Science, vol.\u00a0B, ch. 6, pp. 244\u2013320. Elsevier Science Publishers B. V, North-Holland (1990), Also as: Research report 478, LRI"},{"key":"26_CR8","series-title":"Electronic Notes in Theoretical Computer Science","volume-title":"Selected papers of the 4th International Workshop on Strategies in Automated Deduction","author":"O. Fissore","year":"2001","unstructured":"Fissore, O., Gnaedig, I., Kirchner, H.: Termination of rewriting with local strategies. In: Bonacina, M.P., Gramlich, B. (eds.) Selected papers of the 4th International Workshop on Strategies in Automated Deduction. Electronic Notes in Theoretical Computer Science, vol.\u00a058. Elsevier Science Publishers B. V, North-Holland (2001)"},{"key":"26_CR9","first-page":"62","volume-title":"Proceedings of the Fourth International Conference on Principles and Practice of Declarative Programming","author":"O. Fissore","year":"2002","unstructured":"Fissore, O., Gnaedig, I., Kirchner, H.: CARIBOO: An induction based proof tool for termination with strategies. In: Proceedings of the Fourth International Conference on Principles and Practice of Declarative Programming, Pittsburgh (USA), October 2002, pp. 62\u201373. ACM Press, New York (2002)"},{"key":"26_CR10","series-title":"Electronic Notes in Theoretical Computer Science","volume-title":"Proceedings of the Fourth International Workshop on Rewriting Logic and Its Applications","author":"O. Fissore","year":"2002","unstructured":"Fissore, O., Gnaedig, I., Kirchner, H.: Outermost ground termination. In: Proceedings of the Fourth International Workshop on Rewriting Logic and Its Applications. Electronic Notes in Theoretical Computer Science, vol.\u00a071 Elsevier Science Publishers B. V, North-Holland (2002)"},{"key":"26_CR11","doi-asserted-by":"crossref","unstructured":"Fissore, O., Gnaedig, I., Kirchner, H.: Proving weak termination also provides the right way to terminate - Extended version. Technical report, LORIA, Nancy (France) (March 2004), Available at http:\/\/www.loria.fr\/~gnaedig\/PAPERS\/REPORTS\/wt-extended-2004.ps","DOI":"10.1007\/978-3-540-31862-0_26"},{"key":"26_CR12","doi-asserted-by":"crossref","unstructured":"Futatsugi, K., Nakagawa, A.: An overview of CAFE specification environment \u2013 an algebraic approach for creating, verifying, and maintaining formal specifications over networks. In: Proceedings of the 1st IEEE Int. Conference on Formal Engineering Methods (1997)","DOI":"10.1109\/ICFEM.1997.630424"},{"key":"26_CR13","unstructured":"Gnaedig, I., Kirchner, H., Fissore, O.: Induction for innermost and outermost ground termination. Technical Report A01-R-178, LORIA, Nancy (France) (September 2001)"},{"key":"26_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1007\/3-540-44802-0_34","volume-title":"Computer Science Logic","author":"J. Goubault-Larrecq","year":"2001","unstructured":"Goubault-Larrecq, J.: Well-founded recursive relations. In: Fribourg, L. (ed.) CSL 2001 and EACSL 2001. LNCS, vol.\u00a02142, p. 484. Springer, Heidelberg (2001)"},{"key":"26_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0097790","volume-title":"Types for Proofs and Programs","author":"J. Goubault-Larrecq","year":"1998","unstructured":"Goubault-Larrecq, J.: A proof of weak termination of typed lambda-sigma-calculi. In: Gim\u00e9nez, E. (ed.) TYPES 1996. LNCS, vol.\u00a01512. Springer, Heidelberg (1998)"},{"key":"26_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/BFb0013069","volume-title":"Logic Programming and Automated Reasoning","author":"B. Gramlich","year":"1992","unstructured":"Gramlich, B.: Relating innermost, weak, uniform and modular termination of term rewriting systems. In: Voronkov, A. (ed.) LPAR 1992. LNCS, vol.\u00a0624, pp. 285\u2013296. Springer, Heidelberg (1992)"},{"issue":"1","key":"26_CR17","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0304-3975(96)00042-4","volume":"165","author":"B. Gramlich","year":"1996","unstructured":"Gramlich, B.: On termination and confluence properties of disjoint and constructor-sharing conditional rewrite systems. Theoretical Computer Science\u00a0165(1), 97\u2013131 (1996)","journal-title":"Theoretical Computer Science"},{"key":"26_CR18","first-page":"395","volume-title":"Computational Logic, ch. 11","author":"G. Huet","year":"1991","unstructured":"Huet, G., L\u00e9vy, J.-J.: Computations in orthogonal rewriting systems, I. In: Lassez, J.-L., Plotkin, G. (eds.) Computational Logic, ch. 11, pp. 395\u2013414. The MIT press, Cambridge (1991)"},{"key":"26_CR19","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1145\/151257.151260","volume":"2","author":"P. Klint","year":"1993","unstructured":"Klint, P.: A meta-environment for generating programming environments. ACM Transactions on Software Engineering and Methodology\u00a02, 176\u2013201 (1993)","journal-title":"ACM Transactions on Software Engineering and Methodology"},{"key":"26_CR20","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)"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing - ICTAC 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31862-0_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:30:01Z","timestamp":1605760201000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31862-0_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540253044","9783540318620"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31862-0_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}