{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T17:07:07Z","timestamp":1725815227694},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662460771"},{"type":"electronic","value":"9783662460788"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-46078-8_50","type":"book-chapter","created":{"date-parts":[[2015,1,14]],"date-time":"2015-01-14T09:54:29Z","timestamp":1421229269000},"page":"603-614","source":"Crossref","is-referenced-by-count":0,"title":["Java Loops Are Mainly Polynomial"],"prefix":"10.1007","author":[{"given":"Maciej","family":"Zielenkiewicz","sequence":"first","affiliation":[]},{"given":"Jacek","family":"Chrz\u0105szcz","sequence":"additional","affiliation":[]},{"given":"Aleksy","family":"Schubert","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"50_CR1","unstructured":"Checkstyle, \n                    \n                      http:\/\/checkstyle.sourceforge.net\/"},{"issue":"2","key":"50_CR2","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BF01201998","volume":"2","author":"S. Bellantoni","year":"1992","unstructured":"Bellantoni, S., Cook, S.: A new recursion-theoretic characterization of the polytime functions. Computational Complexity\u00a02(2), 97\u2013110 (1992)","journal-title":"Computational Complexity"},{"key":"50_CR3","unstructured":"Ermedahl, A., Sandberg, C., Gustafsson, J., Bygde, S., Lisper, B.: Loop bound analysis based on a combination of program slicing, abstract interpretation, and invariant analysis. In: Rochange, C. (ed.) 7th Intl. Workshop on Worst-Case Execution Time Analysis (WCET). Internationales Begegnungs- und Forschungszentrum f\u00fcr Informatik (IBFI), Schloss Dagstuhl, Germany, Dagstuhl, Germany (2007)"},{"key":"50_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/978-3-642-11266-9_34","volume-title":"SOFSEM 2010: Theory and Practice of Computer Science","author":"J. Fulara","year":"2010","unstructured":"Fulara, J., Jakubczyk, K.: Practically applicable formal methods. In: van Leeuwen, J., Muscholl, A., Peleg, D., Pokorn\u00fd, J., Rumpe, B. (eds.) SOFSEM 2010. LNCS, vol.\u00a05901, pp. 407\u2013418. Springer, Heidelberg (2010)"},{"key":"50_CR5","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)"},{"key":"50_CR6","doi-asserted-by":"crossref","unstructured":"Gulwani, S., Mehra, K.K., Chilimbi, T.M.: Speed: precise and efficient static estimation of program computational complexity. In: Shao, Z., Pierce, B.C. (eds.) POPL, pp. 127\u2013139. Press (2009)","DOI":"10.1145\/1594834.1480898"},{"key":"50_CR7","doi-asserted-by":"crossref","unstructured":"Gulwani, S., Zuleger, F.: The reachability-bound problem. In: Zorn, B.G., Aiken, A. (eds.) PLDI, pp. 292\u2013304. ACM (2010)","DOI":"10.1145\/1809028.1806630"},{"issue":"3","key":"50_CR8","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1145\/2362389.2362393","volume":"34","author":"J. Hoffmann","year":"2012","unstructured":"Hoffmann, J., Aehlig, K., Hofmann, M.: Multivariate amortized resource analysis. ACM Trans. Program. Lang. Syst.\u00a034(3), 14 (2012)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"50_CR9","doi-asserted-by":"crossref","unstructured":"Hogg, J., Lea, D., Wills, A., deChampeaux, D., Holt, R.: The Geneva convention on the treatment of object aliasing. SIGPLAN OOPS Mess. 3(2), 11\u201316 (1992)","DOI":"10.1145\/130943.130947"},{"key":"50_CR10","unstructured":"Hovemeyer, D.: Simple and Effective Static Analysis to Find Bugs. Ph.D. thesis, University of Maryland (College Park, Md.), College Park, Maryland (2005)"},{"issue":"12","key":"50_CR11","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1145\/1052883.1052895","volume":"39","author":"D. Hovemeyer","year":"2004","unstructured":"Hovemeyer, D., Pugh, W.: Finding bugs is easy. SIGPLAN Notices\u00a039(12), 92\u2013106 (2004)","journal-title":"SIGPLAN Notices"},{"issue":"1","key":"50_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0022-0000(80)90001-X","volume":"20","author":"T. Kasai","year":"1980","unstructured":"Kasai, T., Adachi, A.: A characterization of time complexity by simple loop programs. Journal of Computer and System Sciences\u00a020(1), 1\u201317 (1980)","journal-title":"Journal of Computer and System Sciences"},{"key":"50_CR13","unstructured":"Kosovskiy, N.K.: Polynomial-time program conditions for three programming languages. In: Proceedings of Fourth Workshop on Developments in Implicit Computational Complexity, DICE 2013 (2013)"},{"key":"50_CR14","doi-asserted-by":"crossref","unstructured":"Shkaravska, O., Kersten, R., van Eekelen, M.: Test-based inference of polynomial loop-bound functions. In: Krall, A., M\u00f6ssenb\u00f6ck, H. (eds.) PPPJ 2010: Proceedings of the 8th International Conference on the Principles and Practice of Programming in Java. ACM Digital Proceedings Series, pp. 99\u2013108 (2010)","DOI":"10.1145\/1852761.1852776"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2015: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-46078-8_50","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T00:27:27Z","timestamp":1559089647000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-46078-8_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662460771","9783662460788"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-46078-8_50","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}