{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T18:57:22Z","timestamp":1794337042638,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540115762","type":"print"},{"value":"9783540393085","type":"electronic"}],"license":[{"start":{"date-parts":[[1982,1,1]],"date-time":"1982-01-01T00:00:00Z","timestamp":378691200000},"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":[[1982]]},"DOI":"10.1007\/bfb0012778","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T08:00:52Z","timestamp":1132732852000},"page":"300-312","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Derived Pairs, overlap closures, and rewrite dominoes: New tools for analyzing term rewriting systems"],"prefix":"10.1007","author":[{"given":"John V.","family":"Guttag","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Deepak","family":"Kapur","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David R.","family":"Musser","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,10,22]]},"reference":[{"key":"27_CR1","volume-title":"LNCS 115","author":"N. Dershowitz","year":"1981","unstructured":"N. Dershowitz, \u201cTermination of Linear Rewriting Systems \u2014 Preliminary Version,\u201d in Automata, Languages, and Programming, Eighth Colloquium, Israel (Eds: S. Even and O. Kariv), LNCS 115, Springer Verlag, New York, 1981."},{"key":"27_CR2","unstructured":"J.A. Goguen and J. Tardo, \u201cAn Introduction to OBJ-T.\u201dProc. of Conf. on Specification of Reliable Software (1979)."},{"key":"27_CR3","first-page":"1048","volume":"21","author":"J.V. Guttag","year":"1978","unstructured":"J.V. Guttag, E. Horowitz, and D.R. Musser, \u201cAbstract Data Types and Software Validation,\u201d Comm. A.C.M. 21 (1978), 1048\u20131064.","journal-title":"Comm. A.C.M."},{"key":"27_CR4","volume-title":"Report No. 81CRD272","author":"J.V. Guttag","year":"1981","unstructured":"J.V. Guttag, D. Kapur, and D.R. Musser, On Proving Uniform Termination and Restricted Termination of Rewriting Systems, Report No. 81CRD272, G.E. C. Research and Development, Schenectady, New York, Nov. 1981."},{"key":"27_CR5","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1145\/322217.322230","volume":"27","author":"G. Huet","year":"1980","unstructured":"G. Huet, \u201cConfluent Reductions: Abstract Properties and Applications to Term Rewriting Systems,\u201d J. ACM 27 (1980), 797\u2013821.","journal-title":"J. ACM"},{"key":"27_CR6","unstructured":"G. Huet, D.S. Lankford, \u201cOn the Uniform Halting Problem for Term Rewriting Systems,\u201d Rapport Laboria 283, IRIA, March, 1978."},{"key":"27_CR7","unstructured":"G. Huet, D.C. Oppen, \u201cEquations and Rewrite Rules: a Survey,\u201d Formal Languages Perspectives and Open Problems (R. Book, ed.), Academic Press (1980)."},{"key":"27_CR8","doi-asserted-by":"crossref","unstructured":"D.E. Knuth, P. Bendix, \u201cSimple Word Problems in Universal Algebra.\u201d Computational Problems in Abstract Algebra (J. Leech, ed.), Pergamon Press (1970), 263\u2013297.","DOI":"10.1016\/B978-0-08-012975-4.50028-X"},{"key":"27_CR9","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1109\/TSE.1980.230459","volume":"6","author":"D. Musser","year":"1980","unstructured":"D. Musser, \u201cAbstract Data Type Specification in the AFFIRM system.\u201d IEEE Transactions on Software Engineering 6 (1980), 24\u201331.","journal-title":"IEEE Transactions on Software Engineering"},{"key":"27_CR10","volume-title":"Tech. Report","author":"G.E. Peterson","year":"1977","unstructured":"G.E. Peterson and M.E. Stickel, Complete Sets of Reductions for Equational Theories With Complete Unification Algorithms, Tech. Report, Dept. of Computer Science, U. of Arizona, Tucson, Sept. 1977."},{"key":"27_CR11","volume-title":"LNCS115","author":"A. Pettorossi","year":"1981","unstructured":"A. Pettorossi, \u201cComparing and Putting Together Recursive Path Ordering, Simplification Orderings, And Non-Ascending Property for Termination Proofs of Term Rewriting Systems,\u201d in Automata, Language, and Programming, Eighth Coll., Israel (Eds: S. Even and O. Kariv), LNCS115, Springer Verlag, New York, 1981."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0012778","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T08:57:41Z","timestamp":1558256261000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0012778"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982]]},"ISBN":["9783540115762","9783540393085"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/bfb0012778","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/bfb0012751","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1982]]},"assertion":[{"value":"22 October 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}