{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:17:30Z","timestamp":1725484650561},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540425540"},{"type":"electronic","value":"9783540448020"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44802-0_34","type":"book-chapter","created":{"date-parts":[[2007,6,1]],"date-time":"2007-06-01T04:15:38Z","timestamp":1180671338000},"page":"484-498","source":"Crossref","is-referenced-by-count":11,"title":["Well-Founded Recursive Relations"],"prefix":"10.1007","author":[{"given":"Jean","family":"Goubault-Larrecq","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,8,30]]},"reference":[{"key":"34_CR1","unstructured":"B. Barras, S. Boutin, C. Cornes, J. Courant, Y. Coscoy, D. Delahaye, D. de Rauglaudre, J.-C. Filli\u00e2tre, E. Gim\u00e9nez, H. Herbelin, G. Huet, H. Laulh\u00e8re, C. Mu\u00f1oz, C. Murthy, C. Parent-Vigouroux, P. Loiseleur, C. Paulin-Mohring, A. Sa\u00efbi, and B. Werner. The Coq proof assistant-reference manual. Available at http:\/\/coq.inria.fr\/doc\/main.html ., Dec. 1999. Version 6.3.1."},{"key":"34_CR2","first-page":"303","volume-title":"Program Flow Analysis: Theory and Applications","author":"P. Cousot","year":"1981","unstructured":"P. Cousot. Semantic foundations of program analysis. In S. Muchnick and N. Jones, editors, Program Flow Analysis: Theory and Applications, chapter 10, pages 303\u2013342. Prentice-Hall, Inc., Englewood Cliffs, New Jersey, 1981."},{"issue":"3","key":"34_CR3","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/0304-3975(82)90026-3","volume":"17","author":"N. Dershowitz","year":"1982","unstructured":"N. Dershowitz. Orderings for term rewriting systems. Theoretical Computer Science, 17(3):279\u2013301, 1982.","journal-title":"Theoretical Computer Science"},{"key":"34_CR4","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. Journal of Symbolic Computation, 3:69\u2013116, 1987.","journal-title":"Journal of Symbolic Computation"},{"key":"34_CR5","series-title":"Lect Notes Comput Sci","first-page":"198","volume-title":"5th RTA","author":"N. Dershowitz","year":"1983","unstructured":"N. Dershowitz and C. Hoot. Topics in termination. In C. Kirchner, editor, 5th RTA, pages 198\u2013212. Springer Verlag LNCS 690, 1983."},{"key":"34_CR6","doi-asserted-by":"crossref","unstructured":"G. Dowek and B. Werner. Proof normalization modulo. Research Report RR-3542, INRIA, Nov. 1998.","DOI":"10.1007\/3-540-48167-2_5"},{"key":"34_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"906","DOI":"10.1007\/BFb0014432","volume-title":"Recent Trends in Data Type Specification","author":"M. Fern\u00e1ndez","year":"1995","unstructured":"M. Fern\u00e1ndez and J.-P. Jouannaud. Modular termination of term rewriting systems revisited. In E. Astesiano, G. Reggio, and A. Tarlecki, editors, Recent Trends in Data Type Specification. Springer-Verlag LNCS 906, 906."},{"key":"34_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1007\/3-540-60381-6_7","volume-title":"4th International Workshop on Conditional Term Rewriting Systems (CTRS\u201994)","author":"M. C. F. Ferreira","year":"1995","unstructured":"M. C. F. Ferreira and H. Zantema. Well-foundedness of term orderings. In N. Dershowitz, editor, 4th International Workshop on Conditional Term Rewriting Systems (CTRS\u201994), pages 106\u2013123. Springer Verlag LNCS 968, 1995."},{"key":"34_CR9","doi-asserted-by":"crossref","unstructured":"F. G\u00e9cseg and M. Steinby. Tree languages. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, volume 3, chapter 1, pages 1\u201368. Springer-Verlag, 1997. Beyond Words.","DOI":"10.1007\/978-3-642-59126-6_1"},{"key":"34_CR10","unstructured":"J.-Y. Girard, Y. Lafont, and P. Taylor. Proofs and Types, volume 7 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1989."},{"key":"34_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"977","DOI":"10.1007\/3-540-45591-4_134","volume-title":"FMPPTA\u20192000","author":"J. Goubault-Larrecq","year":"2000","unstructured":"J. Goubault-Larrecq. A method for automatic cryptographic protocol verification (extended abstract). In FMPPTA\u20192000, pages 977\u2013984. Springer Verlag LNCS 1800, 2000."},{"key":"34_CR12","unstructured":"H. Herbelin, Dec. 1996. Private communication."},{"key":"34_CR13","doi-asserted-by":"crossref","unstructured":"J.-P. Jouannaud and A. Rubio. The higher-order recursive path ordering. In G. Longo, editor, 14th LICS, pages 402\u2013411, Trento, Italy, July 1999.","DOI":"10.1109\/LICS.1999.782635"},{"key":"34_CR14","unstructured":"J.-P. Jouannaud and A. Rubio. Higher-order recursive path orderings \u00e1 la carte. Draft available at ftp:\/\/ftp.lri.fr\/LRI\/articles\/jouannaud\/horpo-full.ps.gz , 2001."},{"key":"34_CR15","unstructured":"S. Kamin and J.-J. L\u00e9vy. Two generalizations of the recursive path ordering. Technical report, University of Illinois, 1980."},{"key":"34_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"518","DOI":"10.1007\/BFb0055080","volume-title":"25th ICALP","author":"P.-A. Melli\u00e8s","year":"1998","unstructured":"P.-A. Melli\u00e8s. On a duality between Kruskal and Dershowitz theorems. In 25th ICALP, pages 518\u2013529. Springer Verlag LNCS 1443, 1998."},{"key":"34_CR17","series-title":"Lect Notes Comput Sci","volume-title":"6th International Static Analysis Symposium (SAS\u201999)","author":"D. Monniaux","year":"1999","unstructured":"D. Monniaux. Abstracting cryptographic protocols with tree automata. In 6th International Static Analysis Symposium (SAS\u201999). Springer-Verlag LNCS 1694, 1999."},{"key":"34_CR18","unstructured":"C. Thomassen. Embeddings and minors. In R. Graham, M. Gr\u00f6tschel, and L. Lov\u00e1sz, editors, Handbook of Combinatorics, chapter 5. Elsevier Science B.V., 1995."}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44802-0_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T15:21:18Z","timestamp":1556464878000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44802-0_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540425540","9783540448020"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-44802-0_34","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}