{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:13:30Z","timestamp":1763468010997},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642175107"},{"type":"electronic","value":"9783642175114"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-17511-4_7","type":"book-chapter","created":{"date-parts":[[2010,12,7]],"date-time":"2010-12-07T01:24:40Z","timestamp":1291685080000},"page":"103-118","source":"Crossref","is-referenced-by-count":27,"title":["ABC: Algebraic Bound Computation for Loops"],"prefix":"10.1007","author":[{"given":"R\u00e9gis","family":"Blanc","sequence":"first","affiliation":[]},{"given":"Thomas A.","family":"Henzinger","sequence":"additional","affiliation":[]},{"given":"Thibaud","family":"Hottelier","sequence":"additional","affiliation":[]},{"given":"Laura","family":"Kov\u00e1cs","sequence":"additional","affiliation":[]}],"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","unstructured":"Birkeland, B.: Calculus and Algebra with MathCad 2000. Haeftad. Studentlitteratur (2000)"},{"key":"7_CR3","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: Proc. of POPL, pp. 238\u2013252 (1977)","DOI":"10.1145\/512950.512973"},{"key":"7_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-49159-2","volume-title":"An Introduction to Scientific Computing: Twelve Computational Projects Solved with MATLAB","author":"I. Danaila","year":"2007","unstructured":"Danaila, I., Joly, P., Kaber, S.M., Postel, M.: An Introduction to Scientific Computing: Twelve Computational Projects Solved with MATLAB. Springer, Heidelberg (2007)"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Ferdinand, C., Heckmann, R.: aiT: Worst Case Execution Time Prediction by Static Program Analysis. In: Proc. of IFIP Congress Topical Sessions, pp. 377\u2013384 (2004)","DOI":"10.1007\/978-1-4020-8157-6_29"},{"key":"7_CR6","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1073\/pnas.75.1.40","volume":"75","author":"R.W. Gosper","year":"1978","unstructured":"Gosper, R.W.: Decision Procedures for Indefinite Hypergeometric Summation. PNAS\u00a075, 40\u201342 (1978)","journal-title":"PNAS"},{"key":"7_CR7","volume-title":"Concrete Mathematics","author":"R.L. Graham","year":"1989","unstructured":"Graham, R.L., Knuth, D.E., Patashnik, O.: Concrete Mathematics, 2nd edn. Addison-Wesley Publishing Company, Reading (1989)","edition":"2"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Gulwani, S., Jain, S., Koskinen, E.: Control-flow Refinement and Progress Invariants for Bound Analysis. In: Proc. of PLDI, pp. 375\u2013385 (2009)","DOI":"10.1145\/1542476.1542518"},{"key":"7_CR9","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: Proc. of RTSS, pp. 57\u201366 (2006)","DOI":"10.1109\/RTSS.2006.12"},{"issue":"2\/3","key":"7_CR10","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1023\/A:1008189014032","volume":"18","author":"C.A. Healy","year":"2000","unstructured":"Healy, C.A., Sj\u00f6din, 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_CR11","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/978-3-540-89439-1_24","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"T.A. Henzinger","year":"2008","unstructured":"Henzinger, T.A., Hottelier, T., Kovacs, L.: Valigator: A Verification Tool with Bound and Invariant Generation. In: Cervesato, I., Veith, H., Voronkov, A. (eds.) LPAR 2008. LNCS (LNAI), vol.\u00a05330, pp. 333\u2013342. Springer, Heidelberg (2008)"},{"issue":"1-2","key":"7_CR12","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.scico.2005.02.006","volume":"58","author":"M.V. Hermenegildo","year":"2005","unstructured":"Hermenegildo, M.V., Puebla, G., Bueno, F., Lopez-Garcia, P.: Integrated Program Debugging, Verification, and Optimization using Abstract Interpretation (and the Ciao System Preprocessor). Sci. Comput. Program.\u00a058(1-2), 115\u2013140 (2005)","journal-title":"Sci. Comput. Program."},{"key":"7_CR13","unstructured":"Hicklin, J., Moler, C., Webb, P., Boisvert, R.F., Miller, B., Pozo, R., Remington, K.: JAMA: A Java Matrix Package (2005), \n                  \n                    http:\/\/math.nist.gov\/javanumerics\/jama\/"},{"key":"7_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/978-3-642-05089-3_23","volume-title":"FM 2009: Formal Methods","author":"S. Jost","year":"2009","unstructured":"Jost, S., Loidl, H., Hammond, K., Scaife, N., Hofmann, M.: \u201cCarbon Credits\u201d for Resource-Bounded Computations Using Amortised Analysis. In: Cavalcanti, A., Dams, D.R. (eds.) FM 2009. LNCS, vol.\u00a05850, pp. 354\u2013369. Springer, Heidelberg (2009)"},{"key":"7_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/11672142_3","volume-title":"STACS 2006","author":"M. M\u00fcller-Olm","year":"2006","unstructured":"M\u00fcller-Olm, M., Petter, M., Seidl, H.: Interprocedurally Analyzing Polynomial Identities. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol.\u00a03884, pp. 50\u201367. Springer, Heidelberg (2006)"},{"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., Lopez-Garcia, 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)"},{"issue":"5-6","key":"7_CR17","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1006\/jsco.1995.1076","volume":"20","author":"I. Nemes","year":"1995","unstructured":"Nemes, I., Petkovsek, M.: RComp: A Mathematica Package for Computing with Recursive Sequences. Journal of Symbolic Computation\u00a020(5-6), 745\u2013753 (1995)","journal-title":"Journal of Symbolic Computation"},{"key":"7_CR18","unstructured":"Odersky, M.: The Scala Language Specification (2008), \n                  \n                    http:\/\/www.scala-lang.org"},{"key":"7_CR19","unstructured":"Prantl, A., Knoop, J., Schordan, M., Triska, M.: Constraint Solving for High-Level WCET Analysis. CoRR, abs\/0903.2251 (2009)"},{"key":"7_CR20","unstructured":"Stewart, G.W.: JAMPACK: A Java Package For Matrix Computations, \n                  \n                    http:\/\/www.mathematik.hu-berlin.de\/~lamour\/software\/JAVA\/Jampack\/"},{"key":"7_CR21","doi-asserted-by":"crossref","unstructured":"van Engelen, R.A., Birch, J., Gallivan, K.A.: Array Data Dependence Testing with the Chains of Recurrences Algebra. In: Proc. of IWIA, pp. 70\u201381 (2004)","DOI":"10.1109\/IWIA.2004.10018"},{"key":"7_CR22","volume-title":"The Mathematica Book. Version 5.0","author":"S. Wolfram","year":"2003","unstructured":"Wolfram, S.: The Mathematica Book. Version 5.0. Wolfram Media, Champaign (2003)"}],"container-title":["Lecture Notes in Computer Science","Logic for Programming, Artificial Intelligence, and Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17511-4_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T14:33:16Z","timestamp":1553265196000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17511-4_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642175107","9783642175114"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17511-4_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}