{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T13:09:22Z","timestamp":1742389762899},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540665366"},{"type":"electronic","value":"9783540481683"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48168-0_8","type":"book-chapter","created":{"date-parts":[[2007,12,1]],"date-time":"2007-12-01T06:30:26Z","timestamp":1196490626000},"page":"96-110","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Applying Rewriting Techniques to the Verification of Erlang Processes"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Arts","sequence":"first","affiliation":[]},{"given":"J\u00fcrgen","family":"Giesl","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,5,13]]},"reference":[{"key":"8_CR1","volume-title":"Proc. FM\u2019 99","author":"T. Arts","year":"1999","unstructured":"T. Arts & M. Dam, Verifying a distributed database lookup manager written in Erlang. In Proc. FM\u2019 99, Toulouse, France, 1999."},{"key":"8_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/BFb0030602","volume-title":"TAPSOFT\u2019 97","author":"T. Arts","year":"1997","unstructured":"T. Arts & J. Giesl, Automatically proving termination where simplification orderings fail. TAPSOFT\u2019 97, LNCS 1214, pp. 261\u2013273, Lille, France, 1997."},{"key":"8_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/3-540-62950-5_68","volume-title":"Proc. RTA-97","author":"T. Arts","year":"1997","unstructured":"T. Arts & J. Giesl, Proving innermost normalisation automatically. In Proc. RTA-97, LNCS 1232, pp. 157\u2013172, Sitges, Spain, 1997."},{"key":"8_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1007\/BFb0052373","volume-title":"Proc. RTA-98","author":"T. Arts","year":"1998","unstructured":"T. Arts & J. Giesl, Modularity of termination using dependency pairs. In Proc. RTA-98, LNCS 1232, pp. 226\u2013240, Tsukuba, Japan, 1998."},{"key":"8_CR5","unstructured":"T. Arts & J. Giesl, Termination of term rewriting using dependency pairs. TCS. To appear. Preliminary version under \nhttp:\/\/www.inferenzsysteme.informatik.tu-darmstadt.de\/~reports\/notes\/ibn-\n\n97\u201346.ps"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"F. Baader & T. Nipkow, Term Rewriting and All That. Cambridge University Press, 1998.","DOI":"10.1017\/CBO9781139172752"},{"key":"8_CR7","first-page":"323","volume":"32","author":"J. A. Bergstra","year":"1986","unstructured":"J. A. Bergstra & J. W. Klop, Conditional rewrite rules: confluence and termination. JCSS, 32:323\u2013362, 1986.","journal-title":"JCSS"},{"key":"8_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/3-540-51081-8_99","volume-title":"Proc. RTA-89","author":"H. Bertling","year":"1989","unstructured":"H. Bertling & H. Ganzinger, Completion-time optimization of rewrite-time goal solving. Proc. RTA-89, LNCS 355, pp. 45\u201358, Chapel Hill, USA, 1989."},{"key":"8_CR9","first-page":"21","volume":"11","author":"N. Dershowitz","year":"1987","unstructured":"N. Dershowitz & D. A. Plaisted, Equational programming. Machine Intelligence, 11:21\u201356, Oxford University Press, 1987.","journal-title":"Machine Intelligence"},{"key":"8_CR10","first-page":"69","volume":"3","author":"N. Dershowitz","year":"1987","unstructured":"N. Dershowitz, Termination of rewriting. JSC, 3:69\u2013116, 1987.","journal-title":"JSC"},{"key":"8_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1007\/BFb0012855","volume-title":"Proc. CADE-9","author":"N. Dershowitz","year":"1988","unstructured":"N. Dershowitz, M. Okada, & G. Sivakumar, Canonical conditional rewrite systems. In Proc. CADE-9, LNCS 310, pp. 538\u2013549, Argonne, USA, 1988."},{"key":"8_CR12","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/0304-3975(90)90064-O","volume":"75","author":"N. Dershowitz","year":"1990","unstructured":"N. Dershowitz & M. Okada, A rationale for conditional equational programming. TCS, 75:111\u2013138, 1990.","journal-title":"TCS"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"N. Dershowitz & J.-P. Jouannaud, Rewrite Systems. In Handbook of Theoretical Computer Science, Vol. B, pp. 243\u2013320, Elsevier, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"issue":"2","key":"8_CR14","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/0304-3975(94)00275-4","volume":"142","author":"N. Dershowitz","year":"1995","unstructured":"N. Dershowitz & C. Hoot, Natural termination. TCS, 142(2):179\u2013207, 1995.","journal-title":"TCS"},{"key":"8_CR15","first-page":"161","volume-title":"Proc. 4th Workshop on Automated Deduction","author":"M. J. Fay","year":"1979","unstructured":"M. J. Fay, First-order unification in an equational theory. Proc. 4th Workshop on Automated Deduction, pp. 161\u2013167, Austin, TX, Academic Press, 1979."},{"key":"8_CR16","series-title":"Lect Notes Comput Sci","first-page":"91","volume-title":"Proc. CTRS\u2019 87","author":"E. Giovanetti","year":"1987","unstructured":"E. Giovanetti & C. Moiso, Notes on the eliminations of conditions. In Proc. CTRS\u2019 87, LNCS 308, pp. 91\u201397, Orsay, France, 1987."},{"key":"8_CR17","series-title":"Lect Notes Comput Sci","first-page":"166","volume-title":"Proc. CTRS\u2019 94","author":"B. Gramlich","year":"1994","unstructured":"B. Gramlich, On termination and confluence of conditional rewrite systems. In Proc. CTRS\u2019 94, LNCS 968, pp. 166\u2013185, Jerusalem, Israel, 1994."},{"key":"8_CR18","doi-asserted-by":"publisher","first-page":"3","DOI":"10.3233\/FI-1995-24121","volume":"24","author":"B. Gramlich","year":"1995","unstructured":"B. Gramlich, Abstract relations between restricted termination and confluence properties of rewrite systems. Fundamenta Informaticae, 24:3\u201323, 1995.","journal-title":"Fundamenta Informaticae"},{"key":"8_CR19","series-title":"PhD Thesis","volume-title":"Termination and confluence properties of structured rewrite systems","author":"B. Gramlich","year":"1996","unstructured":"B. Gramlich, Termination and confluence properties of structured rewrite systems. PhD Thesis, Universit\u00e4t Kaiserslautern, Germany, 1996."},{"key":"8_CR20","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0304-3975(96)00042-4","volume":"165","author":"B. Gramlich","year":"1996","unstructured":"B. Gramlich, On termination and confluence properties of disjoint and constructor-sharing conditional rewrite systems. TCS, 165:97\u2013131, 1996.","journal-title":"TCS"},{"issue":"20","key":"8_CR21","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1016\/0743-1066(94)90034-5","volume":"19","author":"M. Hanus","year":"1994","unstructured":"M. Hanus, The integration of functions into logic programming: From theory to practice. Journal of Logic Programming, 19,20:583\u2013628, 1994.","journal-title":"Journal of Logic Programming"},{"key":"8_CR22","unstructured":"Patent pending, Ericsson Telecom AB, 1999."},{"key":"8_CR23","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/0304-3975(84)90087-2","volume":"33","author":"S. Kaplan","year":"1984","unstructured":"S. Kaplan, Conditional rewrite rules. TCS, 33:175\u2013193, 1984.","journal-title":"TCS"},{"key":"8_CR24","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/3-540-61735-3_7","volume-title":"Proc. ALP\u2019 96","author":"M. Marchiori","year":"1996","unstructured":"M. Marchiori, Unravelings and Ultra-properties, Proc. ALP\u2019 96, LNCS 1139, pp. 107\u2013121, Aachen, Germany, 1996."},{"key":"8_CR25","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1006\/inco.1993.1027","volume":"104","author":"A. Middeldorp","year":"1993","unstructured":"A. Middeldorp, Modular properties of conditional term rewriting systems. Information and Computation, 104:110\u2013158, 1993.","journal-title":"Information and Computation"},{"key":"8_CR26","doi-asserted-by":"publisher","first-page":"47","DOI":"10.3233\/FI-1995-24123","volume":"24","author":"J. Steinbach","year":"1995","unstructured":"J. Steinbach, Simplification orderings: history of results. Fundamenta Informaticae, 24:47\u201387, 1995.","journal-title":"Fundamenta Informaticae"},{"key":"8_CR27","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/3-540-59200-8_56","volume-title":"Proc. RTA-95","author":"T. Suzuki","year":"1995","unstructured":"T. Suzuki, A. Middeldorp, & T. Ida, Level-confluence of conditional rewrite systems with extra variables in right-hand sides. Proc. RTA-95, LNCS 914, pp. 179\u2013193, Kaiserslautern, Germany, 1995."},{"key":"8_CR28","first-page":"51","volume":"17","author":"C.-P. Wirth","year":"1994","unstructured":"C.-P. Wirth & B. Gramlich, A constructor-based approach for positive\/negative conditional equational specifications. JSC, 17:51\u201390, 1994.","journal-title":"JSC"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48168-0_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,6]],"date-time":"2020-04-06T00:10:23Z","timestamp":1586131823000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48168-0_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540665366","9783540481683"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/3-540-48168-0_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"13 May 2003","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}