{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,6]],"date-time":"2025-05-06T09:08:31Z","timestamp":1746522511755},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540433699"},{"type":"electronic","value":"9783540459378"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45937-5_23","type":"book-chapter","created":{"date-parts":[[2007,6,7]],"date-time":"2007-06-07T01:39:18Z","timestamp":1181180358000},"page":"325-341","source":"Crossref","is-referenced-by-count":11,"title":["A Comprehensive Approach to Array Bounds Check Elimination for Java"],"prefix":"10.1007","author":[{"given":"Feng","family":"Qian","sequence":"first","affiliation":[]},{"given":"Laurie","family":"Hendren","sequence":"additional","affiliation":[]},{"given":"Clark","family":"Verbrugge","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,3,28]]},"reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"R. Bodik, R. Gupta, and V. Sarkar. ABCD: Eliminating Array Bounds Checks on Demand. In Proceedings of the ACM SIGPLAN\u2019 00 Conference on Programming Language Design and Implementation(PLDI), pages 321\u2013333, Vancouver, BC, Canada, June 2000.","DOI":"10.1145\/358438.349342"},{"issue":"6","key":"23_CR2","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1002\/(SICI)1096-9128(199706)9:6<427::AID-CPE300>3.0.CO;2-K","volume":"9","author":"M. Cierniak","year":"1997","unstructured":"M. Cierniak and W. Li. Optimizing Java bytecodes. Concurrency, Practice and Experience, 9(6):427\u2013444, 1997.","journal-title":"Concurrency, Practice and Experience"},{"key":"23_CR3","unstructured":"T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. McGraw-Hill and MIT Press, 1990."},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"R. Gupta. A fresh look at optimizing array bound checking. In Proceedings of the ACM SIGPLAN\u2019 90 Conference on Programming Language Design and Implementation, pages 272\u2013282, White Plains, NY, June 1990.","DOI":"10.1145\/93542.93581"},{"issue":"1","key":"23_CR5","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1145\/176454.176507","volume":"2","author":"R. Gupta","year":"1993","unstructured":"R. Gupta. Optimizing array bound checks using flow analysis. ACM Letters on Programming Languages and Systems, 2(1\u20134):135\u2013150, 1993.","journal-title":"ACM Letters on Programming Languages and Systems"},{"key":"23_CR6","unstructured":"S. Hoxey, F. Karim, B. Hay, and H. Warren, editors. The PowerPC Compiler Writer\u2019s Guide. IBM Microelectronics Division, 1986."},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"V. Markstein, J. Cocke, and P. Markstein. Optimization of range checking. Proceedings of the SIGPLAN\u201982 Symposium on Compiler Construction, pages 114\u2013119, June 1982.","DOI":"10.1145\/800230.806986"},{"key":"23_CR8","unstructured":"S. S. Muchnick. Advanced Compiler Design and Implementation. Morgan Kaufmann, 1997."},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"P. Pominville, F. Qian, R. Vallee-Rai, L. Hendren, and C. Verbrugge. A framework for optimizing java using attributes. In Proceedings of Compiler Construction, 2001, pages 334\u2013554, 2001.","DOI":"10.1007\/3-540-45306-7_23"},{"key":"23_CR10","unstructured":"R. Shaham. Automatic removal of array memory leaks in Java. Master\u2019s thesis, Tel-Aviv University, Tel-Aviv, Israel, September 1999. Available at http:\/\/www.math.tau.ac.il\/rans\/thesis.zip ."},{"key":"23_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/3-540-46423-9_4","volume-title":"Compiler Construction, 9th International Conference","author":"R. Shaham","year":"2000","unstructured":"R. Shaham, E. K. Kolodner, and M. Sagiv. Automatic removal of array memory leaks in java. In D. A. Watt, editor, Compiler Construction, 9th International Conference, volume 1781 of Lecture Notes in Computer Science, pages 50\u201366, Berlin, Germany, March 2000. Springer."}],"container-title":["Lecture Notes in Computer Science","Compiler Construction"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45937-5_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T19:41:58Z","timestamp":1556480518000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45937-5_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540433699","9783540459378"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-45937-5_23","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}