{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:44:09Z","timestamp":1725536649463},"publisher-location":"Berlin, Heidelberg","reference-count":57,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642038280"},{"type":"electronic","value":"9783642038297"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-03829-7_9","type":"book-chapter","created":{"date-parts":[[2009,8,10]],"date-time":"2009-08-10T09:05:20Z","timestamp":1249895120000},"page":"258-288","source":"Crossref","is-referenced-by-count":6,"title":["Resource Usage Analysis and Its Application to Resource Certification"],"prefix":"10.1007","author":[{"given":"Elvira","family":"Albert","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Puri","family":"Arenas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Samir","family":"Genaim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Germ\u00e1n","family":"Puebla","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Damiano","family":"Zanardini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","unstructured":"The Timber Language, http:\/\/www.timber-lang.org"},{"key":"9_CR2","volume-title":"Compilers \u2013 Principles, Techniques and Tools","author":"A.V. Aho","year":"1986","unstructured":"Aho, A.V., Sethi, R., Ullman, J.D.: Compilers \u2013 Principles, Techniques and Tools. Addison-Wesley, Reading (1986)"},{"key":"9_CR3","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":"9_CR4","doi-asserted-by":"crossref","unstructured":"Albert, E., Arenas, P., Genaim, S., Puebla, G.: Dealing with numeric fields in termination analysis of java-like languages. In: Huisman, M. (ed.) 10th Workshop on Formal Techniques for Java-like Programs (July 2008)","DOI":"10.1007\/978-3-540-68863-1_2"},{"key":"9_CR5","unstructured":"Albert, E., Arenas, P., Genaim, S., Puebla, G., Zanardini, D.: The COSTA System web site, http:\/\/costa.ls.fi.upm.es"},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","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, pp. 157\u2013172. Springer, Heidelberg (2007)"},{"issue":"2","key":"9_CR7","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/s00354-008-0039-7","volume":"26","author":"E. Albert","year":"2008","unstructured":"Albert, E., Puebla, G., Hermenegildo, M.: Abstraction-Carrying Code: A Model for Mobile Code Safety. New Generation Computing\u00a026(2), 171\u2013204 (2008)","journal-title":"New Generation Computing"},{"key":"9_CR8","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":"9_CR9","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.O., 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":"9_CR10","unstructured":"Bagnara, R., Pescetti, A., Zaccagnini, A., Zaffanella, E.: PURRS: Towards computer algebra support for fully automatic worst-case complexity analysis. Technical report (2005) arXiv:cs\/0512056, http:\/\/arxiv.org\/"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/978-3-540-71389-0_4","volume-title":"Foundations of Software Science and Computational Structures","author":"M. Bartoletti","year":"2007","unstructured":"Bartoletti, M., Degano, P., Ferrari, G.-L., Zunino, R.: Types and effects for resource usage analysis. In: Seidl, H. (ed.) FOSSACS 2007. LNCS, vol.\u00a04423, pp. 32\u201347. Springer, Heidelberg (2007)"},{"key":"9_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-540-69407-6_7","volume-title":"Logic and Theory of Algorithms","author":"A.M. Ben-Amram","year":"2008","unstructured":"Ben-Amram, A.M., Jones, N.D., Kristiansen, L.: Linear, polynomial or exponential? Complexity inference in polynomial time. In: Beckmann, A., Dimitracopoulos, C., L\u00f6we, B. (eds.) CiE 2008. LNCS, vol.\u00a05028, pp. 67\u201376. Springer, Heidelberg (2008)"},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1007\/3-540-62718-9_12","volume-title":"Logic Program Synthesis and Transformation","author":"F. Benoy","year":"1997","unstructured":"Benoy, F., King, A.: Inferring Argument Size Relationships with CLP(R). In: Gallagher, J.P. (ed.) LOPSTR 1996. LNCS, vol.\u00a01207, pp. 204\u2013223. Springer, Heidelberg (1997)"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Benzinger, R.: Automated Higher-Order Complexity Analysis. Theor. Comput. Sci.\u00a0318(1-2) (2004)","DOI":"10.1016\/j.tcs.2003.10.022"},{"key":"9_CR15","first-page":"157","volume-title":"Proc. ACM Functional Programming Languages and Computer Architecture","author":"B. Bjerner","year":"1989","unstructured":"Bjerner, B., Holmstrom, S.: A Compositional Approach to Time Analysis of First Order Lazy Functional Programs. In: Proc. ACM Functional Programming Languages and Computer Architecture, pp. 157\u2013165. ACM Press, New York (1989)"},{"key":"9_CR16","volume-title":"Proceedings of the International Symposium on Memory management (ISMM)","author":"V. Braberman","year":"2008","unstructured":"Braberman, V., Fern\u00e1ndez, F., Garbervetsky, D., Yovine, S.: Parametric Prediction of Heap Memory Requirements. In: Proceedings of the International Symposium on Memory management (ISMM). ACM, New York (2008)"},{"key":"9_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/11526841_8","volume-title":"FM 2005: Formal Methods","author":"D. Cachera","year":"2005","unstructured":"Cachera, D., Jensen, T., Pichardie, D., Schneider, G.: Certified memory usage analysis. In: Fitzgerald, J.S., Hayes, I.J., Tarlecki, A. (eds.) FM 2005. LNCS, vol.\u00a03582, pp. 91\u2013106. Springer, Heidelberg (2005)"},{"key":"9_CR18","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.C.: Enforcing resource bounds via static verification of dynamic checks. In: Sagiv, M. (ed.) ESOP 2005. LNCS, vol.\u00a03444, pp. 311\u2013325. Springer, Heidelberg (2005)"},{"key":"9_CR19","volume-title":"Proceedings of the International Symposium on Memory management (ISMM)","author":"W.-N. Chin","year":"2008","unstructured":"Chin, W.-N., Nguyen, H.H., Popeea, C., Qin, S.: Analysing Memory Resource Bounds for Low-Level Programs. In: Proceedings of the International Symposium on Memory management (ISMM). ACM, New York (2008)"},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: Abstract Interpretation: a Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints. In: Fourth ACM Symposium on Principles of Programming Languages, pp. 238\u2013252 (1977)","DOI":"10.1145\/512950.512973"},{"key":"9_CR21","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 Press, New York (2000)"},{"issue":"5","key":"9_CR22","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"},{"key":"9_CR23","first-page":"15","volume-title":"Proceedings of IEEE Workshop on Design & Diagnostics of Electronic Circuits & Systems (DDECS)","author":"J. Eisinger","year":"2006","unstructured":"Eisinger, J., Polian, I., Becker, B., Metzner, A., Thesing, S., Wilhelm, R.: Automatic identification of timing anomalies for cycle-accurate worst-case execution time analysis. In: Proceedings of IEEE Workshop on Design & Diagnostics of Electronic Circuits & Systems (DDECS), pp. 15\u201320. IEEE Computer Society, Los Alamitos (2006)"},{"key":"9_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1007\/978-3-540-70545-1_35","volume-title":"Computer Aided Verification","author":"B.S. Gulavani","year":"2008","unstructured":"Gulavani, B.S., Gulwani, S.: A numerical abstract domain based on expression abstraction and max operator with application in timing analysis. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol.\u00a05123, pp. 370\u2013384. Springer, Heidelberg (2008)"},{"key":"9_CR25","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1145\/1480881.1480898","volume-title":"POPL","author":"S. Gulwani","year":"2009","unstructured":"Gulwani, S., Mehra, K.K., Chilimbi, T.M.: Speed: precise and efficient static estimation of program computational complexity. In: POPL, pp. 127\u2013139. ACM, New York (2009)"},{"key":"9_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/978-3-540-73368-3_42","volume-title":"Computer Aided Verification","author":"S. Gulwani","year":"2007","unstructured":"Gulwani, S., Tiwari, A.: An abstract domain for analyzing heap-manipulating low-level software. In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol.\u00a04590, pp. 379\u2013392. Springer, Heidelberg (2007)"},{"key":"9_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-540-39815-8_3","volume-title":"Generative Programming and Component Engineering","author":"K. Hammond","year":"2003","unstructured":"Hammond, K., Michaelson, G.J.: Hume: A domain-specific language for real-time embedded systems. In: Pfenning, F., Smaragdakis, Y. (eds.) GPCE 2003. LNCS, vol.\u00a02830, pp. 37\u201356. Springer, Heidelberg (2003)"},{"issue":"1-2","key":"9_CR28","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.scico.2005.02.006","volume":"58","author":"M. Hermenegildo","year":"2005","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 Computer Programming\u00a058(1-2), 115\u2013140 (2005)","journal-title":"Science of Computer Programming"},{"key":"9_CR29","doi-asserted-by":"crossref","unstructured":"Hickey, T., Cohen, J.: Automating program analysis. J. ACM\u00a035(1) (1988)","DOI":"10.1145\/42267.42275"},{"key":"9_CR30","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":"9_CR31","doi-asserted-by":"crossref","unstructured":"Hughes, J., Pareto, L., Sabry, A.: Proving the correctness of reactive systems using sized types. In: POPL, pp. 410\u2013423 (1996)","DOI":"10.1145\/237721.240882"},{"key":"9_CR32","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":"9_CR33","doi-asserted-by":"crossref","unstructured":"Jouannaud, J., Xu, W.: Automatic Complexity Analysis for Programs Extracted from Coq Proof. ENTCS (2006)","DOI":"10.1016\/j.entcs.2005.08.005"},{"key":"9_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/11494645_33","volume-title":"New Computational Paradigms","author":"L. Kristiansen","year":"2005","unstructured":"Kristiansen, L., Jones, N.D.: The flow of data and the complexity of algorithms. In: Cooper, S.B., L\u00f6we, B., Torenvliet, L. (eds.) CiE 2005. LNCS, vol.\u00a03526, pp. 263\u2013274. Springer, Heidelberg (2005)"},{"issue":"2","key":"9_CR35","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1145\/42190.42347","volume":"10","author":"D. Metayer Le","year":"1988","unstructured":"Le Metayer, D.: ACE: An Automatic Complexity Evaluator. ACM Transactions on Programming Languages and Systems\u00a010(2), 248\u2013266 (1988)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"9_CR36","series-title":"ENTCS","first-page":"35","volume-title":"Bytecode 2007","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":"9_CR37","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":"9_CR38","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1145\/1111542.1111563","volume-title":"PEPM 2006: Proceedings of the 2006 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation","author":"B. Luca","year":"2006","unstructured":"Luca, B., Andrei, S., Anderson, H., Khoo, S.-C.: Program transformation by solving recurrences. In: PEPM 2006: Proceedings of the 2006 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation, pp. 121\u2013129. ACM, New York (2006)"},{"key":"9_CR39","unstructured":"Marion, J.-Y., P\u00e8choux, R.: Resource control of object-oriented programs. In: International LICS affiliated Workshop on Logic and Computational Complexity (LCC 2007), Wroclaw, Poland (2007)"},{"key":"9_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"348","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.V.: User-definable resource bounds analysis for logic programs. In: Dahl, V., Niemel\u00e4, I. (eds.) ICLP 2007. LNCS, vol.\u00a04670, pp. 348\u2013363. Springer, Heidelberg (2007)"},{"key":"9_CR41","first-page":"106","volume-title":"Proc. of ACM Symposium on Principles of programming languages (POPL)","author":"G. Necula","year":"1997","unstructured":"Necula, G.: Proof-Carrying Code. In: Proc. of ACM Symposium on Principles of programming languages (POPL), pp. 106\u2013119. ACM Press, New York (1997)"},{"key":"9_CR42","volume-title":"Principles of Program Analysis","author":"F. Nielson","year":"2005","unstructured":"Nielson, F., Nielson, H.R., Hankin, C.: Principles of Program Analysis, 2nd edn. Springer, Heidelberg (2005)","edition":"2"},{"issue":"5","key":"9_CR43","doi-asserted-by":"publisher","first-page":"1122","DOI":"10.1137\/S0097539704445597","volume":"35","author":"K.-H. Niggl","year":"2006","unstructured":"Niggl, K.-H., Wunderlich, H.: Certifying Polynomial Time and Linear\/Polynomial Space for Imperative Programs. SIAM J. Comput.\u00a035(5), 1122\u20131147 (2006)","journal-title":"SIAM J. Comput."},{"key":"9_CR44","first-page":"144","volume-title":"Proc. ACM Conference on Functional Programming Languages and Computer Architecture","author":"M. Rosendahl","year":"1989","unstructured":"Rosendahl, M.: Automatic Complexity Analysis. In: Proc. ACM Conference on Functional Programming Languages and Computer Architecture, pp. 144\u2013156. ACM, New York (1989)"},{"key":"9_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1007\/3-540-36377-7_18","volume-title":"The Essence of Computation","author":"M. Rosendahl","year":"2002","unstructured":"Rosendahl, M.: Simple Driving Techniques. In: Mogensen, T.\u00c6., Schmidt, D.A., Sudborough, I.H. (eds.) The Essence of Computation. LNCS, vol.\u00a02566, pp. 404\u2013419. Springer, Heidelberg (2002)"},{"key":"9_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/11609773_7","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"S. Rossignoli","year":"2005","unstructured":"Rossignoli, S., Spoto, F.: Detecting non-cyclicity by abstract compilation into boolean functions. In: Emerson, E.A., Namjoshi, K.S. (eds.) VMCAI 2006. LNCS, vol.\u00a03855, pp. 95\u2013110. Springer, Heidelberg (2005)"},{"key":"9_CR47","doi-asserted-by":"crossref","unstructured":"Sands, D.: A na\u00efve time analysis and its theory of cost equivalence. J. Log. Comput.\u00a05(4) (1995)","DOI":"10.1093\/logcom\/5.4.495"},{"key":"9_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/11547662_22","volume-title":"Static Analysis","author":"S. Secci","year":"2005","unstructured":"Secci, S., Spoto, F.: Pair-sharing analysis of object-oriented programs. In: Hankin, C., Siveroni, I. (eds.) SAS 2005. LNCS, vol.\u00a03672, pp. 320\u2013335. Springer, Heidelberg (2005)"},{"key":"9_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/978-3-540-74464-1_15","volume-title":"Types for Proofs and Programs","author":"H.R. Sim\u00f5es","year":"2007","unstructured":"Sim\u00f5es, H.R., Hammond, K., Florido, M., Vasconcelos, P.B.: Using intersection types for cost-analysis of higher-order polymorphic functional programs. In: Altenkirch, T., McBride, C. (eds.) TYPES 2006. LNCS, vol.\u00a04502, pp. 221\u2013236. Springer, Heidelberg (2007)"},{"key":"9_CR50","unstructured":"Spoto, F.: Julia: A Generic Static Analyser for the Java Bytecode. In: Proc. of the 7th Workshop on Formal Techniques for Java-like Programs, FTfJP 2005, Glasgow, Scotland (July 2005)"},{"issue":"5","key":"9_CR51","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":"9_CR52","series-title":"Electronic Notes in Theoretical Computer Science","volume-title":"Proc. International Workshop on Emerging Applications of Abstract Interpretation (EAAI)","author":"F. Spoto","year":"2006","unstructured":"Spoto, F., Hill, P.M., Payet, E.: Path-length analysis of object-oriented programs. In: Proc. International Workshop on Emerging Applications of Abstract Interpretation (EAAI). Electronic Notes in Theoretical Computer Science. Elsevier, Amsterdam (2006)"},{"issue":"3","key":"9_CR53","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1145\/5956.5957","volume":"8","author":"V.F. Turchin","year":"1986","unstructured":"Turchin, V.F.: The concept of a supercompiler. ACM Transactions on Programming Languages and Systems\u00a08(3), 292\u2013325 (1986)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"9_CR54","unstructured":"Vallee-Rai, R., Hendren, L., Sundaresan, V., Lam, P., Gagnon, E., Co, P.: Soot - a Java optimization framework. In: Proc.\u00a0of Conference of the Centre for Advanced Studies on Collaborative Research (CASCON), pp. 125\u2013135 (1999)"},{"key":"9_CR55","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/978-3-540-27861-0_6","volume-title":"Implementation of Functional Languages","author":"P.B. Vasconcelos","year":"2004","unstructured":"Vasconcelos, P.B., Hammond, K.: Inferring cost equations for recursive, polymorphic and higher-order functional programs. In: Trinder, P., Michaelson, G.J., Pe\u00f1a, R. (eds.) IFL 2003. LNCS, vol.\u00a03145, pp. 86\u2013101. Springer, Heidelberg (2004)"},{"key":"9_CR56","first-page":"119","volume-title":"Proc. ACM Symposium on Principles of Programming Languages (POPL)","author":"P. Wadler","year":"1988","unstructured":"Wadler, P.: Strictness analysis aids time analysis. In: Proc. ACM Symposium on Principles of Programming Languages (POPL), pp. 119\u2013132. ACM Press, New York (1988)"},{"key":"9_CR57","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","Foundations of Security Analysis and Design V"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03829-7_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,26]],"date-time":"2023-05-26T08:40:55Z","timestamp":1685090455000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03829-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642038280","9783642038297"],"references-count":57,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03829-7_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}