{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T00:02:38Z","timestamp":1725667358426},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642287169"},{"type":"electronic","value":"9783642287176"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-28717-6_34","type":"book-chapter","created":{"date-parts":[[2012,3,6]],"date-time":"2012-03-06T10:13:04Z","timestamp":1331028784000},"page":"435-444","source":"Crossref","is-referenced-by-count":12,"title":["r-TuBound: Loop Bounds for WCET Analysis (Tool Paper)"],"prefix":"10.1007","author":[{"given":"Jens","family":"Knoop","sequence":"first","affiliation":[]},{"given":"Laura","family":"Kov\u00e1cs","sequence":"additional","affiliation":[]},{"given":"Jakob","family":"Zwirchmayr","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"34_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/978-3-642-17511-4_7","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"R. Blanc","year":"2010","unstructured":"Blanc, R., Henzinger, T.A., Hottelier, T., Kov\u00e1cs, L.: ABC: Algebraic Bound Computation for Loops. In: Clarke, E.M., Voronkov, A. (eds.) LPAR-16 2010. LNCS, vol.\u00a06355, pp. 103\u2013118. Springer, Heidelberg (2010)"},{"key":"34_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/978-3-642-00768-2_16","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"R. Brummayer","year":"2009","unstructured":"Brummayer, R., Biere, A.: Boolector: An Efficient SMT Solver for Bit-Vectors and Arrays. In: Kowalewski, S., Philippou, A. (eds.) TACAS 2009. LNCS, vol.\u00a05505, pp. 174\u2013177. Springer, Heidelberg (2009)"},{"doi-asserted-by":"crossref","unstructured":"Everest, G., van der Poorten, A., Shparlinski, I., Ward, T.: Recurrence Sequences. Mathematical Surveys and Monographs, vol.\u00a0104. American Mathematical Society (2003)","key":"34_CR3","DOI":"10.1090\/surv\/104"},{"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)","key":"34_CR4","DOI":"10.1109\/RTSS.2006.12"},{"unstructured":"Knoop, J., Kovacs, L., Zwirchmayr, J.: An Evaluation of WCET Analysis using Symbolic Loop Bounds. In: Proc. of WCET (2011)","key":"34_CR5"},{"doi-asserted-by":"crossref","unstructured":"Knoop, J., Kovacs, L., Zwirchmayr, J.: Symbolic Loop Bound Computation for WCET Analysis. In: Proc. of PSI, p. 116 (2011)","key":"34_CR6","DOI":"10.1007\/978-3-642-29709-0_20"},{"doi-asserted-by":"crossref","unstructured":"De Michiel, M., Bonenfant, A., Cass\u00e9, H., Sainrat, P.: Static Loop Bound Analysis of C Programs Based on Flow Analysis and Abstract Interpretation. In: RTCSA, pp. 161\u2013166 (2008)","key":"34_CR7","DOI":"10.1109\/RTCSA.2008.53"},{"key":"34_CR8","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1002\/spe.968","volume":"40\/6","author":"M. Schoeberl","year":"2010","unstructured":"Schoeberl, M., Puffitsch, W., Pedersen, R.U., Huber, B.: Worst-case Execution Time Analysis for a Java Processor. Software: Practice and Experience\u00a040\/6, 507\u2013542 (2010)","journal-title":"Software: Practice and Experience"},{"unstructured":"Prantl, A.: The Termite Library, http:\/\/www.complang.tuwien.ac.at\/adrian\/termite\/Manual\/","key":"34_CR9"},{"unstructured":"Prantl, A., Schordan, M., Knoop, J.: TuBound - A Conceptually New Tool for WCET Analysis. In: Proc. of WCET, pp. 141\u2013148 (2008)","key":"34_CR10"},{"unstructured":"von Hanxleden, R., et al.: The WCET Tool Challenge 2011: Report. In: Proc. of WCET (2011) (under journal submission)","key":"34_CR11"}],"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-28717-6_34.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T22:02:49Z","timestamp":1606168969000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-28717-6_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642287169","9783642287176"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-28717-6_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}