{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T20:01:13Z","timestamp":1762459273179,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319155449"},{"type":"electronic","value":"9783319155456"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-15545-6_9","type":"book-chapter","created":{"date-parts":[[2015,3,5]],"date-time":"2015-03-05T02:19:15Z","timestamp":1425521955000},"page":"91-114","source":"Crossref","is-referenced-by-count":4,"title":["Localized Operational Termination in General Logics"],"prefix":"10.1007","author":[{"given":"Salvador","family":"Lucas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos\u00e9","family":"Meseguer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Aczel, P.: Schematic Consequence. In: Gabbay, D. (ed.) What is a Logical System, pp. 261\u2013272. Oxford University Press (1994)","DOI":"10.1093\/oso\/9780198538592.003.0010"},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/978-3-642-17796-5_12","volume-title":"Algebraic Methodology and Software Technology","author":"B. Alarc\u00f3n","year":"2011","unstructured":"Alarc\u00f3n, B., Guti\u00e9rrez, R., Lucas, S., Navarro-Marset, R.: Proving Termination Properties with mu-term. In: Johnson, M., Pavlovic, D. (eds.) AMAST 2010. LNCS, vol.\u00a06486, pp. 201\u2013208. Springer, Heidelberg (2011)"},{"key":"9_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-642-03429-9_6","volume-title":"Recent Trends in Algebraic Development Techniques","author":"A. Boronat","year":"2009","unstructured":"Boronat, A., Knapp, A., Meseguer, J., Wirsing, M.: What Is a Multi-modeling Language? In: Corradini, A., Montanari, U. (eds.) WADT 2008. LNCS, vol.\u00a05486, pp. 71\u201387. Springer, Heidelberg (2009)"},{"issue":"1","key":"9_CR4","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1145\/9758.10501","volume":"9","author":"M. Broy","year":"1987","unstructured":"Broy, M., Wirsing, M., Pepper, P.: On the Algebraic Definition of Programming Languages. ACM Transactions on Programming Languages and Systems\u00a09(1), 54\u201399 (1987)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"9_CR5","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/S0743-1066(99)00006-0","volume":"41","author":"M. Codish","year":"1999","unstructured":"Codish, M., Taboch, C.: A semantic basis for the termination analysis of logic programs. Journal of Logic Programming\u00a041, 103\u2013123 (1999)","journal-title":"Journal of Logic Programming"},{"issue":"5","key":"9_CR6","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1145\/1941487.1941509","volume":"54","author":"B. Cook","year":"2011","unstructured":"Cook, B., Rybalchenko, A., Podelski, A.: Proving Program Termination. Communications of the ACM\u00a054(5), 88\u201398 (2011)","journal-title":"Communications of the ACM"},{"key":"9_CR7","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/s002000100065","volume":"12","author":"N. Dershowitz","year":"2001","unstructured":"Dershowitz, N., Lindenstrauss, N., Sagiv, Y., Serebrenik, A.: A General Framework for Automatic Termination of Logic Programs. Applicable Algebra in Engineering, Communication and Computing\u00a012, 117\u2013156 (2001)","journal-title":"Applicable Algebra in Engineering, Communication and Computing"},{"key":"9_CR8","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/978-3-540-71070-7_27","volume-title":"Automated Reasoning","author":"F. Dur\u00e1n","year":"2008","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)"},{"issue":"1-2","key":"9_CR9","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"},{"issue":"3:20","key":"9_CR10","first-page":"1","volume":"6","author":"J. Endrullis","year":"2010","unstructured":"Endrullis, J., de Vrijer, R., Waldmann, J.: Local termination: theory and practice. Logical Methods in Computer Science\u00a06(3:20), 1\u201337 (2010)","journal-title":"Logical Methods in Computer Science"},{"issue":"3","key":"9_CR11","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"},{"issue":"2","key":"9_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1890028.1890030","volume":"33","author":"J\u00fcrgen Giesl","year":"2011","unstructured":"Giesl, J., Swiderski, P., Schneider-Kamp, P., Thiemann, R.: Automated Termination Proofs for Haskell by Term Rewriting. ACM Transactions on Programming languages and Systems\u00a033(2), Article 7 (2011)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1007\/978-3-319-12904-4_10","volume-title":"Rewriting Logic and Its Applications","author":"S. Lucas","year":"2014","unstructured":"Lucas, S., Meseguer, J.: Strong and Weak Operational Termination of Order-Sorted Rewrite Theories. In: Escobar, S. (ed.) WRLA 2014. LNCS, vol.\u00a08663, pp. 178\u2013194. Springer, Heidelberg (2014)"},{"key":"9_CR14","unstructured":"Lucas, S., Meseguer, J.: Proving Operational Termination Of Declarative Programs In General Logics. In: Danvy, O. (ed.) Proc. of the 16th International Symposium on Principles and Practice of Declarative Programming, PPDP 2014. ACM Press (to appear, 2014)"},{"key":"9_CR15","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1016\/j.ipl.2005.05.002","volume":"95","author":"S. Lucas","year":"2005","unstructured":"Lucas, S., March\u00e9, C., Meseguer, J.: Operational termination of conditional term rewriting systems. Information Processing Letters\u00a095, 446\u2013453 (2005)","journal-title":"Information Processing Letters"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"Meseguer, J.: General Logics. In: Ebbinghaus, H.-D., et al. (eds.) Logic Colloquium\u201987, pp. 275\u2013329. North-Holland (1989)","DOI":"10.1016\/S0049-237X(08)70132-0"},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Meseguer, J.: A Logical Theory of Concurrent Objects and its realization in the Maude Language. In: Agha, G., Wegner, P., Yonezawa, A. (eds.) Research Directions in Concurrent Object-Oriented Programming, pp. 314\u2013390. The MIT Press (1993)","DOI":"10.7551\/mitpress\/2087.003.0017"},{"key":"9_CR18","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.ic.2013.08.004","volume":"231","author":"J. Meseguer","year":"2013","unstructured":"Meseguer, J., Rosu, G.: The Rewriting Logic Semantics Project: A Progress Report. Information and Computation\u00a0231, 38\u201369 (2013)","journal-title":"Information and Computation"},{"key":"9_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1007\/978-3-540-78769-3_2","volume-title":"Logic-Based Program Synthesis and Transformation","author":"M.T. Nguyen","year":"2008","unstructured":"Nguyen, M.T., Giesl, J., Schneider-Kamp, P., De Schreye, D.: Termination Analysis of Logic Programs Based on Dependency Graphs. In: King, A. (ed.) LOPSTR 2007. LNCS, vol.\u00a04915, pp. 8\u201322. Springer, Heidelberg (2008)"},{"key":"9_CR20","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/0743-1066(94)90027-2","volume":"19","author":"D. Scheye de","year":"1994","unstructured":"de Scheye, D., Decorte, S.: Termination of Logic Programs: The Never-Ending Story. Journal of Logic Programming\u00a019, 199\u2013260 (1994)","journal-title":"Journal of Logic Programming"},{"key":"9_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-642-12592-8_4","volume-title":"Logic-Based Program Synthesis and Transformation","author":"P. Schneider-Kamp","year":"2010","unstructured":"Schneider-Kamp, P., Giesl, J., Nguyen, M.T.: The Dependency Triple Framework for Termination of Logic Programs. In: De Schreye, D. (ed.) LOPSTR 2009. LNCS, vol.\u00a06037, pp. 37\u201351. Springer, Heidelberg (2010)"},{"key":"9_CR22","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/3054.001.0001","volume-title":"The Formal Semantics of Programming Languages","author":"G. Winskel","year":"1993","unstructured":"Winskel, G.: The Formal Semantics of Programming Languages. The MIT Press, Cambrige Massachusetts (1993)"},{"key":"9_CR23","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/0304-3975(86)90051-4","volume":"42","author":"M. Wirsing","year":"1986","unstructured":"Wirsing, M.: Structured Algebraic Specifications: A Kernel Language. Theoretical Computer Science\u00a042, 123\u2013249 (1986)","journal-title":"Theoretical Computer Science"},{"key":"9_CR24","first-page":"675","volume-title":"Formal Models and Semantics","author":"Martin WIRSING","year":"1990","unstructured":"Wirsing, M.: Algebraic Specification. In: Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B), pp. 675\u2013788 (1990)"},{"issue":"2","key":"9_CR25","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1016\/S0304-3975(01)00367-X","volume":"285","author":"M. Wirsing","year":"2002","unstructured":"Wirsing, M., Knapp, A.: A formal approach to object-oriented software engineering. Theoretical Computer Science\u00a0285(2), 519\u2013560 (2002)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Software, Services, and Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-15545-6_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,7]],"date-time":"2024-06-07T16:40:14Z","timestamp":1717778414000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-15545-6_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319155449","9783319155456"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-15545-6_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}