{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:53:09Z","timestamp":1725551589759},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540305538"},{"type":"electronic","value":"9783540316503"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11591191_14","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T09:44:25Z","timestamp":1132652665000},"page":"184-198","source":"Crossref","is-referenced-by-count":1,"title":["Termination of Fair Computations in Term Rewriting"],"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":[{"issue":"1","key":"14_CR1","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0304-3975(92)90185-I","volume":"96","author":"G. Berry","year":"1992","unstructured":"Berry, G., Boudol, G.: The Chemical Abstract Machine. Theoretical Computer Science\u00a096(1), 217\u2013248 (1992)","journal-title":"Theoretical Computer Science"},{"key":"14_CR2","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1145\/1014007.1014022","volume-title":"Proc. of ACM SIGPLAN 2004 Symposium on Partial Evaluation and Program Manipulation, PEPM 2004","author":"F. Dur\u00e1n","year":"2004","unstructured":"Dur\u00e1n, F., Lucas, S., Meseguer, J., March\u00e9, C., Urbain, X.: Proving Termination of Membership Equational Programs. In: Sestoft, P., Heintze, N. (eds.) Proc. of ACM SIGPLAN 2004 Symposium on Partial Evaluation and Program Manipulation, PEPM 2004, pp. 147\u2013158. ACM Press, New York (2004)"},{"key":"14_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-4886-6","volume-title":"Fairness","author":"N. Francez","year":"1986","unstructured":"Francez, N.: Fairness. Springer, Berlin (1986)"},{"key":"14_CR4","unstructured":"Geser, A.: Relative Termination. PhD Thesis. Fakult\u00e4t f\u00fcr Mathematik und Informatik. Universit\u00e4t Passau (1990)"},{"issue":"4","key":"14_CR5","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":"14_CR6","first-page":"395","volume-title":"Computational logic: essays in honour of J. Alan Robinson","author":"G. Huet","year":"1991","unstructured":"Huet, G., L\u00e9vy, J.J.: Computations in orthogonal term rewriting systems I, II. In: Lassez, J.L., Plotkin, G. (eds.) Computational logic: essays in honour of J. Alan Robinson, pp. 395\u2013414, 415-443. The MIT Press, Cambridge (1991)"},{"issue":"1","key":"14_CR7","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1006\/inco.1995.1075","volume":"119","author":"R. Kennaway","year":"1995","unstructured":"Kennaway, R., Klop, J.W., Sleep, M.R., de Vries, F.-J.: Transfinite Reductions in Orthogonal Term Rewriting Systems. Information and Computation\u00a0119(1), 18\u201338 (1995)","journal-title":"Information and Computation"},{"key":"14_CR8","first-page":"1","volume-title":"Handbook of Logic in Computer Science","author":"J.W. Klop","year":"1992","unstructured":"Klop, J.W.: Term Rewriting Systems. In: Abramsky, S., Gabbay, D.M., Maibaum, T.S.E. (eds.) Handbook of Logic in Computer Science, vol.\u00a02, pp. 1\u2013116. Oxford University Press, Oxford (1992)"},{"key":"14_CR9","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/11559306_13","volume-title":"Frontiers of Combining Systems","author":"A. Koprowski","year":"2005","unstructured":"Koprowski, A., Zantema, H.: Proving Liveness with Fairness using Rewriting. In: Gramlich, B. (ed.) FroCos 2005. LNCS (LNAI), vol.\u00a03717, pp. 232\u2013247. Springer, Heidelberg (2005)"},{"key":"14_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1007\/3-540-10843-2_22","volume-title":"Automata, Languages and Programming","author":"D. Lehmann","year":"1981","unstructured":"Lehmann, D., Pnueli, A., Stavi, J.: Impartiality, Justice and Fairness: the ethics of concurrent termination. In: Even, S., Kariv, O. (eds.) ICALP 1981. LNCS, vol.\u00a0115, pp. 264\u2013277. Springer, Heidelberg (1981)"},{"issue":"1","key":"14_CR11","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0304-3975(92)90182-F","volume":"96","author":"J. Meseguer","year":"1992","unstructured":"Meseguer, J.: Conditional Rewriting Logic as a Unified Model of Concurrency. Theoretical Computer Science\u00a096(1), 73\u201355 (1992)","journal-title":"Theoretical Computer Science"},{"key":"14_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/978-3-540-32033-3_19","volume-title":"Term Rewriting and Applications","author":"J. Meseguer","year":"2005","unstructured":"Meseguer, J.: Localized Fairness: A Rewriting Semantics. In: Giesl, J. (ed.) RTA 2005. LNCS, vol.\u00a03467, pp. 250\u2013263. Springer, Heidelberg (2005)"},{"issue":"2","key":"14_CR13","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/S0304-3975(01)00357-7","volume":"285","author":"N. Mart\u00ed-Oliet","year":"2002","unstructured":"Mart\u00ed-Oliet, N., Meseguer, J.: Rewriting logic: roadmap and bibliography. Theoretical Computer Science\u00a0285(2), 121\u2013154 (2002)","journal-title":"Theoretical Computer Science"},{"key":"14_CR14","unstructured":"Manna, Z., Ness, S.: On the termination of Markov algorithms. In: Proc. of the Third Hawaii International Conference on System Science, pp. 789\u2013792 (1970)"},{"key":"14_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-08531-9","volume-title":"Computing in Systems Described by Equations","author":"M.J. O\u2019Donnell","year":"1977","unstructured":"O\u2019Donnell, M.J.: Computing in Systems Described by Equations. LNCS, vol.\u00a058. Springer, Heidelberg (1977)"},{"key":"14_CR16","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, Berlin (2002)"},{"key":"14_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/3-540-15976-2_14","volume-title":"Rewriting Techniques and Applications","author":"S. Porat","year":"1985","unstructured":"Porat, S., Francez, N.: Fairness in term rewriting systems. In: Jouannaud, J.-P. (ed.) RTA 1985. LNCS, vol.\u00a0202, pp. 287\u2013300. Springer, Heidelberg (1985)"},{"key":"14_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/3-540-16780-3_77","volume-title":"8th International Conference on Automated Deduction","author":"S. Porat","year":"1986","unstructured":"Porat, S., Francez, N.: Full-commutation and fair-termination in equational (and combined) term rewriting systems. In: Siekmann, J.H. (ed.) CADE 1986. LNCS, vol.\u00a0230, pp. 21\u201341. Springer, Heidelberg (1986)"},{"key":"14_CR19","volume-title":"Term Rewriting Systems","author":"TeReSe","year":"2003","unstructured":"TeReSe: Term Rewriting Systems. Cambridge University Press, Cambridge (2003)"},{"key":"14_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1007\/3-540-51081-8_126","volume-title":"Rewriting Techniques and Applications","author":"S. Tison","year":"1989","unstructured":"Tison, S.: Fair termination is decidable for ground systems. In: Dershowitz, N. (ed.) RTA 1989. LNCS, vol.\u00a0355, pp. 462\u2013476. Springer, Heidelberg (1989)"}],"container-title":["Lecture Notes in Computer Science","Logic for Programming, Artificial Intelligence, and Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11591191_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:51:27Z","timestamp":1619506287000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11591191_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540305538","9783540316503"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/11591191_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}