{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,24]],"date-time":"2026-02-24T18:54:40Z","timestamp":1771959280672,"version":"3.50.1"},"reference-count":59,"publisher":"Association for Computing Machinery (ACM)","issue":"OOPSLA2","license":[{"start":{"date-parts":[[2024,10,8]],"date-time":"2024-10-08T00:00:00Z","timestamp":1728345600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"IBM CAS","award":["1156"],"award-info":[{"award-number":["1156"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. ACM Program. Lang."],"published-print":{"date-parts":[[2024,10,8]]},"abstract":"<jats:p>Data-flow analyses like points-to analysis can vastly improve the precision of other analyses, and enable powerful code optimizations. However, whole-program points-to analysis of large Java programs tends to be expensive \u2013 both in terms of time and memory. Consequently, many compilers (both static and JIT) and program-analysis tools tend to employ faster \u2013 but more conservative \u2013 points-to analyses to improve usability. As an alternative to such trading of precision for performance, various techniques have been proposed to perform precise yet expensive fixed-point points-to analyses ahead of time in a static analyzer, store the results, and then transmit them to independent compilation\/program-analysis stages that may need them. However, an underlying concern of safety affects all such techniques \u2013 can a compiler (or program analysis tool) trust the points-to analysis results generated by another compiler\/tool?<\/jats:p>\n                  <jats:p>\n                    In this work, we address this issue of trust in the context of Java, while accounting for the issue of performance. We propose\n                    <jats:bold>ART<\/jats:bold>\n                    : Analysis-Results Representation Template \u2013 a novel scheme to efficiently and concisely encode results of flow-sensitive, context-insensitive points-to analysis computed by a static analyzer for use in any independent system that may benefit from such a precise points-to analysis. ART also allows for fast regeneration of the encoded sound analysis results in such systems. Our scheme has two components: (i) a producer that can statically perform expensive points-to analysis and encode the same concisely, (ii) a consumer that, on receiving such encoded results (called\n                    <jats:sc>art<\/jats:sc>\n                    work), can regenerate the points-to analysis results encoded by the\n                    <jats:sc>art<\/jats:sc>\n                    work if it is deemed \u201csafe\u201d. The regeneration scheme completely avoids fixed-point computations and thus can help consumers like static analyzers and JIT compilers to obtain precise points-to information without paying a prohibitively high cost. We demonstrate the usage of ART by implementing a producer (in Soot) and two consumers (in Soot and the Eclipse OpenJ9 JIT compiler). We have evaluated our implementation over various benchmarks from the DaCapo and SPECjvm2008 suites. Our results demonstrate that using ART, a consumer can obtain precise flow-sensitive, context-insensitive points-to analysis results in less than (average) 1% of the time taken by a static analyzer to perform the same analysis, with the storage overhead of ART representing a small fraction of the program size (average around 4%).\n                  <\/jats:p>","DOI":"10.1145\/3689803","type":"journal-article","created":{"date-parts":[[2024,10,8]],"date-time":"2024-10-08T03:23:04Z","timestamp":1728357784000},"page":"2606-2632","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["The ART of Sharing Points-to Analysis: Reusing Points-to Analysis Results Safely and Efficiently"],"prefix":"10.1145","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1268-4345","authenticated-orcid":false,"given":"Shashin","family":"Halalingaiah","sequence":"first","affiliation":[{"name":"IIT Madras, Chennai, India"},{"name":"University of Texas at Austin, Austin, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"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":[{"role":"author","vocabulary":"crossref"}]},{"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":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5949-0046","authenticated-orcid":false,"given":"V. Krishna","family":"Nandivada","sequence":"additional","affiliation":[{"name":"IIT Madras, Chennai, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,10,8]]},"reference":[{"key":"e_1_3_1_2_2","volume-title":"The Separate Compilation Assumption","author":"Ali Karim","year":"2014","unstructured":"Karim Ali. 2014. The Separate Compilation Assumption. Ph. D. Dissertation. University of Waterloo, Waterloo, Canada. https:\/\/plg.uwaterloo.ca\/~olhotak\/pubs\/thesis-karim-phd.pdf"},{"key":"e_1_3_1_3_2","doi-asserted-by":"publisher","DOI":"10.1147\/sj.442.0399"},{"key":"e_1_3_1_4_2","first-page":"24","article-title":"Optimistic Stack Allocation and Dynamic Heapification for Managed Runtimes","volume":"8","author":"Anand Aditya","year":"2024","unstructured":"Aditya Anand, Solai Adithya, Swapnil Rustagi, Priyam Seth, Vijay Sundaresan, Daryl Maier, V. Krishna Nandivada, and Manas Thakur. 2024. Optimistic Stack Allocation and Dynamic Heapification for Managed Runtimes. Proc. ACM Program. Lang. 8, PLDI, Article 159 (Jun 2024), 24 pages. https:\/\/doi.org\/10.1145\/3656389 10.1145\/3656389","journal-title":"Proc. ACM Program. Lang."},{"issue":"4","key":"e_1_3_1_5_2","first-page":"69","article-title":"Verification Witnesses","volume":"31","author":"Beyer Dirk","year":"2022","unstructured":"Dirk Beyer, Matthias Dangl, Daniel Dietsch, Matthias Heizmann, Thomas Lemberger, and Michael Tautschnig. 2022. Verification Witnesses. ACM Trans. Softw. Eng. Methodol. 31, 4, Article 57 (sep 2022), 69 pages. https:\/\/doi.org\/10.1145\/3477579 10.1145\/3477579","journal-title":"ACM Trans. Softw. Eng. Methodol."},{"key":"e_1_3_1_6_2","doi-asserted-by":"publisher","DOI":"10.1145\/1167473.1167488"},{"key":"e_1_3_1_7_2","first-page":"241","volume-title":"Proceedings of the 33rd International Conference on Software Engineering(ICSE \u201911)","author":"Bodden Eric","unstructured":"Eric Bodden, Andreas Sewe, Jan Sinschek, Hela Oueslati, and Mira Mezini. 2011. Taming Reflection: Aiding Static Analysis in the Presence of Reflection and Custom Class Loaders. In Proceedings of the 33rd International Conference on Software Engineering (Waikiki, Honolulu, HI, USA) (ICSE \u201911). Association for Computing Machinery, New York, NY, USA, 241\u2013250. https:\/\/doi.org\/10.1145\/1985793.1985827 10.1145\/1985793.1985827"},{"key":"e_1_3_1_8_2","doi-asserted-by":"publisher","DOI":"10.1145\/1640089.1640108"},{"issue":"6","key":"e_1_3_1_9_2","first-page":"66","article-title":"Compositional Shape Analysis by Means of Bi-Abduction","volume":"58","author":"Calcagno Cristiano","year":"2011","unstructured":"Cristiano Calcagno, Dino Distefano, Peter W. O\u2019Hearn, and Hongseok Yang. 2011. Compositional Shape Analysis by Means of Bi-Abduction. J. ACM 58, 6, Article 26 (Dec. 2011), 66 pages. https:\/\/doi.org\/10.1145\/2049697.2049700 10.1145\/2049697.2049700","journal-title":"J. ACM"},{"key":"e_1_3_1_10_2","first-page":"1","volume-title":"Proceedings of the 14th ACM SIGPLAN Conference on Object-oriented Programming, Systems, Languages, and Applications(OOPSLA \u201999)","author":"Gupta Manish","year":"1999","unstructured":"Jong-Deok Choi, Manish Gupta, Mauricio Serrano, Vugranam C. Sreedhar, and Sam Midkiff. 1999. Escape Analysis for Java. In Proceedings of the 14th ACM SIGPLAN Conference on Object-oriented Programming, Systems, Languages, and Applications (Denver, Colorado, USA) (OOPSLA \u201999). ACM, New York, NY, USA, 1\u201319. https:\/\/doi.org\/10.1145\/320384.320386 10.1145\/320384.320386"},{"key":"e_1_3_1_11_2","doi-asserted-by":"publisher","DOI":"10.5555\/647478.727794"},{"key":"e_1_3_1_12_2","first-page":"665","volume-title":"ECOOP 2012 \u2013 Object-Oriented Programming, James","author":"De Arnab","year":"2012","unstructured":"Arnab De and Deepak D\u2019Souza. 2012. Scalable Flow-Sensitive Pointer Analysis for Java with Strong Updates. In ECOOP 2012 \u2013 Object-Oriented Programming, James Noble (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg, 665\u2013687. https:\/\/doi.org\/10.1007\/978-3-642-31057-7_29 10.1007\/978-3-642-31057-7_29"},{"key":"e_1_3_1_13_2","doi-asserted-by":"publisher","DOI":"10.5555\/646153.679523"},{"key":"e_1_3_1_14_2","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/978-3-662-58820-8_22","volume-title":"Financial Cryptography and Data Security","author":"Dickerson Thomas","year":"2019","unstructured":"Thomas Dickerson, Paul Gazzillo, Maurice Herlihy, Vikram Saraph, and Eric Koskinen. 2019. Proof-Carrying Smart Contracts. In Financial Cryptography and Data Security, Aviv Zohar, Ittay Eyal, Vanessa Teague, Jeremy Clark, Andrea Bracciali, Federico Pintore, and Massimiliano Sala (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 325\u2013338. https:\/\/doi.org\/10.1007\/978-3-662-58820-8_22 10.1007\/978-3-662-58820-8_22"},{"key":"e_1_3_1_15_2","doi-asserted-by":"publisher","DOI":"10.1145\/2814270.2814307"},{"key":"e_1_3_1_16_2","first-page":"30","article-title":"LiveDroid: Identifying and Preserving Mobile App State in Volatile Runtime Environments","volume":"4","author":"Farooq Umar","year":"2020","unstructured":"Umar Farooq, Zhijia Zhao, Manu Sridharan, and Iulian Neamtiu. 2020. LiveDroid: Identifying and Preserving Mobile App State in Volatile Runtime Environments. Proc. ACM Program. Lang. 4, OOPSLA, Article 160 (nov 2020), 30 pages. https:\/\/doi.org\/10.1145\/3428228 10.1145\/3428228","journal-title":"Proc. ACM Program. Lang."},{"key":"e_1_3_1_17_2","first-page":"26","article-title":"Synthesizing Fine-grained Synchronization Protocols for Implicit Monitors","volume":"6","author":"Ferles Kostas","year":"2022","unstructured":"Kostas Ferles, Benjamin Sepanski, Rahul Krishnan, James Bornholt, and Isil Dillig. 2022. Synthesizing Fine-grained Synchronization Protocols for Implicit Monitors. Proc. ACM Program. Lang. 6, OOPSLA1, Article 67 (apr 2022), 26 pages. https:\/\/doi.org\/10.1145\/3527311 10.1145\/3527311","journal-title":"Proc. ACM Program. Lang."},{"key":"e_1_3_1_18_2","doi-asserted-by":"publisher","DOI":"10.1145\/1297027.1297033"},{"key":"e_1_3_1_19_2","unstructured":"Github. 2015. Problem using Booster and the play-out agent. Github. https:\/\/github.com\/secure-software-engineering\/tamiflex\/issues\/1"},{"key":"e_1_3_1_20_2","unstructured":"Github. 2018. FATAL ERROR while using Play In Agent Tamiflex Issue #940. Github. https:\/\/github.com\/soot-oss\/soot\/issues\/940"},{"key":"e_1_3_1_21_2","unstructured":"Github. 2021. PlayOutAgent fails with OpenJ9 JDK \u2022 Issue #11 \u2022 secure-software-engineering\/tamiflex. Github. https:\/\/github.com\/secure-software-engineering\/tamiflex\/issues\/11"},{"key":"e_1_3_1_22_2","doi-asserted-by":"publisher","DOI":"10.1145\/22145.22178"},{"key":"e_1_3_1_23_2","doi-asserted-by":"publisher","DOI":"10.1145\/3213846.3213860"},{"key":"e_1_3_1_24_2","volume-title":"The ART of Sharing Points-to Analysis (Extended Abstract)","author":"Halalingaiah Shashin","year":"2024","unstructured":"Shashin Halalingaiah, Vijay Sundaresan, Daryl Maier, and V.Krishna Nandivada. 2024. The ART of Sharing Points-to Analysis (Extended Abstract). Technical Report. IIT Madras. http:\/\/cse.iitm.ac.in\/~krishna\/preprints\/oopsla24\/oopsla-ea-24.pdf"},{"key":"e_1_3_1_25_2","first-page":"30","article-title":"A Container-Usage-Pattern-Based Context Debloating Approach for Object-Sensitive Pointer Analysis","volume":"7","author":"He Dongjie","year":"2023","unstructured":"Dongjie He, Yujiang Gui, Wei Li, Yonggang Tao, Changwei Zou, Yulei Sui, and Jingling Xue. 2023. A Container-Usage-Pattern-Based Context Debloating Approach for Object-Sensitive Pointer Analysis. Proc. ACM Program. Lang. 7, OOPSLA2, Article 256 (oct 2023), 30 pages. https:\/\/doi.org\/10.1145\/3622832 10.1145\/3622832","journal-title":"Proc. ACM Program. Lang."},{"key":"e_1_3_1_26_2","unstructured":"IBM. 2017. Eclipse OpenJ9. IBM. https:\/\/github.com\/eclipse\/openj9"},{"key":"e_1_3_1_27_2","first-page":"1","volume-title":"5th International Conference on Sustainable Technologies for Industry 5.0 (STI).","author":"Islam Md. Jahidul","year":"2023","unstructured":"Md. Jahidul Islam, A.T.M Mizanur Rahman, and Sohel Rana. 2023. Performance Analysis of Modern Garbage Collectors using Big Data Benchmarks in the JDK 20 Environment. In 5th International Conference on Sustainable Technologies for Industry 5.0 (STI). IEEE, 1\u20136. https:\/\/doi.org\/10.1109\/STI59863.2023.10464900 10.1109\/STI59863.2023.10464900"},{"key":"e_1_3_1_28_2","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1145\/2491956.2462191","volume-title":"Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation (Seattle, Washington, USA) (PLDI \u201913)","author":"Kastrinis George","year":"2013","unstructured":"George Kastrinis and Yannis Smaragdakis. 2013. Hybrid Context-sensitivity for Points-to Analysis. In Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation (Seattle, Washington, USA) (PLDI \u201913). Association for Computing Machinery, New York, NY, USA, 423\u2013434. https:\/\/doi.org\/10.1145\/2491956.2462191 10.1145\/2491956.2462191"},{"key":"e_1_3_1_29_2","first-page":"278","volume-title":"Proceedings of the 28th ACM SIGPLAN Conference on Programming Language Design and Implementation (San Diego, California, USA) (PLDI \u201907)","author":"Lattner Chris","year":"2007","unstructured":"Chris Lattner, Andrew Lenharth, and Vikram Adve. 2007. Making Context-sensitive Points-to analysis with Heap Cloning Practical for the Real World. In Proceedings of the 28th ACM SIGPLAN Conference on Programming Language Design and Implementation (San Diego, California, USA) (PLDI \u201907). Association for Computing Machinery, New York, NY, USA, 278\u2013289. https:\/\/doi.org\/10.1145\/1250734.1250766 10.1145\/1250734.1250766"},{"key":"e_1_3_1_30_2","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/3-540-36579-6_12","volume-title":"Compiler Construction,","author":"Lhot\u00e1k Ond\u0159ej","year":"2003","unstructured":"Ond\u0159ej Lhot\u00e1k and Laurie Hendren. 2003. Scaling Java Points-to Analysis Using Spark. In Compiler Construction, G\u00f6rel Hedin (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg, 153\u2013169. https:\/\/doi.org\/10.1007\/3-540-36579-6_12 10.1007\/3-540-36579-6_12"},{"key":"e_1_3_1_31_2","first-page":"29","article-title":"Precision-guided context sensitivity for pointer analysis","volume":"2","author":"Li Yue","year":"2018","unstructured":"Yue Li, Tian Tan, Anders M\u00f8ller, and Yannis Smaragdakis. 2018. Precision-guided context sensitivity for pointer analysis. Proc. ACM Program. Lang. 2, OOPSLA, Article 141 (oct 2018), 29 pages. https:\/\/doi.org\/10.1145\/3276511 10.1145\/3276511","journal-title":"Proc. ACM Program. Lang."},{"key":"e_1_3_1_32_2","volume-title":"The Java Virtual Machine Specification, Java SE 8 Edition","author":"Lindholm Tim","year":"2014","unstructured":"Tim Lindholm, Frank Yellin, Gilad Bracha, and Alex Buckley. 2014. The Java Virtual Machine Specification, Java SE 8 Edition (1st ed.). Addison-Wesley Professional, USA. https:\/\/docs.oracle.com\/javase\/specs\/jvms\/se8\/html\/","edition":"1"},{"key":"e_1_3_1_33_2","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1145\/1390630.1390657","volume-title":"Proceedings of the 2008 International Symposium on Software Testing and Analysis (ISSTA \u201908)","author":"Loginov Alexey","year":"2008","unstructured":"Alexey Loginov, Eran Yahav, Satish Chandra, Stephen Fink, Noam Rinetzky, and Mangala Nanda. 2008. Verifying Dereference Safety via Expanding-Scope Analysis. In Proceedings of the 2008 International Symposium on Software Testing and Analysis (ISSTA \u201908). Association for Computing Machinery, New York, NY, USA, 213\u2013224. https:\/\/doi.org\/10.1145\/1390630.1390657 10.1145\/1390630.1390657"},{"issue":"4","key":"e_1_3_1_34_2","first-page":"46","article-title":"Eagle: CFL-Reachability-Based Precision-Preserving Acceleration of Object-Sensitive Pointer Analysis with Partial Context Sensitivity","volume":"30","author":"Lu Jingbo","year":"2021","unstructured":"Jingbo Lu, Dongjie He, and Jingling Xue. 2021. Eagle: CFL-Reachability-Based Precision-Preserving Acceleration of Object-Sensitive Pointer Analysis with Partial Context Sensitivity. ACM Trans. Softw. Eng. Methodol. 30, 4, Article 46 (jul 2021), 46 pages. https:\/\/doi.org\/10.1145\/3450492 10.1145\/3450492","journal-title":"ACM Trans. Softw. Eng. Methodol."},{"key":"e_1_3_1_35_2","doi-asserted-by":"publisher","DOI":"10.1561\/2500000020"},{"key":"e_1_3_1_36_2","unstructured":"Misc. 2015. Problem using Booster and the play-out agent. https:\/\/groups.google.com\/g\/tamiflex-discuss\/c\/ZQIagfvlOsI"},{"key":"e_1_3_1_37_2","unstructured":"Misc. 2019. Soot-list Soot Dacapo Issue. https:\/\/mailman.cs.mcgill.ca\/pipermail\/soot-list\/2019-February\/009071.html"},{"key":"e_1_3_1_38_2","doi-asserted-by":"publisher","DOI":"10.1145\/319301.319345"},{"key":"e_1_3_1_39_2","volume-title":"Advanced compiler design and implementation","author":"Muchnick Steven S.","year":"1997","unstructured":"Steven S. Muchnick. 1997. Advanced compiler design and implementation. Morgan Kaufmann Publishers an imprint of Elsevier, Amsterdam. https:\/\/dl.acm.org\/doi\/10.5555\/286076 10.5555\/286076"},{"key":"e_1_3_1_40_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.2009.5070515"},{"key":"e_1_3_1_41_2","doi-asserted-by":"publisher","DOI":"10.1145\/263699.263712"},{"key":"e_1_3_1_42_2","doi-asserted-by":"publisher","DOI":"10.1145\/2487568.2487569"},{"key":"e_1_3_1_43_2","volume-title":"Proceedings of the 2001 Symposium on JavaTM Virtual Machine Research and Technology Symposium - Volume 1 (Monterey, California) (JVM\u201901)","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. https:\/\/www.usenix.org\/conference\/jvm-01\/java-hotspot%E2%84%A2-server-compiler"},{"key":"e_1_3_1_44_2","first-page":"142:1","article-title":"Refinement in object-sensitivity points-to analysis via slicing","volume":"2","author":"Rama Girish Maskeri","year":"2018","unstructured":"Girish Maskeri Rama, Raghavan Komondoor, and Himanshu Sharma. 2018. Refinement in object-sensitivity points-to analysis via slicing. Proc. ACM Program. Lang. 2, OOPSLA (2018), 142:1\u2013142:27. https:\/\/doi.org\/10.1145\/3276512 10.1145\/3276512","journal-title":"Proc. ACM Program. Lang."},{"key":"e_1_3_1_45_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30579-8_14"},{"key":"e_1_3_1_46_2","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1007\/978-3-030-05998-9_13","volume-title":"Practical Aspects of Declarative Languages","author":"Schwaab Christopher","year":"2019","unstructured":"Christopher Schwaab, Ekaterina Komendantskaya, Alasdair Hill, Franti\u0161ek Farka, Ronald P. A. Petrick, Joe Wells, and Kevin Hammond. 2019. Proof-Carrying Plans. In Practical Aspects of Declarative Languages, Jos\u00e9 J\u00falio Alferes and Moa Johansson (Eds.). Springer International Publishing, Cham, 204\u2013220. https:\/\/doi.org\/10.1007\/978-3-030-05998-9_13 10.1007\/978-3-030-05998-9_13"},{"issue":"10","key":"e_1_3_1_47_2","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1145\/354222.353176","article-title":"Quicksilver: A Quasi-Static Compiler for Java","volume":"35","author":"Serrano Mauricio","year":"2000","unstructured":"Mauricio Serrano, Rajesh Bordawekar, Sam Midkiff, and Manish Gupta. 2000. Quicksilver: A Quasi-Static Compiler for Java. SIGPLAN Not. 35, 10 (oct 2000), 66\u201382. https:\/\/doi.org\/10.1145\/354222.353176 10.1145\/354222.353176","journal-title":"SIGPLAN Not."},{"key":"e_1_3_1_48_2","volume-title":"Deferred Data-Flow Analysis","author":"Sharma Shamik","year":"1998","unstructured":"Shamik Sharma, Anurag Acharya, and Joel Saltz. 1998. Deferred Data-Flow Analysis. Technical Report. University of California at Santa Barbara, USA. https:\/\/cs.ucsb.edu\/index.php\/research\/tech-reports\/1998-03"},{"key":"e_1_3_1_49_2","doi-asserted-by":"publisher","DOI":"10.1561\/2500000014"},{"key":"e_1_3_1_50_2","first-page":"17","volume-title":"Proceedings of the 38th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (Austin, Texas, USA) (POPL \u201911)","author":"Smaragdakis Yannis","year":"2011","unstructured":"Yannis Smaragdakis, Martin Bravenboer, and Ondrej Lhot\u00e1k. 2011. Pick Your Contexts Well: Understanding Objectsensitivity. In Proceedings of the 38th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (Austin, Texas, USA) (POPL \u201911). Association for Computing Machinery, New York, NY, USA, 17\u201330. https:\/\/doi.org\/10.1145\/1926385.1926390 10.1145\/1926385.1926390"},{"key":"e_1_3_1_51_2","unstructured":"SPECjvm. 2008. SPECJVM2008. SPEC. https:\/\/www.spec.org\/jvm2008\/"},{"key":"e_1_3_1_52_2","doi-asserted-by":"publisher","DOI":"10.1145\/3062341.3062360"},{"key":"e_1_3_1_53_2","doi-asserted-by":"publisher","DOI":"10.1145\/3302516.3307359"},{"issue":"3","key":"e_1_3_1_54_2","first-page":"37","article-title":"PYE: A Framework for Precise-Yet-Efficient Just-In-Time Analyses for Java Programs","volume":"41","author":"Thakur Manas","year":"2019","unstructured":"Manas Thakur and V. Krishna Nandivada. 2019. PYE: A Framework for Precise-Yet-Efficient Just-In-Time Analyses for Java Programs. ACM Trans. Program. Lang. Syst. 41, 3, Article 16 (jul 2019), 37 pages. https:\/\/doi.org\/10.1145\/3337794 10.1145\/3337794","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"e_1_3_1_55_2","first-page":"27","volume-title":"Proceedings of the 29th International Conference on Compiler Construction (CC 2020)","author":"Thakur Manas","year":"2020","unstructured":"Manas Thakur and V. Krishna Nandivada. 2020. Mix Your Contexts Well: Opportunities Unleashed by Recent Advances in Scaling Context-Sensitivity. In Proceedings of the 29th International Conference on Compiler Construction (CC 2020). Association for Computing Machinery, New York, NY, USA, 27\u201338. https:\/\/doi.org\/10.1145\/3377555.3377902 10.1145\/3377555.3377902"},{"key":"e_1_3_1_56_2","doi-asserted-by":"crossref","first-page":"380","DOI":"10.1109\/ICCKE.2014.6993367","volume-title":"2014 4th International Conference on Computer and Knowledge Engineering (ICCKE)","author":"Toussi Hamid A.","year":"2014","unstructured":"Hamid A. Toussi and Abbas Rasoolzadegan. 2014. Flow-sensitive points-to analysis for Java programs using BDDs. In 2014 4th International Conference on Computer and Knowledge Engineering (ICCKE). IEEE, 380\u2013386. https:\/\/doi.org\/10.1109\/ICCKE.2014.6993367 10.1109\/ICCKE.2014.6993367"},{"key":"e_1_3_1_57_2","volume-title":"Proceedings of the 1999 Conference of the Centre for Advanced Studies on Collaborative Research (Mississauga, Ontario, Canada) (CASCON \u201999)","author":"Vall\u00e9e-Rai Raja","year":"1999","unstructured":"Raja Vall\u00e9e-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 \u201999). IBM Press, 13. https:\/\/dl.acm.org\/doi\/10.5555\/781995.782008 10.5555\/781995.782008"},{"issue":"10","key":"e_1_3_1_58_2","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 John","year":"1999","unstructured":"John Whaley and Martin Rinard. 1999. Compositional Pointer and Escape Analysis for Java Programs. SIGPLAN Not. 34, 10 (oct 1999), 187\u2013206. https:\/\/doi.org\/10.1145\/320385.320400 10.1145\/320385.320400","journal-title":"SIGPLAN Not."},{"key":"e_1_3_1_59_2","doi-asserted-by":"publisher","DOI":"10.1145\/320384.320400"},{"key":"e_1_3_1_60_2","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1109\/ICPADS.2001.934854","volume-title":"Proceedings. Eighth International Conference on Parallel and Distributed Systems. ICPADS 2001","author":"Woo Jongwook","year":"2001","unstructured":"Jongwook Woo, Jehak Woo, I. Attali, D. Caromel, J.-L. Gaudiot, and A.L. Wendelborn. 2001. Alias Analysis for Java with Reference-set Representation. In Proceedings. Eighth International Conference on Parallel and Distributed Systems. ICPADS 2001. IEEE, 459\u2013466. https:\/\/doi.org\/10.1109\/ICPADS.2001.934854 10.1109\/ICPADS.2001.934854"}],"container-title":["Proceedings of the ACM on Programming Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3689803","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3689803","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,4]],"date-time":"2026-02-04T09:05:10Z","timestamp":1770195910000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3689803"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,8]]},"references-count":59,"journal-issue":{"issue":"OOPSLA2","published-print":{"date-parts":[[2024,10,8]]}},"alternative-id":["10.1145\/3689803"],"URL":"https:\/\/doi.org\/10.1145\/3689803","relation":{},"ISSN":["2475-1421"],"issn-type":[{"value":"2475-1421","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,10,8]]},"assertion":[{"value":"2024-04-06","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-08-18","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-10-08","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}