{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,29]],"date-time":"2022-12-29T06:50:18Z","timestamp":1672296618909},"reference-count":20,"publisher":"Oxford University Press (OUP)","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006,3,1]]},"DOI":"10.1093\/comjnl\/bxh161","type":"journal-article","created":{"date-parts":[[2006,1,24]],"date-time":"2006-01-24T01:28:45Z","timestamp":1138066125000},"page":"234-248","source":"Crossref","is-referenced-by-count":4,"title":["Using Control Dependencies for Space-Aware Bytecode Verification"],"prefix":"10.1093","volume":"49","author":[{"given":"C.","family":"Bernardeschi","sequence":"first","affiliation":[]},{"given":"G.","family":"Lettieri","sequence":"additional","affiliation":[]},{"given":"L.","family":"Martini","sequence":"additional","affiliation":[]},{"given":"P.","family":"Masci","sequence":"additional","affiliation":[]}],"member":"286","published-online":{"date-parts":[[2006,1,23]]},"reference":[{"key":"key\n\t\t\t\t20171012000856_B1","unstructured":"Bernardeschi, C., Lettieri, G., Martini, L. and Masci, P. (2005) Space Aware Data Flow Analysis. Technical report IET-05-03, Dipartimento di Ingegneria dell'Informazione, Universit\u00e0 di Pisa, Italy. Available at http:\/\/www.ing.unipi.it\/~o1103499\/papers\/IET-05-03.pdf."},{"key":"key\n\t\t\t\t20171012000856_B2","unstructured":"Apache Foundation (2002) ByteCode Engineering Library (BCEL) User Manual. Available at http:\/\/jakarta.apache.org\/index.html."},{"key":"key\n\t\t\t\t20171012000856_B3","unstructured":"Chen, Z. (2000) Java Card Technology for Smart Cards: Architecture and Programmer's Guide. Addison-Wesley Longman Publishing Co., Inc., Reading, MA."},{"key":"key\n\t\t\t\t20171012000856_B4","unstructured":"Lindholm, T. and Yellin, F. (1999) Java Virtual Machine Specification (2nd ed). Addison-Wesley Longman Publishing Co., Inc., Reading, MA."},{"key":"key\n\t\t\t\t20171012000856_B5","doi-asserted-by":"crossref","unstructured":"Cousot, P. and Cousot, R. (1977) Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Proc. Conf. Record of the Fourth Annual ACM SIGPLAN-SIGACT Symp. Principles of Programming Languages, Los Angeles, CA, January 17\u201319, pp. 238\u2013252. ACM Press, New York, NY.","DOI":"10.1145\/512950.512973"},{"key":"key\n\t\t\t\t20171012000856_B6","doi-asserted-by":"crossref","unstructured":"Kildall, G. (1973) A unified approach to global program optimization. In Proc. 1st Annual ACM Symp. Principles of Programming Languages, Boston, MA, October 1\u20133, pp. 194\u2013206. ACM Press, New York, NY.","DOI":"10.1145\/512927.512945"},{"key":"key\n\t\t\t\t20171012000856_B7","doi-asserted-by":"crossref","unstructured":"Leroy, X. (2003) Java bytecode verification: algorithms and formalizations. J. Autom. Reasoning, 30, 235\u2013269.","DOI":"10.1023\/A:1025055424017"},{"key":"key\n\t\t\t\t20171012000856_B8","unstructured":"Aho, A. V., Sethi, R. and Ullman, J. (1986) Compilers: Principles, Techniques, and Tools. Addison-Wesley Longman Publishing Co, Inc., Reading, MA."},{"key":"key\n\t\t\t\t20171012000856_B9","doi-asserted-by":"crossref","unstructured":"Lengauer, T. and Tarjan, R. E. (1979) A fast algorithm for finding dominators in a flowgraph. ACM Trans. Prog. Lang. Syst., 1(1), 121\u2013141.","DOI":"10.1145\/357062.357071"},{"key":"key\n\t\t\t\t20171012000856_B10","doi-asserted-by":"crossref","unstructured":"Barbuti, R., Bernardeschi, C. and De Francesco, N. (2004) Analyzing information flow properties in assembly code by abstract interpretation. Comput. J., 47, 25\u201345.","DOI":"10.1093\/comjnl\/47.1.25"},{"key":"key\n\t\t\t\t20171012000856_B11","doi-asserted-by":"crossref","unstructured":"Rose, E. (2003) Lightweight bytecode verification. J. Autom. Reasoning, 31, 303\u2013334.","DOI":"10.1023\/B:JARS.0000021015.15794.82"},{"key":"key\n\t\t\t\t20171012000856_B12","doi-asserted-by":"crossref","unstructured":"Necula, G. C. (1997) Proof-carrying code. In Proc. 24th ACM SIGPLAN-SIGACT Symp. Principles of Programming Languages (POPL '97), Paris, France, January 15\u201317, pp. 106\u2013119. ACM Press, New York, NY.","DOI":"10.1145\/263699.263712"},{"key":"key\n\t\t\t\t20171012000856_B13","doi-asserted-by":"crossref","unstructured":"Leroy, X. (2002) Bytecode verification for Java smart card. Software Pract. Exper., 32, 319\u2013340.","DOI":"10.1002\/spe.438"},{"key":"key\n\t\t\t\t20171012000856_B14","unstructured":"Deville, D. and Grimaud, G. (2002) Building an \u2018impossible\u2019 verifier on a Java Card. In Proc. 2nd USENIX Workshop on Industrial Experiences with Systems Software, Boston, MA, December 8, pp. 15\u201324. USENIX, Berkeley, CA."},{"key":"key\n\t\t\t\t20171012000856_B15","doi-asserted-by":"crossref","unstructured":"Bernardeschi, C., Lettieri, G., Martini, L. and Masci, P. (2005) A space-aware bytecode verifier for Java cards. In Spoto, F. (ed.), First Workshop on Bytecode Semantics, Verification, Analysis and Transformation (BYTECODE'05), Edinburgh, Scotland, April 9, ENTCS, pp. 216\u2013232. Elsevier, New York, NY.","DOI":"10.1016\/j.entcs.2005.02.027"},{"key":"key\n\t\t\t\t20171012000856_B16","doi-asserted-by":"crossref","unstructured":"Naccache, D., Tchoulkine, A., Tymen, C. and Trichina, E. (2003) Reducing the memory complexity of type-inference algorithms. In Deng, R., Quing, S., Bao, F. and Zhou, J. (eds), Information and communications security, Singapore, December 9\u201312, LNCS2513, pp. 109\u2013121. Springer-Verlag, Berlin, Germany.","DOI":"10.1007\/3-540-36159-6_10"},{"key":"key\n\t\t\t\t20171012000856_B17","doi-asserted-by":"crossref","unstructured":"Stata, R. and Abadi, M. (1999) A type system for Java bytecode subroutine. ACM Trans. Prog. Lang. Syst., 21, 90\u2013137.","DOI":"10.1145\/314602.314606"},{"key":"key\n\t\t\t\t20171012000856_B18","doi-asserted-by":"crossref","unstructured":"Coglio, A. (2004) Simple verification technique for complex Java bytecode subroutines. Concurrency Pract. Ex., 16, 647\u2013670.","DOI":"10.1002\/cpe.798"},{"key":"key\n\t\t\t\t20171012000856_B19","unstructured":"Freund, S. N. (1998) The costs and benefits of Java bytecode subroutines. In Proc. Formal Underpinnings of Java Workshop at OOPSLA, Vancouver, BC, Canada, October, ACM Press, New York, NY."},{"key":"key\n\t\t\t\t20171012000856_B20","unstructured":"Bernardeschi, C., Martini, L. and Masci, P. (2004) Java bytecode verification with dynamic structures. In Proc 8th IASTED Int. Conf. Software Engineering and Applications (SEA), Cambridge, MA, November 9\u201311, pp. 559\u2013564. ACTA press, Calgary, Canada."}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/comjnl\/article-pdf\/49\/2\/234\/1199659\/bxh161.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,12]],"date-time":"2020-04-12T07:21:32Z","timestamp":1586676092000},"score":1,"resource":{"primary":{"URL":"http:\/\/academic.oup.com\/comjnl\/article\/49\/2\/234\/436610\/Using-Control-Dependencies-for-SpaceAware-Bytecode"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,1,23]]},"references-count":20,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2006,1,23]]},"published-print":{"date-parts":[[2006,3,1]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxh161","relation":{},"ISSN":["1460-2067","0010-4620"],"issn-type":[{"value":"1460-2067","type":"electronic"},{"value":"0010-4620","type":"print"}],"subject":[],"published-other":{"date-parts":[[2006,3]]},"published":{"date-parts":[[2006,1,23]]}}}