{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:20:05Z","timestamp":1725664805426},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540614647"},{"type":"electronic","value":"9783540685968"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61464-8_69","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:40:07Z","timestamp":1330292407000},"page":"412-415","source":"Crossref","is-referenced-by-count":3,"title":["ReDuX 1.5: New facets of rewriting"],"prefix":"10.1007","author":[{"given":"Reinhard","family":"B\u00fcndgen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carsten","family":"Sinz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jochen","family":"Walter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"32_CR1","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/0167-6423(87)90030-X","volume":"9","author":"A. Cherifa Ben","year":"1987","unstructured":"Ahlem Ben Cherifa and Pierre Lescanne. Termination of rewriting systems by polynomial interpretations and its implementation. Science of Computer Programming, 9:137\u2013159, 1987.","journal-title":"Science of Computer Programming"},{"key":"32_CR2","unstructured":"Leo Bachmair, Nachum Dershowitz, and David A. Plaisted. Completion without failure. In H. A\u00eft-Kaci and M. Nivat, editors, Resolution of Equations in Algebraic Structures, volume 2 of Rewriting Techniques, chapter 1. Academic Press, 1989."},{"key":"32_CR3","unstructured":"Reinhard B\u00fcndgen, Wolfgang K\u00fcchlin, and Werner Lauterbach. Verification of the Sparrow processor. In IEEE Symposium and Workshop on Engineering of Computer-Based Systems. IEEE Press, 1996."},{"key":"32_CR4","doi-asserted-by":"crossref","unstructured":"Reinhard B\u00fcndgen and Werner Lauterbach. Experiments with partial evaluation domains for rewrite specifications. In 11th Workshop on Abstract Data Types, 1996. (Proc. WADT'95, Oslo, N, September 1995, to appear).","DOI":"10.1007\/3-540-61629-2_40"},{"key":"32_CR5","unstructured":"University of California, Berkeley, CA. Berkeley Logic Interchange Format (BLIF), July 1992."},{"key":"32_CR6","doi-asserted-by":"crossref","unstructured":"Reinhard B\u00fcndgen. Reduce the redex \u2192 ReDuX. In Claude Kirchner, editor, Rewriting Techniques and Applications (LNCS 690). Springer-Verlag, 1993.","DOI":"10.1007\/3-540-56868-9_35"},{"key":"32_CR7","doi-asserted-by":"crossref","unstructured":"Reinhard B\u00fcndgen. On pots, pans and pudding or how to discover generalized critical pairs. In Alan Bundy, editor, 12th International Conference on Automated Deduction, (LNCS 814). Springer-Verlag, 1994.","DOI":"10.1007\/3-540-58156-1_50"},{"key":"32_CR8","doi-asserted-by":"crossref","unstructured":"Reinhard B\u00fcndgen. Combining computer algebra and rule based reasoning. In Integrating Symbolic Mathematical Computation and Artificial Intelligence. Springer-Verlag, 1995.","DOI":"10.1007\/3-540-60156-2_15"},{"key":"32_CR9","doi-asserted-by":"crossref","unstructured":"Reinhard B\u00fcndgen. Preserving confluence for rewrite systems with built-in operations. In Nachum Dershowitz and Naomi Lindenstrauss, editors, Conditional and Typed Rewriting Systems (LNCS 968). Springer-Verlag, 1995.","DOI":"10.1007\/3-540-60381-6_5"},{"key":"32_CR10","volume-title":"Technical Report 90-4","author":"G. E. Collins","year":"1990","unstructured":"George E. Collins and R\u00fcdiger G. K. Loos. Specification and index of SAC-2 algorithms. Technical Report 90-4, Wilhelm-Schickard-Institut f\u00fcr Informatik, T\u00fcbingen, 1990."},{"key":"32_CR11","volume-title":"Technical Report 86-01","author":"W. K\u00fcchlin","year":"1986","unstructured":"Wolfgang K\u00fcchlin. A generalized Knuth-Bendix algorithm. Technical Report 86-01, Mathematics, Swiss Federal Institute of Technology (ETH), CH-8092 Z\u00fcrich, Switzerland, January 1986."}],"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-61464-8_69.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:06:35Z","timestamp":1605647195000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61464-8_69"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540614647","9783540685968"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-61464-8_69","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}