{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T00:49:15Z","timestamp":1775868555753,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540921875","type":"print"},{"value":"9783540921882","type":"electronic"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-92188-2_5","type":"book-chapter","created":{"date-parts":[[2008,12,3]],"date-time":"2008-12-03T04:00:21Z","timestamp":1228276821000},"page":"113-132","source":"Crossref","is-referenced-by-count":46,"title":["COSTA: Design and Implementation of a Cost and Termination Analyzer for Java Bytecode"],"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":"German","family":"Puebla","sequence":"additional","affiliation":[]},{"given":"Damiano","family":"Zanardini","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/978-3-540-68863-1_2","volume-title":"Formal Methods for Open Object-Based Distributed Systems","author":"E. Albert","year":"2008","unstructured":"Albert, E., Arenas, P., Codish, M., Genaim, S., Puebla, G., Zanardini, D.: Termination Analysis of Java Bytecode. In: Barthe, G., de Boer, F.S. (eds.) FMOODS 2008. LNCS, vol.\u00a05051, pp. 2\u201318. Springer, Heidelberg (2008)"},{"key":"5_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/978-3-540-69166-2_15","volume-title":"Static Analysis","author":"E. Albert","year":"2008","unstructured":"Albert, E., Arenas, P., Genaim, S., Puebla, G.: Automatic Inference of Upper Bounds for Recurrence Relations in Cost Analysis. In: Alpuente, M., Vidal, G. (eds.) SAS 2008. LNCS, vol.\u00a05079, pp. 221\u2013237. Springer, Heidelberg (2008)"},{"key":"5_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":"5_CR4","volume-title":"Proc.\u00a0SAC","author":"E. Albert","year":"2008","unstructured":"Albert, E., Arenas, P., Genaim, S., Puebla, G., Zanardini, D.: Removing Useless Variables in Cost Analysis of Java Bytecode. In: Proc.\u00a0SAC. ACM Press, New York (2008)"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Albert, E., Genaim, S., Gomez-Zamalloa, M.: Heap Space Analysis for Java Bytecode. In: ISMM 2007 (October 2007)","DOI":"10.1145\/1296907.1296922"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Allen, F.: Control flow analysis. In: Proceedings of a symposium on Compiler optimization, pp. 1\u201319 (1970)","DOI":"10.1145\/800028.808479"},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-30569-9_1","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, pp. 1\u201326. Springer, Heidelberg (2005)"},{"key":"5_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","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, pp. 213\u2013229. Springer, Heidelberg (2002)"},{"key":"5_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-540-31987-0_22","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, pp. 311\u2013325. Springer, Heidelberg (2005)"},{"issue":"1","key":"5_CR10","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/S0743-1066(99)00006-0","volume":"41","author":"M. Codish","year":"1999","unstructured":"Codish, M., Taboch, C.: A semantic basis for the termination analysis of logic programs. The Journal of Logic Programming\u00a041(1), 103\u2013123 (1999)","journal-title":"The Journal of Logic Programming"},{"key":"5_CR11","first-page":"238","volume-title":"POPL 1977","author":"P. Cousot","year":"1977","unstructured":"Cousot, P., Cousot, R.: Abstract Interpretation: a Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints. In: POPL 1977, pp. 238\u2013252. ACM, New York (1977)"},{"key":"5_CR12","first-page":"184","volume-title":"POPL 2000","author":"K. Crary","year":"2000","unstructured":"Crary, K., Weirich, S.: Resource Bound Certification. In: POPL 2000, pp. 184\u2013198. ACM, New York (2000)"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Cytron, R., Ferrante, J., Rosen, B.K., Wegman, M.N., Zadeck, F.K.: Efficiently computing static single assignment form and the control dependence graph. TOPLAS\u00a013(4) (1991)","DOI":"10.1145\/115372.115320"},{"key":"5_CR14","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":"5_CR15","volume-title":"Data Structures and Algorithms in Java","author":"M.T. Goodrich","year":"2004","unstructured":"Goodrich, M.T., Tamassia, R.: Data Structures and Algorithms in Java, 3rd edn. John Wiley, Chichester (2004)","edition":"3"},{"key":"5_CR16","volume-title":"Proc. of PPDP 2005","author":"M. Hermenegildo","year":"2005","unstructured":"Hermenegildo, M., Albert, E., L\u00f3pez-Garc\u00eda, P., Puebla, G.: Abstraction Carrying Code and Resource-Awareness. In: Proc. of PPDP 2005. ACM Press, New York (2005)"},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"Hermenegildo, M., Puebla, G., Bueno, F., L\u00f3pez Garc\u00eda, P.: Integrated Program Debugging, Verification, and Optimization Using Abstract Interpretation (and The Ciao System Preprocessor). Science of Comp.\u00a0Progr.\u00a058(1\u20132) (2005)","DOI":"10.1016\/j.scico.2005.02.006"},{"key":"5_CR18","volume-title":"EAAI 2006, ENTS","author":"P.M. Hill","year":"2006","unstructured":"Hill, P.M., Payet, E., Spoto, F.: Path-length analysis of object-oriented programs. In: EAAI 2006, ENTS. Elsevier, Amsterdam (2006)"},{"key":"5_CR19","first-page":"81","volume-title":"POPL 2001","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: POPL 2001, pp. 81\u201392. ACM, New York (2001)"},{"key":"5_CR20","first-page":"35","volume-title":"Bytecode 2007, ENTCS","author":"H. Lehner","year":"2007","unstructured":"Lehner, H., M\u00fcller, P.: Formal translation of bytecode into BoogiePL. In: Bytecode 2007, ENTCS, pp. 35\u201350. Elsevier, Amsterdam (2007)"},{"key":"5_CR21","volume-title":"The Java Virtual Machine Specification","author":"T. Lindholm","year":"1996","unstructured":"Lindholm, T., Yellin, F.: The Java Virtual Machine Specification. Addison-Wesley, Reading (1996)"},{"key":"5_CR22","first-page":"106","volume-title":"POPL 1997","author":"G. Necula","year":"1997","unstructured":"Necula, G.: Proof-Carrying Code. In: POPL 1997, pp. 106\u2013119. ACM Press, New York (1997)"},{"key":"5_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":"5_CR24","unstructured":"Spoto, F.: Julia: A generic static analyser for the java bytecode. In: FTfJP 2005. (2005)"},{"issue":"5","key":"5_CR25","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1145\/937563.937565","volume":"25","author":"F. Spoto","year":"2003","unstructured":"Spoto, F., Jensen, T.: Class analyses as abstract interpretations of trace semantics. ACM Trans. Program. Lang. Syst.\u00a025(5), 578\u2013630 (2003)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"5_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/978-3-540-74061-2_11","volume-title":"Static Analysis","author":"W. Zou","year":"2007","unstructured":"Zou, W., Wei, T., Mao, J., Chen, Y.: A new algorithm for identifying loops in decompilation. In: Riis Nielson, H., Fil\u00e9, G. (eds.) SAS 2007. LNCS, vol.\u00a04634, pp. 170\u2013183. Springer, Heidelberg (2007)"},{"key":"5_CR27","unstructured":"Tip, F.: A Survey of Program Slicing Techniques. J. of Prog. Lang.\u00a03 (1995)"},{"key":"5_CR28","unstructured":"Vallee-Rai, R., Hendren, L., Sundaresan, V., Lam, P., Gagnon, E., Co, P.: Soot - a Java optimization framework. In: CASCON 1999, pp. 125\u2013135 (1999)"},{"key":"5_CR29","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","Formal Methods for Components and Objects"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-92188-2_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T19:12:27Z","timestamp":1557947547000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-92188-2_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540921875","9783540921882"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-92188-2_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008]]}}}