{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:03:38Z","timestamp":1725516218742},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540705888"},{"type":"electronic","value":"9783540705901"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-70590-1_19","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T16:07:43Z","timestamp":1218557263000},"page":"276-290","source":"Crossref","is-referenced-by-count":8,"title":["Proving Quadratic Derivational Complexities Using Context Dependent Interpretations"],"prefix":"10.1007","author":[{"given":"Georg","family":"Moser","sequence":"first","affiliation":[]},{"given":"Andreas","family":"Schnabl","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/3-540-51081-8_107","volume-title":"Rewriting Techniques and Applications","author":"D. Hofbauer","year":"1989","unstructured":"Hofbauer, D., Lautemann, C.: Termination proofs and the length of derivations. In: Dershowitz, N. (ed.) RTA 1989. LNCS, vol.\u00a0355, pp. 167\u2013177. Springer, Heidelberg (1989)"},{"key":"19_CR2","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0304-3975(92)90289-R","volume":"105","author":"D. Hofbauer","year":"1992","unstructured":"Hofbauer, D.: Termination proofs by multiset path orderings imply primitive recursive derivation lengths. TCS\u00a0105, 129\u2013140 (1992)","journal-title":"TCS"},{"key":"19_CR3","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1016\/0304-3975(94)00135-6","volume":"139","author":"A. Weiermann","year":"1995","unstructured":"Weiermann, A.: Termination proofs for term rewriting systems with lexicographic path orderings imply multiply recursive derivation lengths. TCS\u00a0139, 355\u2013362 (1995)","journal-title":"TCS"},{"key":"19_CR4","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/11916277_6","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"G. Moser","year":"2006","unstructured":"Moser, G.: Derivational complexity of Knuth Bendix orders revisited. In: Hermann, M., Voronkov, A. (eds.) LPAR 2006. LNCS (LNAI), vol.\u00a04246, pp. 75\u201389. Springer, Heidelberg (2006)"},{"key":"19_CR5","first-page":"512","volume":"205","author":"A. Geser","year":"2007","unstructured":"Geser, A., Hofbauer, D., Waldmann, J., Zantema, H.: On tree automata that certify termination of left-linear term rewriting systems. IC\u00a0205, 512\u2013534 (2007)","journal-title":"IC"},{"key":"19_CR6","volume-title":"Proc. 4th IJCAR","author":"N. Hirokawa","year":"2008","unstructured":"Hirokawa, N., Moser, G.: Automated complexity analysis based on the dependency pair method. In: Proc. 4th IJCAR. Springer, Heidelberg (accepted for publication, 2008)"},{"key":"19_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/3-540-45127-7_10","volume-title":"Rewriting Techniques and Applications","author":"D. Hofbauer","year":"2001","unstructured":"Hofbauer, D.: Termination proofs by context-dependent interpretations. In: Middeldorp, A. (ed.) RTA 2001. LNCS, vol.\u00a02051, pp. 108\u2013121. Springer, Heidelberg (2001)"},{"key":"19_CR8","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139172752","volume-title":"Term Rewriting and All That","author":"F. Baader","year":"1998","unstructured":"Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)"},{"key":"19_CR9","series-title":"Cambridge Tracts in Theoretical Computer Science","volume-title":"Term Rewriting Systems","author":"Terese","year":"2003","unstructured":"Terese: Term Rewriting Systems. Cambridge Tracts in Theoretical Computer Science, vol.\u00a055. Cambridge University Press, Cambridge (2003)"},{"key":"19_CR10","unstructured":"Schnabl, A.: Context Dependent Interpretations. Master\u2019s thesis, Universit\u00e4t Innsbruck (2007), \n                  \n                    http:\/\/cl-informatik.uibk.ac.at\/~aschnabl\/"},{"key":"19_CR11","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/s10817-005-9022-x","volume":"34","author":"E. Contejean","year":"2005","unstructured":"Contejean, E., March\u00e9, C., Tom\u00e1s, A.P., Urbain, X.: Mechanically proving termination using polynomial interpretations. JAR\u00a034, 325\u2013363 (2005)","journal-title":"JAR"},{"key":"19_CR12","first-page":"354","volume":"11","author":"Y. Matiyasevich","year":"1970","unstructured":"Matiyasevich, Y.: Enumerable sets are diophantine. Soviet Mathematics (Dokladi)\u00a011, 354\u2013357 (1970)","journal-title":"Soviet Mathematics (Dokladi)"},{"key":"19_CR13","unstructured":"Steinbach, J., K\u00fchler, U.: Check your ordering - termination proofs and open problems. Technical Report SEKI-Report SR-90-25, University of Kaiserslautern (1990)"},{"key":"19_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1007\/978-3-540-72788-0_33","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2007","author":"C. Fuhs","year":"2007","unstructured":"Fuhs, C., Giesl, J., Middeldorp, A., Schneider-Kamp, P., Thiemann, R., Zankl, H.: SAT solving for termination analysis with polynomial interpretations. In: Marques-Silva, J., Sakallah, K.A. (eds.) SAT 2007. LNCS, vol.\u00a04501, pp. 340\u2013354. Springer, Heidelberg (2007)"},{"key":"19_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/978-3-540-73449-9_21","volume-title":"Term Rewriting and Applications","author":"M. Korp","year":"2007","unstructured":"Korp, M., Middeldorp, A.: Proving termination of rewrite systems using bounds. In: Baader, F. (ed.) RTA 2007. LNCS, vol.\u00a04533, pp. 273\u2013287. Springer, Heidelberg (2007)"},{"key":"19_CR16","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/j.tcs.2004.04.009","volume":"327","author":"D. Hofbauer","year":"2004","unstructured":"Hofbauer, D., Waldmann, J.: Deleting string rewriting systems preserve regularity. TCS\u00a0327, 301\u2013317 (2004)","journal-title":"TCS"},{"key":"19_CR17","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1017\/S0956796800003877","volume":"11","author":"G. Bonfante","year":"2001","unstructured":"Bonfante, G., Cichon, A., Marion, J.Y., Touzet, H.: Algorithms with polynomial interpretation termination proof. JFP\u00a011, 33\u201353 (2001)","journal-title":"JFP"},{"key":"19_CR18","first-page":"2","volume":"183","author":"J.Y. Marion","year":"2003","unstructured":"Marion, J.Y.: Analysing the implicit complexity of programs. IC\u00a0183, 2\u201318 (2003)","journal-title":"IC"},{"key":"19_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1007\/978-3-540-32033-3_12","volume-title":"Term Rewriting and Applications","author":"G. Bonfante","year":"2005","unstructured":"Bonfante, G., Marion, J.Y., Moyen, J.Y.: Quasi-intepretations and small space bounds. In: Giesl, J. (ed.) RTA 2005. LNCS, vol.\u00a03467, pp. 150\u2013164. Springer, Heidelberg (2005)"},{"key":"19_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/11737414_12","volume-title":"Functional and Logic Programming","author":"J.Y. Marion","year":"2006","unstructured":"Marion, J.Y., P\u00e9choux, R.: Resource analysis by sup-interpretation. In: Hagiya, M., Wadler, P. (eds.) FLOPS 2006. LNCS, vol.\u00a03945, pp. 163\u2013176. Springer, Heidelberg (2006)"},{"key":"19_CR21","doi-asserted-by":"crossref","unstructured":"Avanzini, M., Moser, G.: Complexity analysis by rewriting. In: Proc.9th FLOPS. LNCS, vol.\u00a04989, pp. 130\u2013146 (2008)","DOI":"10.1007\/978-3-540-78969-7_11"},{"volume-title":"Quantifier Elimination and Cylindrical Algebraic Decomposition","year":"2004","key":"19_CR22","unstructured":"Caviness, B., Johnson, J. (eds.): Quantifier Elimination and Cylindrical Algebraic Decomposition. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Rewriting Techniques and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70590-1_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T04:23:52Z","timestamp":1620015832000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70590-1_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540705888","9783540705901"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70590-1_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}