{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,15]],"date-time":"2024-07-15T00:54:40Z","timestamp":1721004880827},"reference-count":18,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":3772,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2003,4]]},"DOI":"10.1016\/s1571-0661(04)81012-0","type":"journal-article","created":{"date-parts":[[2004,9,29]],"date-time":"2004-09-29T16:47:47Z","timestamp":1096476467000},"page":"178-195","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["Flow Analytic Type System for Array Bound Checks"],"prefix":"10.1016","volume":"78","author":[{"given":"MATSUNO","family":"Yutaka","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroyuki","family":"SATO","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)81012-0_NEWBIB1","doi-asserted-by":"crossref","unstructured":"Ahmed A., and D. Walker, The Logical Approach to Stack Typing in: The ACM SIGPLAN Workshop on Types in Language Design and Implementation, 2003, to appear.","DOI":"10.1145\/604174.604185"},{"key":"10.1016\/S1571-0661(04)81012-0_NEWBIB2","doi-asserted-by":"crossref","unstructured":"Bodik R., R. Gupta and V. Sarkar, ABCD: eliminating array bounds checks on demand, in: SIGPLAN Conference on Programming Language Design and Implementation, 2000, pp. 321\u2013333.","DOI":"10.1145\/349299.349342"},{"key":"10.1016\/S1571-0661(04)81012-0_NEWBIB3","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1145\/358438.349315","article-title":"A certifying compiler for Java","volume":"35","author":"Colby","year":"2000","journal-title":"ACM SIGPLAN Notices"},{"key":"10.1016\/S1571-0661(04)81012-0_NEWBIB4","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1145\/115372.115320","article-title":"Efficiency computing static single assignment form and the control dependence graph","volume":"13-4","author":"Cytron","year":"1991","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"10.1016\/S1571-0661(04)81012-0_NEWBIB5","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1145\/200994.201003","article-title":"Beyond induction variables: Detecting and classifying sequences using a demand-driven SSA form","volume":"17-1","author":"Gerlek","year":"1995","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"10.1016\/S1571-0661(04)81012-0_NEWBIB6","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1145\/176454.176507","article-title":"Optimizing array bound checks using flow analysis","author":"Gupta","year":"1993","journal-title":"ACM Letters on Programming Languages and Systems 2-1-4"},{"key":"10.1016\/S1571-0661(04)81012-0_NEWBIB7","first-page":"15","article-title":"On a new method for dataflow analysis of java virtual machine subroutines","volume":"1503","author":"Hagiya","year":"1998","journal-title":"Lecture Notes in Computer Science"},{"key":"10.1016\/S1571-0661(04)81012-0_NEWBIB8","doi-asserted-by":"crossref","unstructured":"Kolte P. and M. Wolfe, Elimination of redundant array subscript checks, in: SIGPLAN Conference on Programming Language Design and Implementation, 1995, pp. 270\u2013278.","DOI":"10.1145\/207110.207160"},{"key":"10.1016\/S1571-0661(04)81012-0_NEWBIB9","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1147\/sj.373.0409","article-title":"Optimizing array reference checking in java programs","volume":"37-3","author":"Midkiff","year":"1998","journal-title":"IBM Systems Journal"},{"key":"10.1016\/S1571-0661(04)81012-0_NEWBIB10","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1145\/319301.319345","article-title":"From System F to typed assembly language","volume":"21","author":"Morrisett","year":"1999","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"10.1016\/S1571-0661(04)81012-0_NEWBIB11","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1007\/BFb0055511","article-title":"Stack-Based Typed Assembly Language","author":"Morrisett","year":"1998","journal-title":"The ACM SIGPLAN Workshop on Types in Compilation"},{"key":"10.1016\/S1571-0661(04)81012-0_NEWBIB12","doi-asserted-by":"crossref","unstructured":"Necula, G. C., Proof-carrying code, in: Conference Record of POPL 97: The 24th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Paris, 1997, pp. 106\u2013119.","DOI":"10.1145\/263699.263712"},{"key":"10.1016\/S1571-0661(04)81012-0_NEWBIB13","series-title":"\u201cPrinciples of Program Analysis\u201d","author":"Nielson","year":"1998"},{"key":"10.1016\/S1571-0661(04)81012-0_NEWBIB14","doi-asserted-by":"crossref","unstructured":"Stata R. and M. Abadi, A type system for Java bytecode subroutines, in: Conference Record of POPL 98: The 25TH ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, San Diego, California, New York, NY, 1998, pp. 149\u2013160.","DOI":"10.1145\/268946.268959"},{"key":"10.1016\/S1571-0661(04)81012-0_NEWBIB15","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1145\/143103.143131","article-title":"Beyond induction variables","volume":"27","author":"Wolfe","year":"1992","journal-title":"SIGPLAN Notices"},{"key":"10.1016\/S1571-0661(04)81012-0_NEWBIB16","doi-asserted-by":"crossref","unstructured":"Xi H. and R. Harper, Dependently typed assembly language, in: Proceedings of the Sixth ACM SIGPLAN International Confernece on Functional Programming, Florence, 2001, pp. 169\u2013180.","DOI":"10.1145\/507635.507657"},{"key":"10.1016\/S1571-0661(04)81012-0_NEWBIB17","doi-asserted-by":"crossref","unstructured":"XI H. and F. Pfenning, Eliminating array bound through dependent types, in: SIGPLAN Conference on Programming Language Design and Implementation, 1998, pp. 249\u2013257.","DOI":"10.1145\/277652.277732"},{"key":"10.1016\/S1571-0661(04)81012-0_NEWBIB18","doi-asserted-by":"crossref","unstructured":"Xi H. and F. Pfenning, Dependent Types in Practical Programming, in: Conference Record of POPL 99: The 26th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, San Antonio, Texas, New York, NY, 1999, pp. 214\u2013227.","DOI":"10.1145\/292540.292560"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104810120?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104810120?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,4,3]],"date-time":"2020-04-03T07:12:33Z","timestamp":1585897953000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104810120"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,4]]},"references-count":18,"alternative-id":["S1571066104810120"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)81012-0","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2003,4]]}}}