{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,6]],"date-time":"2026-10-06T15:17:06Z","timestamp":1791299826521,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642026577","type":"print"},{"value":"9783642026584","type":"electronic"}],"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-02658-4_7","type":"book-chapter","created":{"date-parts":[[2009,6,22]],"date-time":"2009-06-22T07:00:16Z","timestamp":1245654016000},"page":"51-62","source":"Crossref","is-referenced-by-count":47,"title":["SPEED: Symbolic Complexity Bound Analysis"],"prefix":"10.1007","author":[{"given":"Sumit","family":"Gulwani","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"7_CR1","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":"7_CR2","doi-asserted-by":"crossref","unstructured":"Berdine, J., Chawdhary, A., Cook, B., Distefano, D., O\u2019Hearn, P.: Variance analyses from invariance analyses. In: POPL (2007)","DOI":"10.1145\/1190216.1190249"},{"key":"7_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/978-3-540-30579-8_8","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"A. Bradley","year":"2005","unstructured":"Bradley, A., Manna, Z., Sipma, H.: Termination of polynomial programs. In: Cousot, R. (ed.) VMCAI 2005. LNCS, vol.\u00a03385, pp. 113\u2013129. Springer, Heidelberg (2005)"},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1349","DOI":"10.1007\/11523468_109","volume-title":"Automata, Languages and Programming","author":"A.R. Bradley","year":"2005","unstructured":"Bradley, A.R., Manna, Z., Sipma, H.B.: The polyranking principle. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 1349\u20131361. Springer, Heidelberg (2005)"},{"issue":"6","key":"7_CR5","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1145\/1133255.1134029","volume":"41","author":"Byron Cook","year":"2006","unstructured":"Cook, B., Podelski, A., Rybalchenko, A.: Termination proofs for systems code. In: PLDI, pp. 415\u2013426 (2006)","journal-title":"ACM SIGPLAN Notices"},{"key":"7_CR6","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":"7_CR7","doi-asserted-by":"crossref","unstructured":"Gulwani, S., Jain, S., Koskinen, E.: Control-flow refinement and progress invariants for bound analysis. In: PLDI (2009)","DOI":"10.1145\/1542476.1542518"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Gulwani, S., Lev-Ami, T., Sagiv, M.: A combination framework for tracking partition sizes. In: POPL, pp. 239\u2013251 (2009)","DOI":"10.1145\/1594834.1480912"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Gulwani, S., Mehra, K.K., Chilimbi, T.M.: Speed: precise and efficient static estimation of program computational complexity. In: POPL, pp. 127\u2013139 (2009)","DOI":"10.1145\/1594834.1480898"},{"issue":"6","key":"7_CR10","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1145\/1133255.1134026","volume":"41","author":"Sumit Gulwani","year":"2006","unstructured":"Gulwani, S., Tiwari, A.: Combining abstract interpreters. In: PLDI, pp. 376\u2013386 (2006)","journal-title":"ACM SIGPLAN Notices"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Gustafsson, J., Ermedahl, A., Sandberg, C., Lisper, B.: Automatic derivation of loop bounds and infeasible paths for wcet analysis using abstract execution. In: RTSS, pp. 57\u201366 (2006)","DOI":"10.1109\/RTSS.2006.12"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Halbwachs, N., Proy, Y.-E., Roumanoff, P.: Verification of real-time systems using linear relation analysis. FMSD\u00a011(2) (1997)","DOI":"10.1023\/A:1008678014487"},{"issue":"2\/3","key":"7_CR13","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1023\/A:1008189014032","volume":"18","author":"C.A. Healy","year":"2000","unstructured":"Healy, C.A., Sjodin, M., Rustagi, V., Whalley, D.B., van Engelen, R.: Supporting timing analysis by automatic bounding of loop iterations. Real-Time Systems\u00a018(2\/3), 129\u2013156 (2000)","journal-title":"Real-Time Systems"},{"key":"7_CR14","unstructured":"Lisper, B.: Fully automatic, parametric worst-case execution time analysis. In: WCET (2003)"},{"issue":"2","key":"7_CR15","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1145\/42190.42347","volume":"10","author":"D.L. M\u00e9tayer","year":"1988","unstructured":"M\u00e9tayer, D.L.: Ace: An Automatic Complexity Evaluator. ACM Trans. Program. Lang. Syst.\u00a010(2), 248\u2013266 (1988)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"7_CR16","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":"7_CR17","first-page":"32","volume-title":"LICS","author":"A. Podelski","year":"2004","unstructured":"Podelski, A., Rybalchenko, A.: Transition invariants. In: LICS, pp. 32\u201341. IEEE, Los Alamitos (2004)"},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"Rosendahl, M.: Automatic Complexity Analysis. In: FPCA, pp. 144\u2013156 (1989)","DOI":"10.1145\/99370.99381"},{"issue":"9","key":"7_CR19","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1145\/361002.361016","volume":"18","author":"B. Wegbreit","year":"1975","unstructured":"Wegbreit, B.: Mechanical Program Analysis. Commun. ACM\u00a018(9), 528\u2013539 (1975)","journal-title":"Commun. ACM"},{"key":"7_CR20","doi-asserted-by":"crossref","unstructured":"Wilhelm, R., Engblom, J., Ermedahl, A., Holsti, N., Thesing, S., Whalley, D., Bernat, G., Ferdinand, C., Heckmann, R., Mueller, F., Puaut, I., Puschner, P., Staschulat, J., Stenstr\u00f6m, P.: The Determination of Worst-Case Execution Times\u2014Overview of the Methods and Survey of Tools. ACM Transactions on Embedded Computing Systems (TECS) (2007)","DOI":"10.1145\/1347375.1347389"},{"key":"7_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/978-3-540-70545-1_6","volume-title":"Computer Aided Verification","author":"R. Wilhelm","year":"2008","unstructured":"Wilhelm, R., Wachter, B.: Abstract interpretation with applications to timing validation. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol.\u00a05123, pp. 22\u201336. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02658-4_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T21:19:56Z","timestamp":1558387196000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02658-4_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642026577","9783642026584"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02658-4_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}