{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:51:47Z","timestamp":1725544307504},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540334385"},{"type":"electronic","value":"9783540334392"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11737414_12","type":"book-chapter","created":{"date-parts":[[2006,3,15]],"date-time":"2006-03-15T11:54:37Z","timestamp":1142423677000},"page":"163-176","source":"Crossref","is-referenced-by-count":13,"title":["Resource Analysis by Sup-interpretation"],"prefix":"10.1007","author":[{"given":"Jean-Yves","family":"Marion","sequence":"first","affiliation":[]},{"given":"Romain","family":"P\u00e9choux","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/3-540-44904-3_3","volume-title":"Typed Lambda Calculi and Applications","author":"R. Amadio","year":"2003","unstructured":"Amadio, R.: Max-plus quasi-interpretations. In: Hofmann, M.O. (ed.) TLCA 2003. LNCS, vol.\u00a02701, pp. 31\u201345. Springer, Heidelberg (2003)"},{"key":"12_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/978-3-540-30124-0_22","volume-title":"Computer Science Logic","author":"R. Amadio","year":"2004","unstructured":"Amadio, R., Coupet-Grimal, S., Dal-Zilio, S., Jakubiec, L.: A functional scenario for bytecode verification of resource bounds. In: Marcinkowski, J., Tarlecki, A. (eds.) CSL 2004. LNCS, vol.\u00a03210, pp. 265\u2013279. Springer, Heidelberg (2004)"},{"unstructured":"Amadio, R., Zilio, S.D.: Resource control for synchronous cooperative threads. Research Report LIF","key":"12_CR3"},{"key":"12_CR4","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/S0304-3975(99)00207-8","volume":"236","author":"T. Arts","year":"2000","unstructured":"Arts, T., Giesl, J.: Termination of term rewriting using dependency pairs. Theoretical Computer Science\u00a0236, 133\u2013178 (2000)","journal-title":"Theoretical Computer Science"},{"key":"12_CR5","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1023\/B:JARS.0000021014.79255.33","volume":"31","author":"D. Aspinall","year":"2003","unstructured":"Aspinall, D., Compagnoni, A.: Heap bounded assembly language. Journal of Automated Reasoning (Special Issue on Proof-Carrying Code)\u00a031, 261\u2013302 (2003)","journal-title":"Journal of Automated Reasoning (Special Issue on Proof-Carrying Code)"},{"issue":"1-2","key":"12_CR6","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.tcs.2003.10.022","volume":"318","author":"R. Benzinger","year":"2004","unstructured":"Benzinger, R.: Automated higher-order complexity analysis. Theoretical Computer Science\u00a0318(1-2), 79\u2013103 (2004)","journal-title":"Theoretical Computer Science"},{"key":"12_CR7","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1145\/321386.321395","volume":"14","author":"M. Blum","year":"1967","unstructured":"Blum, M.: A machine-independent theory of the complexity of recursive functions. Journal of the Association for Computing Machinery\u00a014, 322\u2013336 (1967)","journal-title":"Journal of the Association for Computing Machinery"},{"issue":"1","key":"12_CR8","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. Journal of Functional Programming\u00a011(1), 33\u201353 (2001)","journal-title":"Journal of Functional Programming"},{"unstructured":"Bonfante, G., Moyen, J.-Y., Marion, J.-Y., P\u00e9choux, R.: Synthesis of quasiinterpretations. In: Workshop on Logic and Complexity in Computer Science, LCC 2005, Chicago (2005), \n                      \n                        http:\/\/www.loria\/~pechoux","key":"12_CR9"},{"key":"12_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1007\/3-540-45575-2_46","volume-title":"Perspectives of System Informatics","author":"G. Bonfante","year":"2001","unstructured":"Bonfante, G., Marion, J.-Y., Moyen, J.-Y.: On lexicographic termination ordering with space bound certifications. In: Bj\u00f8rner, D., Broy, M., Zamulin, A.V. (eds.) PSI 2001. LNCS, vol.\u00a02244, p. 482. Springer, Heidelberg (2001)"},{"unstructured":"Bonfante, G., Marion, J.-Y., Moyen, J.-Y.: Quasi-interpretation a way to control resources. Submitted to Theoretical Computer Science (2005), \n                      \n                        http:\/\/www.loria.fr\/~moyen\/appsemTCS.ps","key":"12_CR11"},{"issue":"5","key":"12_CR12","doi-asserted-by":"publisher","first-page":"826","DOI":"10.1145\/161468.161472","volume":"15","author":"S.K. Debray","year":"1993","unstructured":"Debray, S.K., Lin, N.W.: Cost analysis of logic programs. ACM Transactions on Programming Languages and Systems\u00a015(5), 826\u2013875 (1993)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"doi-asserted-by":"crossref","unstructured":"Dershowitz, N.: Termination of rewriting. Journal of Symbolic Computation, 69\u2013115 (1987)","key":"12_CR13","DOI":"10.1016\/S0747-7171(87)80022-6"},{"key":"12_CR14","volume-title":"36th Hawai\u2019i International Conference on System Sciences (HICSS 36)","author":"S.G. Frankau","year":"2003","unstructured":"Frankau, S.G., Mycroft, A.: Stream processing hardware from functional language specifications. In: Hofmann, M. (ed.) 36th Hawai\u2019i International Conference on System Sciences (HICSS 36). IEEE, Los Alamitos (2003)"},{"doi-asserted-by":"crossref","unstructured":"Hofmann, M.: Linear types and non-size-increasing polynomial time computation. In: Proceedings of the Fourteenth IEEE Symposium on Logic in Computer Science (LICS 1999), pp. 464\u2013473 (1999)","key":"12_CR15","DOI":"10.1109\/LICS.1999.782641"},{"key":"12_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/3-540-46425-5_11","volume-title":"Programming Languages and Systems","author":"M. Hofmann","year":"2000","unstructured":"Hofmann, M.: A type system for bounded space and functional in-place update. In: Smolka, G. (ed.) ESOP 2000. LNCS, vol.\u00a01782, pp. 165\u2013179. Springer, Heidelberg (2000)"},{"key":"12_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/978-3-540-40018-9_9","volume-title":"Programming Languages and Systems","author":"A. Hugh","year":"2003","unstructured":"Hugh, A., Khoo, S.C.: Affined-based size-change termination. In: Ohori, A. (ed.) APLAS 2003. LNCS, vol.\u00a02895, pp. 122\u2013140. Springer, Heidelberg (2003)"},{"unstructured":"Lankford, D.S.: On proving term rewriting systems are noetherien. Technical report (1979)","key":"12_CR18"},{"key":"12_CR19","first-page":"81","volume-title":"Symposium on Principles of Programming Languages","author":"C.S. Lee","year":"2001","unstructured":"Lee, C.S., Jones, N.D., Ben-Amram, A.M.: The size-change principle for program termination. In: Symposium on Principles of Programming Languages, vol.\u00a028, pp. 81\u201392. ACM Press, New York (2001)"},{"issue":"3","key":"12_CR20","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1051\/ita:2005029","volume":"39","author":"S. Lucas","year":"2005","unstructured":"Lucas, S.: Polynomials over the reals in proofs of termination: from theory to practice. RAIRO Theoretical Informatics and Applications\u00a039(3), 547\u2013586 (2005)","journal-title":"RAIRO Theoretical Informatics and Applications"},{"key":"12_CR21","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/3-540-44404-1_3","volume-title":"Logic for Programming and Automated Reasoning","author":"J.-Y. Marion","year":"2000","unstructured":"Marion, J.-Y., Moyen, J.-Y.: Efficient first order functional program interpreter with time bound certifications. In: Parigot, M., Voronkov, A. (eds.) LPAR 2000. LNCS (LNAI), vol.\u00a01955, pp. 25\u201342. Springer, Heidelberg (2000)"},{"unstructured":"Regehr, J.: Say no to stack overflow (2004), \n                      \n                        http:\/\/www.embedded.com","key":"12_CR22"},{"key":"12_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44881-0_19","volume-title":"Rewriting Techniques and Applications","author":"R. Thiemann","year":"2003","unstructured":"Thiemann, R., Giesl, J.: Size-change termination for term rewriting. In: Nieuwenhuis, R. (ed.) RTA 2003. LNCS, vol.\u00a02706, Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Computer Science","Functional and Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11737414_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,12]],"date-time":"2019-03-12T03:54:14Z","timestamp":1552362854000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11737414_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540334385","9783540334392"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/11737414_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}