{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T20:27:54Z","timestamp":1725481674295},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540402541"},{"type":"electronic","value":"9783540448815"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-44881-0_23","type":"book-chapter","created":{"date-parts":[[2007,3,5]],"date-time":"2007-03-05T16:39:56Z","timestamp":1173112796000},"page":"321-336","source":"Crossref","is-referenced-by-count":7,"title":["Liveness in Rewriting"],"prefix":"10.1007","author":[{"given":"J\u00fcrgen","family":"Giesl","sequence":"first","affiliation":[]},{"given":"Hans","family":"Zantema","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,6,18]]},"reference":[{"key":"23_CR1","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0020-0190(85)90056-0","volume":"21","author":"B. Alpern","year":"1985","unstructured":"B. Alpern and F. B. Schneider. Defining liveness. Inf. Pr. Lett., 21:181\u2013185, 1985.","journal-title":"Inf. Pr. Lett."},{"key":"23_CR2","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/S0304-3975(99)00207-8","volume":"236","author":"T. Arts","year":"2000","unstructured":"T. Arts and J. Giesl. Termination of term rewriting using dependency pairs. Theoretical Computer Science, 236:133\u2013178, 2000.","journal-title":"Theoretical Computer Science"},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"F. Baader and T. Nipkow. Term Rewriting and All That. Cambr. Univ. Pr., 1998.","DOI":"10.1017\/CBO9781139172752"},{"key":"23_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1007\/3-540-48224-5_3","volume-title":"Proc. ICALP\u2019 01","author":"A. Bouajjani","year":"2001","unstructured":"A. Bouajjani. Languages, rewriting systems, and verification of infinite-state systems. In Proc. ICALP\u2019 01, volume 2076 of LNCS, pages 24\u201339, 2001."},{"key":"23_CR5","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/S0747-7171(87)80022-6","volume":"3","author":"N. Dershowitz","year":"1987","unstructured":"N. Dershowitz. Termination of rewriting. J. Symb. Comp., 3:69\u2013116, 1987.","journal-title":"J. Symb. Comp."},{"issue":"12","key":"23_CR6","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s002000100063","volume":"12","author":"J. Giesl","year":"2001","unstructured":"J. Giesl and T. Arts. Verification of Erlang processes by dependency pairs. Applicable Algebra in Engineering, Communication and Comp., 12(1,2):39\u201372, 2001.","journal-title":"Applicable Algebra in Engineering, Communication and Comp."},{"key":"23_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/3-540-48685-2_23","volume-title":"Proc. 10th RTA","author":"J. Giesl","year":"1999","unstructured":"J. Giesl and A. Middeldorp. Transforming context-sensitive rewrite systems. In Proc. 10th RTA, volume 1631 of Lecture Notes in Comp. Sc., pages 271\u2013285, 1999."},{"key":"23_CR8","unstructured":"J. Giesl and A. Middeldorp. Transformation techniques for context-sensitive rewrite systems. Journal of Functional Programming, 2003. To appear. Preliminary extended version in Technical Report AIB-2002-02, RWTH Aachen, Germany."},{"key":"23_CR9","series-title":"Technical Report","volume-title":"Liveness in rewriting","author":"J. Giesl","year":"2002","unstructured":"J. Giesl and H. Zantema. Liveness in rewriting. Technical Report AIB-2002-11, RWTH Aachen, Germany, 2002. http:\/\/aib.informatik.rwth-aachen.de ."},{"issue":"8","key":"23_CR10","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1145\/361082.361093","volume":"17","author":"L. Lamport","year":"1974","unstructured":"L. Lamport. A new solution to Dijkstra\u2019s concurrent programming problem. Communications of the ACM, 17(8):453\u2013455, 1974.","journal-title":"Communications of the ACM"},{"key":"23_CR11","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1006\/jsco.1994.1003","volume":"17","author":"H. Zantema","year":"1994","unstructured":"H. Zantema. Termination of term rewriting: Interpretation and type elimination. Journal of Symbolic Computation, 17:23\u201350, 1994.","journal-title":"Journal of Symbolic Computation"},{"key":"23_CR12","doi-asserted-by":"crossref","first-page":"89","DOI":"10.3233\/FI-1995-24124","volume":"24","author":"H. Zantema","year":"1995","unstructured":"H. Zantema. Termination of term rewriting by semantic labelling. Fundamenta Informaticae, 24:89\u2013105, 1995.","journal-title":"Fundamenta Informaticae"}],"container-title":["Lecture Notes in Computer Science","Rewriting Techniques and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44881-0_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,20]],"date-time":"2020-04-20T10:57:24Z","timestamp":1587380244000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44881-0_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540402541","9783540448815"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-44881-0_23","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}