{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,13]],"date-time":"2023-11-13T17:25:24Z","timestamp":1699896324328},"reference-count":20,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2004,4,1]],"date-time":"2004-04-01T00:00:00Z","timestamp":1080777600000},"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":3406,"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":[[2004,4]]},"DOI":"10.1016\/s1571-0661(05)82597-6","type":"journal-article","created":{"date-parts":[[2005,5,19]],"date-time":"2005-05-19T13:46:30Z","timestamp":1116510390000},"page":"362-376","source":"Crossref","is-referenced-by-count":1,"title":["Code Annotation for Safe and Efficient Dynamic Object Resolution"],"prefix":"10.1016","volume":"82","author":[{"given":"Andreas","family":"Hartmann","sequence":"first","affiliation":[]},{"given":"Wolfram","family":"Amme","sequence":"additional","affiliation":[]},{"given":"Jeffery","family":"von Ronne","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Franz","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(05)82597-6_BIB1","series-title":"SIGPLAN '01 Conference on Programming Language Design and Implementation","first-page":"137","article-title":"SafeTSA: A type safe and referentially secure mobile-code representation based on static single assignment form","author":"Amme","year":"2001"},{"key":"10.1016\/S1571-0661(05)82597-6_BIB2","series-title":"10th International Workshop on Compilers for Parallel Computers (CPC)","article-title":"Using the safetsa representation to boost the performance of an existing java virtual machine","author":"Amme","year":"2003"},{"issue":"6","key":"10.1016\/S1571-0661(05)82597-6_BIB3","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1002\/1096-9128(200005)12:6<423::AID-CPE483>3.0.CO;2-L","article-title":"An annotation-aware java virtual machine implementation","volume":"12","author":"Azevedo","year":"2000","journal-title":"Concurrency - Practice and Experience"},{"issue":"10","key":"10.1016\/S1571-0661(05)82597-6_BIB4","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1145\/320385.320387","article-title":"Escape analysis for object-oriented languages: application to Java","volume":"34","author":"Blanchet","year":"1999","journal-title":"ACM SIGPLAN Notices"},{"key":"10.1016\/S1571-0661(05)82597-6_BIB5","series-title":"Conference on Object-Oriented","first-page":"1","article-title":"Escape analysis for java","author":"Choi","year":"1999"},{"issue":"6","key":"10.1016\/S1571-0661(05)82597-6_BIB6","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1145\/773473.178263","article-title":"Interprocedural may-alias analysis for pointers: beyond k-limiting","volume":"29","author":"Deutsch","year":"1994","journal-title":"ACM SIGPLAN Notices"},{"key":"10.1016\/S1571-0661(05)82597-6_BIB7","article-title":"Marmot: An optimizing compiler for Java","volume":"3","author":"Fitzgerald","year":"2000"},{"key":"10.1016\/S1571-0661(05)82597-6_BIB8","article-title":"Tamper proof annotations","volume":"02-10","author":"Franz","year":"2002"},{"key":"10.1016\/S1571-0661(05)82597-6_BIB9","article-title":"Fast escape analysis and stack allocation for object-based programs","volume":"volume 1781","author":"Gay","year":"2000"},{"issue":"3","key":"10.1016\/S1571-0661(05)82597-6_BIB10","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1017\/S0956796898003025","article-title":"A type-based escape analysis for functional languages","volume":"8","author":"Hannan","year":"1998","journal-title":"Journal of Functional Programming"},{"key":"10.1016\/S1571-0661(05)82597-6_BIB11","unstructured":"L. Hederman. Compile-time Garbage Collection Using Reference Count Analysis. PhD thesis, Rice University, Aug. 1988. Also Rice University Technical Report TR88-75 but, according to Rice University's technical report list, this report is no longer available for distribution."},{"key":"10.1016\/S1571-0661(05)82597-6_BIB12","series-title":"Proceedings of the 1986 ACM Conference on Lisp and Functional Programming","first-page":"351","article-title":"A semantic model of reference counting and its abstraction","author":"Hudak","year":"1986"},{"key":"10.1016\/S1571-0661(05)82597-6_BIB13","series-title":"SIGPLAN Conference on Programming Language Design and Implementation","first-page":"156","article-title":"Using annotation to reduce dynamic optimization time","author":"Krintz","year":"2001"},{"key":"10.1016\/S1571-0661(05)82597-6_BIB14","unstructured":"C. McDowell. Garbage reduction in java. In Internet Publication http:\/\/www.cse.ucsc.edu\/research\/embedded\/pubs\/gc, 1982."},{"key":"10.1016\/S1571-0661(05)82597-6_BIB15","series-title":"Partial Evaluation and Semantic-Based Program Manipulation","first-page":"178","article-title":"Reference escape analysis: Optimizing reference counting based on the lifetime of references","author":"Park","year":"1991"},{"key":"10.1016\/S1571-0661(05)82597-6_BIB16","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1145\/379539.379553","article-title":"Pointer and escape analysis for multithreaded programs","author":"Salcianu","year":"2001","journal-title":"Principles Practice of Parallel Programming"},{"key":"10.1016\/S1571-0661(05)82597-6_BIB17","series-title":"Proceedings of the 1fst International Conference on Functional Programming","first-page":"12","article-title":"Storage use analysis and its applications","author":"Serrano","year":"1996"},{"key":"10.1016\/S1571-0661(05)82597-6_BIB18","series-title":"Symposium on Principles of Programming Languages","first-page":"32","article-title":"Points-to analysis in almost linear time","author":"Steensgaard","year":"1996"},{"key":"10.1016\/S1571-0661(05)82597-6_BIB19","series-title":"SIGPLAN Conference on Programming Language Design and Implementation","first-page":"35","article-title":"Incrementalized pointer and escape analysis","author":"Vivien","year":"2001"},{"issue":"10","key":"10.1016\/S1571-0661(05)82597-6_BIB20","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1145\/320385.320400","article-title":"Compositional pointer and escape analysis for Java programs","volume":"34","author":"Whaley","year":"1999","journal-title":"ACM SIGPLAN Notices"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105825976?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105825976?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,5,3]],"date-time":"2023-05-03T07:31:26Z","timestamp":1683099086000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066105825976"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,4]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2004,4]]}},"alternative-id":["S1571066105825976"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)82597-6","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2004,4]]}}}