{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:41:08Z","timestamp":1725536468618},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642032363"},{"type":"electronic","value":"9783642032370"}],"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-03237-0_11","type":"book-chapter","created":{"date-parts":[[2009,8,3]],"date-time":"2009-08-03T05:24:37Z","timestamp":1249277077000},"page":"137-153","source":"Crossref","is-referenced-by-count":4,"title":["A Verifiable, Control Flow Aware Constraint Analyzer for Bounds Check Elimination"],"prefix":"10.1007","author":[{"given":"David","family":"Niedzielski","sequence":"first","affiliation":[]},{"given":"Jeffery","family":"von Ronne","sequence":"additional","affiliation":[]},{"given":"Andreas","family":"Gampe","sequence":"additional","affiliation":[]},{"given":"Kleanthis","family":"Psarris","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Amme, W., von Ronne, J., Franz, M.: Ssa-based mobile code: Implementation and empirical evaluation. ACM Trans. Archit. Code Optim.\u00a04(2), Article 13 (2007)","DOI":"10.1145\/1250727.1250733"},{"issue":"3","key":"11_CR2","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/j.tcs.2006.08.012","volume":"364","author":"F. Besson","year":"2006","unstructured":"Besson, F., Jensen, T., Pichardie, D.: Proof-carrying code from certified abstract interpretation and fixpoint compression. Theoretical Computer Science\u00a0364(3), 273\u2013291 (2006); Applied Semantics","journal-title":"Theoretical Computer Science"},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/BFb0014197","volume-title":"Languages and Compilers for Parallel Computing","author":"W. Blume","year":"1996","unstructured":"Blume, W., Eigenmann, R.: Demand-driven, symbolic range propagation. In: Huang, C.-H., Sadayappan, P., Banerjee, U., Gelernter, D., Nicolau, A., Padua, D.A. (eds.) LCPC 1995. LNCS, vol.\u00a01033, pp. 141\u2013160. Springer, Heidelberg (1996)"},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1145\/349299.349342","volume-title":"PLDI 2000: Proceedings of the ACM SIGPLAN 2000 conference on Programming language design and implementation","author":"R. Bod\u00edk","year":"2000","unstructured":"Bod\u00edk, R., Gupta, R., Sarkar, V.: Abcd: eliminating array bounds checks on demand. In: PLDI 2000: Proceedings of the ACM SIGPLAN 2000 conference on Programming language design and implementation, pp. 321\u2013333. ACM Press, New York (2000)"},{"issue":"6","key":"11_CR5","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1002\/1096-9128(200005)12:6<375::AID-CPE480>3.0.CO;2-M","volume":"12","author":"J.M. Bull","year":"2000","unstructured":"Bull, J.M., Smith, L.A., Westhead, M.D., Henty, D.S., Davey, R.A.: A benchmark suite for high performance Java. Concurrency: Practice and Experience\u00a012(6), 375\u2013388 (2000)","journal-title":"Concurrency: Practice and Experience"},{"key":"11_CR6","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1145\/304065.304113","volume-title":"JAVA 1999: Proceedings of the ACM 1999 conference on Java Grande","author":"M.G. Burke","year":"1999","unstructured":"Burke, M.G., Choi, J.-D., Fink, S., Grove, D., Hind, M., Sarkar, V., Serrano, M.J., Sreedhar, V.C., Srinivasan, H., Whaley, J.: The jalape\u00f1o dynamic optimizing compiler for java. In: JAVA 1999: Proceedings of the ACM 1999 conference on Java Grande, pp. 129\u2013141. ACM, New York (1999)"},{"key":"11_CR7","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1145\/1086297.1086312","volume-title":"CASES 2005: Proceedings of the 2005 international conference on Compilers, architectures and synthesis for embedded systems","author":"G. Chen","year":"2005","unstructured":"Chen, G., Kandemir, M.: Verifiable annotations for embedded java environments. In: CASES 2005: Proceedings of the 2005 international conference on Compilers, architectures and synthesis for embedded systems, pp. 105\u2013114. ACM Press, New York (2005)"},{"key":"11_CR8","first-page":"238","volume-title":"POPL 1977: Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages","author":"P. Cousot","year":"1977","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: POPL 1977: Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, pp. 238\u2013252. ACM, New York (1977)"},{"key":"11_CR9","first-page":"84","volume-title":"POPL 1978: Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages","author":"P. Cousot","year":"1978","unstructured":"Cousot, P., Halbwachs, N.: Automatic discovery of linear restraints among variables of a program. In: POPL 1978: Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, pp. 84\u201396. ACM Press, New York (1978)"},{"issue":"4","key":"11_CR10","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1145\/115372.115320","volume":"13","author":"R. Cytron","year":"1991","unstructured":"Cytron, R., Ferrante, J., Rosen, B.K., Wegman, M.N., Zadeck, F.K.: Efficiently computing static single assignment form and the control dependence graph. ACM Transactions on Programming Languages and Systems (TOPLAS)\u00a013(4), 451\u2013490 (1991)","journal-title":"ACM Transactions on Programming Languages and Systems (TOPLAS)"},{"key":"11_CR11","volume-title":"Proceedings of the International Conference on Principles and Practice of Programming In Java (PPPJ 2008)","author":"A. Gampe","year":"2008","unstructured":"Gampe, A., von Ronne, J., Niedzielski, D., Psarris, K.: Speculative improvements to verifiable bounds check elimination. In: Proceedings of the International Conference on Principles and Practice of Programming In Java (PPPJ 2008). ACM Press, New York (2008)"},{"key":"11_CR12","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1145\/1111037.1111072","volume-title":"POPL 2006: Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages","author":"V.S. Menon","year":"2006","unstructured":"Menon, V.S., Glew, N., Murphy, B.R., McCreight, A., Shpeisman, T., Adl-Tabatabai, A.-R., Petersen, L.: A verifiable ssa program representation for aggressive compiler optimization. In: POPL 2006: Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pp. 397\u2013408. ACM Press, New York (2006)"},{"issue":"2","key":"11_CR13","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1145\/349214.349222","volume":"22","author":"J.E. Moreira","year":"2000","unstructured":"Moreira, J.E., Midkiff, S.P., Gupta, M.: From flop to megaflops: Java for technical computing. ACM Trans. Program. Lang. Syst.\u00a022(2), 265\u2013295 (2000)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"11_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/3-540-45937-5_23","volume-title":"Compiler Construction","author":"F. Qian","year":"2002","unstructured":"Qian, F., Hendren, L.J., Verbrugge, C.: A comprehensive approach to array bounds check elimination for java. In: Horspool, R.N. (ed.) CC 2002. LNCS, vol.\u00a02304, pp. 325\u2013342. Springer, Heidelberg (2002)"},{"key":"11_CR15","volume-title":"Theory of Linear and Integer Programming","author":"A. Schrijver","year":"1986","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. Wiley and Sons, Chichester (1986)"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"von Ronne, J., Gampe, A., Niedzielski, D., Psarris, K.: Safe bounds check annotations. Concurrency and Computations: Practice and Experience (2008), doi:10.1002\/cpe.1341","DOI":"10.1002\/cpe.1341"},{"key":"11_CR17","first-page":"125","volume-title":"PPPJ 2007: Proceedings of the 5th international symposium on Principles and practice of programming in Java","author":"T. W\u00fcrthinger","year":"2007","unstructured":"W\u00fcrthinger, T., Wimmer, C., M\u00f6ssenb\u00f6ck, H.: Array bounds check elimination for the java hotspot client compiler. In: PPPJ 2007: Proceedings of the 5th international symposium on Principles and practice of programming in Java, pp. 125\u2013133. ACM, New York (2007)"},{"key":"11_CR18","first-page":"35","volume-title":"Proceedings of the Sixth International Conference on Parallel and Distributed Computing (PDCAT 2005)","author":"J. Zhao","year":"2005","unstructured":"Zhao, J., Rogers, I., Kirkham, C., Watson, I.: Loop parallelisation for the jikes rvm. In: Proceedings of the Sixth International Conference on Parallel and Distributed Computing (PDCAT 2005), pp. 35\u201339. IEEE Computer Society Press, Los Alamitos (2005)"}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03237-0_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,9]],"date-time":"2021-10-09T08:08:13Z","timestamp":1633766893000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03237-0_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642032363","9783642032370"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03237-0_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}