{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T00:51:24Z","timestamp":1775868684269,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540691631","type":"print"},{"value":"9783540691662","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-69166-2_15","type":"book-chapter","created":{"date-parts":[[2008,7,13]],"date-time":"2008-07-13T09:25:03Z","timestamp":1215941103000},"page":"221-237","source":"Crossref","is-referenced-by-count":67,"title":["Automatic Inference of Upper Bounds for Recurrence Relations in Cost Analysis"],"prefix":"10.1007","author":[{"given":"Elvira","family":"Albert","sequence":"first","affiliation":[]},{"given":"Puri","family":"Arenas","sequence":"additional","affiliation":[]},{"given":"Samir","family":"Genaim","sequence":"additional","affiliation":[]},{"given":"Germ\u00e1n","family":"Puebla","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/3-540-09526-8_16","volume-title":"Mathematical Foundations of Computer Science 1979","author":"A. Adachi","year":"1979","unstructured":"Adachi, A., Kasai, T., Moriya, E.: A theoretical study of the time analysis of programs. In: Becvar, J. (ed.) MFCS 1979. LNCS, vol.\u00a074, pp. 201\u2013207. Springer, Heidelberg (1979)"},{"key":"15_CR2","series-title":"Lecture Notes in Computer Science","volume-title":"Proc.\u00a0of FMOODS","author":"E. Albert","year":"2008","unstructured":"Albert, E., Arenas, P., Codish, M., Genaim, S., Puebla, G., Zanardini, D.: Termination Analysis of Java Bytecode. In: Proc.\u00a0of FMOODS. LNCS, Springer, Heidelberg (to appear, 2008)"},{"key":"15_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71316-6_12","volume-title":"Programming Languages and Systems","author":"E. Albert","year":"2007","unstructured":"Albert, E., Arenas, P., Genaim, S., Puebla, G., Zanardini, D.: Cost analysis of java bytecode. In: De Nicola, R. (ed.) ESOP 2007. LNCS, vol.\u00a04421, Springer, Heidelberg (2007)"},{"key":"15_CR4","series-title":"Lecture Notes in Computer Science","volume-title":"Construction and Analysis of Safe, Secure, and Interoperable Smart Devices","author":"D. Aspinall","year":"2005","unstructured":"Aspinall, D., Gilmore, S., Hofmann, M., Sannella, D., Stark, I.: Mobile Resource Guarantees for Smart Devices. In: Barthe, G., Burdy, L., Huisman, M., Lanet, J.-L., Muntean, T. (eds.) CASSIS 2004. LNCS, vol.\u00a03362, Springer, Heidelberg (2005)"},{"key":"15_CR5","unstructured":"Bagnara, R., Pescetti, A., Zaccagnini, A., Zaffanella, E.: PURRS: Towards computer algebra support for fully automatic worst-case complexity analysis. Technical report, arXiv:cs\/0512056 (2005), http:\/\/arxiv.org\/"},{"key":"15_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45789-5_17","volume-title":"Static Analysis","author":"R. Bagnara","year":"2002","unstructured":"Bagnara, R., Ricci, E., Zaffanella, E., Hill, P.M.: Possibly not closed convex polyhedra and the Parma Polyhedra Library. In: Hermenegildo, M.V., Puebla, G. (eds.) SAS 2002. LNCS, vol.\u00a02477, Springer, Heidelberg (2002)"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Benzinger, R.: Automated higher-order complexity analysis. In: TCS, vol.\u00a0318(1-2) (2004)","DOI":"10.1016\/S0304-3975(03)00527-9"},{"key":"15_CR8","series-title":"Lecture Notes in Computer Science","volume-title":"Term Rewriting and Applications","author":"G. Bonfante","year":"2005","unstructured":"Bonfante, G., Marion, J.-Y., Moyen, J.-Y.: Quasi-interpretations and small space bounds. In: Giesl, J. (ed.) RTA 2005. LNCS, vol.\u00a03467, Springer, Heidelberg (2005)"},{"key":"15_CR9","series-title":"Lecture Notes in Computer Science","volume-title":"Programming Languages and Systems","author":"A. Chander","year":"2005","unstructured":"Chander, A., Espinosa, D., Islam, N., Lee, P., Necula, G.: Enforcing resource bounds via static verification of dynamic checks. In: Sagiv, M. (ed.) ESOP 2005. LNCS, vol.\u00a03444, Springer, Heidelberg (2005)"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"Cousot, P., Halbwachs, N.: Automatic discovery of linear restraints among variables of a program. In: POPL (1978)","DOI":"10.1145\/512760.512770"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Crary, K., Weirich, S.: Resource bound certification. In: POPL (2000)","DOI":"10.1145\/325694.325716"},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"Debray, S.K., Lin, N.W.: Cost analysis of logic programs. TOPLAS\u00a015(5) (1993)","DOI":"10.1145\/161468.161472"},{"key":"15_CR13","volume-title":"PEPM","author":"G. G\u00f3mez","year":"2002","unstructured":"G\u00f3mez, G., Liu, Y.A.: Automatic time-bound analysis for a higher-order language. In: PEPM, ACM Press, New York (2002)"},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"Hickey, T., Cohen, J.: Automating program analysis. J. ACM\u00a035(1) (1988)","DOI":"10.1145\/42267.42275"},{"key":"15_CR15","volume-title":"Proc. EAAI","author":"P.M. Hill","year":"2006","unstructured":"Hill, P.M., Payet, E., Spoto, F.: Path-length analysis of object-oriented programs. In: Proc. EAAI, Elsevier, Amsterdam (2006)"},{"key":"15_CR16","doi-asserted-by":"crossref","unstructured":"Hofmann, M., Jost, S.: Static prediction of heap space usage for first-order functional programs. In: POPL (2003)","DOI":"10.1145\/604131.604148"},{"key":"15_CR17","volume-title":"Partial Evaluation and Automatic Program Generation","author":"N.D. Jones","year":"1993","unstructured":"Jones, N.D., Gomard, C.K., Sestoft, P.: Partial Evaluation and Automatic Program Generation. Prentice Hall, New York (1993)"},{"key":"15_CR18","doi-asserted-by":"crossref","unstructured":"Le Metayer, D.: ACE: An Automatic Complexity Evaluator. TOPLAS\u00a010(2) (1988)","DOI":"10.1145\/42190.42347"},{"key":"15_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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, Springer, Heidelberg (2006)"},{"key":"15_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74610-2_24","volume-title":"Logic Programming","author":"J. Navas","year":"2007","unstructured":"Navas, J., Mera, E., L\u00f3pez-Garc\u00eda, P., Hermenegildo, M.: User-definable resource bounds analysis for logic programs. In: Dahl, V., Niemel\u00e4, I. (eds.) ICLP 2007. LNCS, vol.\u00a04670, Springer, Heidelberg (2007)"},{"key":"15_CR21","series-title":"Lecture Notes in Computer Science","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"A. Podelski","year":"2004","unstructured":"Podelski, A., Rybalchenko, A.: A complete method for the synthesis of linear ranking functions. In: Steffen, B., Levi, G. (eds.) VMCAI 2004. LNCS, vol.\u00a02937, Springer, Heidelberg (2004)"},{"key":"15_CR22","volume-title":"FPCA","author":"M. Rosendahl","year":"1989","unstructured":"Rosendahl, M.: Automatic Complexity Analysis. In: FPCA, ACM Press, New York (1989)"},{"key":"15_CR23","doi-asserted-by":"crossref","unstructured":"Sands, D.: A na\u00efve time analysis and its theory of cost equivalence. Journal of Logic and Computation\u00a05(4) (1995)","DOI":"10.1093\/logcom\/5.4.495"},{"key":"15_CR24","doi-asserted-by":"crossref","unstructured":"Wadler, P.: Strictness analysis aids time analysis. In: POPL (1988)","DOI":"10.1145\/73560.73571"},{"key":"15_CR25","doi-asserted-by":"crossref","unstructured":"Wegbreit, B.: Mechanical Program Analysis. Comm. of the ACM\u00a018(9) (1975)","DOI":"10.1145\/361002.361016"}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69166-2_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T04:30:10Z","timestamp":1620016210000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69166-2_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540691631","9783540691662"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69166-2_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[]}}