{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T08:46:07Z","timestamp":1780994767342,"version":"3.54.1"},"reference-count":25,"publisher":"Association for Computing Machinery (ACM)","issue":"PLDI","license":[{"start":{"date-parts":[[2024,6,20]],"date-time":"2024-06-20T00:00:00Z","timestamp":1718841600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100015178","name":"IBM Canada","doi-asserted-by":"publisher","award":["1101, 1156"],"award-info":[{"award-number":["1101, 1156"]}],"id":[{"id":"10.13039\/100015178","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. ACM Program. Lang."],"published-print":{"date-parts":[[2024,6,20]]},"abstract":"<jats:p>\n            The runtimes of managed object-oriented languages such as Java allocate objects on the heap, and rely on automatic garbage collection (GC) techniques for freeing up unused objects. Most such runtimes also consist of just-in-time (JIT) compilers that optimize memory access and GC times by employing\n            <jats:italic toggle=\"yes\">escape analysis:<\/jats:italic>\n            an object that does not escape (outlive) its allocating method can be allocated on (and freed up with) the stack frame of the corresponding method. However, in order to minimize the time spent in JIT compilation, the\n            <jats:bold>scope of such useful analyses is quite limited, thereby restricting their precision significantly. On the contrary,<\/jats:bold>\n            even though it is feasible to perform precise program analyses statically, it is not possible to use their results in a managed runtime without a closed-world assumption. In this paper, we propose a static+dynamic scheme that allows one to harness the results of a precise static escape analysis for allocating objects on stack, while taking care of both soundness and efficiency concerns in the runtime.\n          <\/jats:p>\n          <jats:p>\n            Our scheme comprises of three key ideas. First, using the results of a statically performed escape analysis, it performs\n            <jats:italic toggle=\"yes\">optimistic stack allocation<\/jats:italic>\n            during JIT compilation. Second, it handles the challenges associated with features that may invalidate the optimism, using a novel idea of\n            <jats:italic toggle=\"yes\">dynamic heapification.<\/jats:italic>\n            Third, it uses another novel notion of\n            <jats:italic toggle=\"yes\">stack ordering,<\/jats:italic>\n            again supported by a static analysis, to reduce the overheads associated with the checks that determine the need for heapification. The static and the runtime components of our approach are implemented in the Soot optimization framework and in the tiered infrastructure of the Eclipse OpenJ9 VM, respectively. To evaluate the benefits, we compare our scheme with the existing escape analysis and find that it succeeds in allocating a much larger number of objects on the stack. Furthermore, the enhanced stack allocation leads to a significant reduction in the number of GC cycles and brings decent performance improvements, especially suited for constrained-memory environments.\n          <\/jats:p>","DOI":"10.1145\/3656389","type":"journal-article","created":{"date-parts":[[2024,6,20]],"date-time":"2024-06-20T16:27:20Z","timestamp":1718900840000},"page":"296-319","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Optimistic Stack Allocation and Dynamic Heapification for Managed Runtimes"],"prefix":"10.1145","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3752-3908","authenticated-orcid":false,"given":"Aditya","family":"Anand","sequence":"first","affiliation":[{"name":"Indian Institute of Technology Bombay, Mumbai, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-6108-150X","authenticated-orcid":false,"given":"Solai","family":"Adithya","sequence":"additional","affiliation":[{"name":"Indian Institute of Technology Mandi, Mandi, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-4685-2052","authenticated-orcid":false,"given":"Swapnil","family":"Rustagi","sequence":"additional","affiliation":[{"name":"Indian Institute of Technology Mandi, Mandi, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-1414-9837","authenticated-orcid":false,"given":"Priyam","family":"Seth","sequence":"additional","affiliation":[{"name":"Indian Institute of Technology Mandi, Mandi, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-9342-4356","authenticated-orcid":false,"given":"Vijay","family":"Sundaresan","sequence":"additional","affiliation":[{"name":"IBM Canada Lab, Markham, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-8467-3270","authenticated-orcid":false,"given":"Daryl","family":"Maier","sequence":"additional","affiliation":[{"name":"IBM Canada Lab, Markham, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5949-0046","authenticated-orcid":false,"given":"V. Krishna","family":"Nandivada","sequence":"additional","affiliation":[{"name":"Indian Institute of Technology Madras, Chennai, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0740-9701","authenticated-orcid":false,"given":"Manas","family":"Thakur","sequence":"additional","affiliation":[{"name":"Indian Institute of Technology Bombay, Mumbai, India"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2024,6,20]]},"reference":[{"key":"e_1_3_1_2_1","doi-asserted-by":"publisher","DOI":"10.1147\/sj.391.0211"},{"key":"e_1_3_1_3_1","doi-asserted-by":"publisher","DOI":"10.5281\/zenodo.10804712"},{"key":"e_1_3_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-22308-2_4"},{"key":"e_1_3_1_5_1","first-page":"169","article-title":"The DaCapo Benchmarks: Java Benchmarking Development and Analysis","author":"Blackburn M.","year":"2006","unstructured":"Stephen M. Blackburn Robin Garner, Chris Hoffmann, Asjad M. Khang Kathryn S. McKinley Rotem Bentzur, Amer Diwan, Daniel Feinberg, Daniel Frampton, Samuel Z. Guyer Martin Hirzel, Antony Hosking, Maria Jump, Han Lee, J. Eliot B. Moss Aashish Phansalkar, Darko Stefanovic, Thomas VanDrunen, Daniel von Dincklage, and Ben Wiedermann. 2006. The DaCapo Benchmarks: Java Benchmarking Development and Analysis. In Proceedings of the 21st Annual ACM SIGPLAN Conference on Object-oriented Programming Systems, Languages, and Applications (Portland, Oregon, USA) (OOPSLA \u201806). ACM, New York, NY, USA, 169-190.","journal-title":"Proceedings of the 21st Annual ACM SIGPLAN Conference on Object-oriented Programming Systems, Languages, and Applications"},{"key":"e_1_3_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/945885.945886"},{"key":"e_1_3_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1985793.1985827"},{"key":"e_1_3_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/320384.320386"},{"key":"e_1_3_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/512529.512560"},{"key":"e_1_3_1_10_1","first-page":"484","article-title":"Runtime Support of Speculative Optimization for Offline Escape Analysis","author":"Cleereman Kevin","year":"2007","unstructured":"Kevin Cleereman, Michelle Cheatham, and Krishnaprasad Thirunarayan. 2007. Runtime Support of Speculative Optimization for Offline Escape Analysis. In Proceedings of the International Conference on Software Engineering Research and Practice. 484-489. https:\/\/corescholar.libraries.wright.edu\/knoesis\/884","journal-title":"Proceedings of the International Conference on Software Engineering Research and Practice."},{"key":"e_1_3_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1133956.1133978"},{"key":"e_1_3_1_12_1","volume-title":"Eclipse OpenJ9","author":"Eclipse Foundation","year":"2023","unstructured":"Eclipse Foundation. 2023. Eclipse OpenJ9. https:\/\/www.eclipse.org\/openj9\/"},{"key":"e_1_3_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1064979.1064996"},{"key":"e_1_3_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/CGO.2007.34"},{"key":"e_1_3_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36579-6_12"},{"key":"e_1_3_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1044834.1044835"},{"key":"e_1_3_1_17_1","first-page":"173","article-title":"U Can\u2019t Inline This!","author":"Ochoa Erick","year":"2021","unstructured":"Erick Ochoa, Cijie Xia, Karim Ali, Andrew Craik, and Jose Nelson Amaral. 2021. U Can\u2019t Inline This!. In Proceedings of the 31st Annual International Conference on Computer Science and Software Engineering (Toronto, Canada) (CASCON \u201821). IBM Corp., USA, 173-182.","journal-title":"Proceedings of the 31st Annual International Conference on Computer Science and Software Engineering"},{"key":"e_1_3_1_18_1","unstructured":"OpenJDK Graal. 2023. GraalVM. https:\/\/www.graalvm.org."},{"key":"e_1_3_1_19_1","article-title":"The Java HotspotTM Server Compiler","volume":"1","author":"Paleczny Michael","year":"2001","unstructured":"Michael Paleczny, Christopher Vick, and Cliff Click. 2001. The Java HotspotTM Server Compiler. In Proceedings of the 2001 Symposium on JavaTM Virtual Machine Research and Technology Symposium - Volume 1 (Monterey, California) (JVM\u201901). USENIX Association, USA, 1.","journal-title":"Proceedings of the 2001 Symposium on JavaTM Virtual Machine Research and Technology Symposium - Volume 1"},{"key":"e_1_3_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1926385.1926390"},{"key":"e_1_3_1_21_1","volume-title":"SPECjvm 2008","author":"SPEC","year":"2008","unstructured":"SPEC. 2008. SPECjvm 2008. https:\/\/www.spec.org\/jvm2008\/"},{"key":"e_1_3_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2544137.2544157"},{"key":"e_1_3_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3337794"},{"key":"e_1_3_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/291891.291894"},{"key":"e_1_3_1_25_1","first-page":"13","article-title":"Soot - a Java Bytecode Optimization Framework","author":"Vallee-Rai Raja","year":"1999","unstructured":"Raja Vallee-Rai, Phong Co, Etienne Gagnon, Laurie Hendren, Patrick Lam, and Vijay Sundaresan. 1999. Soot - a Java Bytecode Optimization Framework. In Proceedings of the 1999 Conference of the Centre for Advanced Studies on Collaborative Research (Mississauga, Ontario, Canada) (CASCON \u201899). IBM Press, 13-23. http:\/\/dl.acm.org\/citation.cfm?id=781995.782008","journal-title":"Proceedings of the 1999 Conference of the Centre for Advanced Studies on Collaborative Research"},{"key":"e_1_3_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/320384.320400"}],"container-title":["Proceedings of the ACM on Programming Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3656389","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3656389","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T20:43:35Z","timestamp":1751661815000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3656389"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,20]]},"references-count":25,"journal-issue":{"issue":"PLDI","published-print":{"date-parts":[[2024,6,20]]}},"alternative-id":["10.1145\/3656389"],"URL":"https:\/\/doi.org\/10.1145\/3656389","relation":{},"ISSN":["2475-1421"],"issn-type":[{"value":"2475-1421","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,6,20]]},"assertion":[{"value":"2024-06-20","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}