{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,6,26]],"date-time":"2023-06-26T18:51:51Z","timestamp":1687805511941},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2006,2,1]],"date-time":"2006-02-01T00:00:00Z","timestamp":1138752000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Real-Time Syst"],"published-print":{"date-parts":[[2006,2]]},"DOI":"10.1007\/s11241-006-5317-1","type":"journal-article","created":{"date-parts":[[2006,2,27]],"date-time":"2006-02-27T12:04:15Z","timestamp":1141041855000},"page":"73-104","source":"Crossref","is-referenced-by-count":3,"title":["A Method for Computing the Number of Iterations in Data Dependent Loops"],"prefix":"10.1007","volume":"32","author":[{"given":"Francesco","family":"Curatelli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leonardo","family":"Mangeruca","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,2,20]]},"reference":[{"key":"5317_CR1","doi-asserted-by":"crossref","unstructured":"Abd-El-Hafiz, S.K. and Basili, V.R. 1996. A knowledge-based approach to the analysis of loops. IEEE Transactions on Software Engineering 22(5): 339\u2013360.","DOI":"10.1109\/32.502226"},{"key":"5317_CR2","doi-asserted-by":"crossref","unstructured":"Basu, S. and Misra, J. 1975. Proving loop programs. IEEE Transactions on Software Engineering 1(1): 76\u201386.","DOI":"10.1109\/TSE.1975.6312822"},{"key":"5317_CR3","unstructured":"Bini, D.A., Daddi, F. and Gemignani L. 2004. On the shifted QR iteration applied to companion matrices. Electronic Transactions on Numerical Analysis 8: 137\u2013152."},{"key":"5317_CR4","unstructured":"Caplain, M. 1975. Finding invariant assertions for proving programs. In Proceedings of the International Conference on Reliable Software Los Angeles, U.S.A., pp. 165\u2013171."},{"key":"5317_CR5","doi-asserted-by":"crossref","unstructured":"Dunlop, D.D. and Basili, V.R. 1984. A heuristic for deriving loop functions. IEEE Transactions on Software Engineering 10(3): 275\u2013285.","DOI":"10.1109\/TSE.1984.5010236"},{"key":"5317_CR6","doi-asserted-by":"crossref","unstructured":"Ellozy, H.A. 1981. The determination of loop invariants for programs with arrays. IEEE Transactions on Software Engineering 7(2): 197\u2013206.","DOI":"10.1109\/TSE.1981.234517"},{"key":"5317_CR7","unstructured":"Ermedahl, A. and Gustafsson, J. 1997. Deriving annotations for tight calculation of execution time. In Proceedings of the European Conference on Parallel Processing Passau, Germany, pp. 1298\u20131307."},{"key":"5317_CR8","unstructured":"Floyd, R.W. 1967. Assigning meanings to programs. In Proceedings of the Symposium on Applied Mathematics Vol. 19, J.T. Schwartz, Ed., Amer. Math. Soc., Providence, U.S.A., pp. 19\u201332."},{"key":"5317_CR9","unstructured":"Golub, G.H. and Van Loan, C.F. 1996. In Matrix Computations (Johns Hopkins Studies in Mathematical Sciences). The Johns Hopkins University Press, Third Edition."},{"key":"5317_CR10","unstructured":"Healy, C.A., Sj\u00f6din, M., Rustagi V. and Whalley, D. 1998. Bounding loop iterations for timing analysis. In Proceedings of the 4th IEEE Real-Time Technology and Applications Symposium(RTAS\u201898) Denver, U.S.A."},{"key":"5317_CR11","doi-asserted-by":"crossref","unstructured":"Healy, C.A., Sj\u00f6din, M., Rustagi V., Whalley, D. and van Engelen, R. 2000. Supporting timing analysis by automatic bounding of loop iterations. Real-Time Systems 18(2\u20133): 129\u2013156.","DOI":"10.1023\/A:1008189014032"},{"key":"5317_CR12","doi-asserted-by":"crossref","unstructured":"Hoare, C.A.R. 1969. An Axiomatic basis of computer programming. Communications of the Association for Computer Machinery 12: 576\u2013580.","DOI":"10.1145\/363235.363259"},{"key":"5317_CR13","doi-asserted-by":"crossref","unstructured":"Katz, S. and Manna, Z. 1976. Logical analysis of programs. Communications of the Association for Computer Machinery 19(4): 188\u2013206.","DOI":"10.1145\/360032.360048"},{"key":"5317_CR14","doi-asserted-by":"crossref","unstructured":"Mills, H.D. 1975. The new math of computer programming. Communications of the Association for Computer Machinery 18: 43\u201348.","DOI":"10.1145\/360569.360659"},{"key":"5317_CR15","doi-asserted-by":"crossref","unstructured":"Misra, J. 1978. Some aspects of the verification of loop computations. IEEE Transactions on Software Engineering 4(6): 478\u2013486.","DOI":"10.1109\/TSE.1978.233871"},{"key":"5317_CR16","doi-asserted-by":"crossref","unstructured":"Najjar, W.A., Miller, W.M. and Wim B\u00f6hm, A.P. 1992. An analysis of loop latency in data flow execution. In Proceedings of the 19th International Symposium on Computer Architecture (ISCA'92) Gold Coast, Australia.","DOI":"10.1145\/139669.140397"},{"key":"5317_CR17","doi-asserted-by":"crossref","unstructured":"Smale, S. 1997. Complexity theory and numerical analysis. Acta Numerica pp. 523\u2013551.","DOI":"10.1017\/S0962492900002774"},{"key":"5317_CR18","doi-asserted-by":"crossref","unstructured":"Spezialetti, M. and Gupta, R. 1995. Loop monotonic statements. IEEE Transactions on Software Engineering, 21(6): 497\u2013505.","DOI":"10.1109\/32.391376"},{"key":"5317_CR19","doi-asserted-by":"crossref","unstructured":"Waters, R.C. 1979. A Method for analyzing loop programs. IEEE Transactions on Software Engineering 5(3): 237\u2013247.","DOI":"10.1109\/TSE.1979.234185"}],"container-title":["Real-Time Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11241-006-5317-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11241-006-5317-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11241-006-5317-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T11:04:27Z","timestamp":1559387067000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11241-006-5317-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,2]]},"references-count":19,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2006,2]]}},"alternative-id":["5317"],"URL":"https:\/\/doi.org\/10.1007\/s11241-006-5317-1","relation":{},"ISSN":["0922-6443","1573-1383"],"issn-type":[{"value":"0922-6443","type":"print"},{"value":"1573-1383","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,2]]}}}