{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,10]],"date-time":"2026-08-10T11:28:26Z","timestamp":1786361306228,"version":"build-2736575974"},"reference-count":103,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2026,8,10]],"date-time":"2026-08-10T00:00:00Z","timestamp":1786320000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key R&D Program of China","doi-asserted-by":"crossref","award":["2023YFB4503804"],"award-info":[{"award-number":["2023YFB4503804"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62402210"],"award-info":[{"award-number":["62402210"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100018925","name":"111 Center","doi-asserted-by":"crossref","award":["B26023"],"award-info":[{"award-number":["B26023"]}],"id":[{"id":"10.13039\/501100018925","id-type":"DOI","asserted-by":"crossref"}]},{"name":"NSF","award":["CCF-2211968 and CCF-2212558"],"award-info":[{"award-number":["CCF-2211968 and CCF-2212558"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Program. Lang. Syst."],"published-print":{"date-parts":[[2026,9,30]]},"abstract":"<jats:p>Over the past decades, context sensitivity has been considered key to improving the precision of whole-program pointer analysis for object-oriented languages such as Java. By analyzing a method under distinct contexts, it separates the static representations of different dynamic instantiations of variables and heap objects, thereby reducing spurious object flows. However, despite its precision benefits, context sensitivity incurs substantial efficiency costs because each method is analyzed multiple times under different contexts. To mitigate this issue, numerous selective context-sensitive approaches have been proposed that apply context sensitivity only to selected methods. However, these approaches do not fully eliminate the efficiency bottleneck because they still rely on the fundamental idea of context sensitivity\u2014analyzing a method multiple times based on calling contexts\u2014which limits scalability on large programs.<\/jats:p>\n                  <jats:p>\n                    In this work, we propose\n                    <jats:sc>Cut-Shortcut<\/jats:sc>\n                    , a fundamentally different approach for fast yet precise Java pointer analysis. The core insight is that the primary benefit of context sensitivity is to filter spurious object flows merged within callee methods; from the perspective of a pointer flow graph, this effect can be obtained without explicit contexts by suppressing the addition of imprecise flow edges (\n                    <jats:italic toggle=\"yes\">Cut<\/jats:italic>\n                    ) and adding\n                    <jats:italic toggle=\"yes\">Shortcut<\/jats:italic>\n                    edges that directly connect source pointers to target pointers across method boundaries. This insight is distilled into a general principle and instantiated via three well-characterized program patterns under which suppressing imprecise flows and adding precise shortcut flows are provably safe. We formalize\n                    <jats:sc>Cut-Shortcut<\/jats:sc>\n                    via inference rules and prove soundness. A context-free-language (CFL) reachability formulation is further provided to relate\n                    <jats:sc>Cut-Shortcut<\/jats:sc>\n                    to well-understood formal models of pointer analysis and to show that\n                    <jats:sc>Cut-Shortcut<\/jats:sc>\n                    has the same worst-case asymptotic complexity as context-insensitive analysis. To address new sources of imprecision introduced in modern Java, we further propose\n                    <jats:sc>Cut-Shortcut<\/jats:sc>\n                    <jats:inline-formula content-type=\"math\/tex\">\n                      <jats:tex-math notation=\"LaTeX\" version=\"MathJax\">\\({}^{\\mathcal{S}}\\)<\/jats:tex-math>\n                    <\/jats:inline-formula>\n                    <jats:sc>,<\/jats:sc>\n                    extending one of the patterns to handle\n                    <jats:italic toggle=\"yes\">Streams<\/jats:italic>\n                    and their interaction with\n                    <jats:italic toggle=\"yes\">Lambda Expressions<\/jats:italic>\n                    by distinguishing flows across different stream pipelines.\n                  <\/jats:p>\n                  <jats:p>\n                    Implemented in the state-of-the-art pointer analysis framework\n                    <jats:sc>Tai-e<\/jats:sc>\n                    ,\n                    <jats:sc>Cut-Shortcut<\/jats:sc>\n                    is evaluated on 10 large, complex Java programs from recent literature, and\n                    <jats:sc>Cut-Shortcut<\/jats:sc>\n                    <jats:inline-formula content-type=\"math\/tex\">\n                      <jats:tex-math notation=\"LaTeX\" version=\"MathJax\">\\({}^{\\mathcal{S}}\\)<\/jats:tex-math>\n                    <\/jats:inline-formula>\n                    is evaluated on three new stream-heavy benchmark suites that we created (with 20 programs in total). Results show that\n                    <jats:sc>Cut-Shortcut<\/jats:sc>\n                    achieves precision close to (selective) context-sensitive analysis (where applicable), while being faster than context-insensitive analysis on 9 of the 10 programs and matching it on the remaining one. Moreover,\n                    <jats:sc>Cut-Shortcut<\/jats:sc>\n                    <jats:inline-formula content-type=\"math\/tex\">\n                      <jats:tex-math notation=\"LaTeX\" version=\"MathJax\">\\({}^{\\mathcal{S}}\\)<\/jats:tex-math>\n                    <\/jats:inline-formula>\n                    yields substantial precision improvement while preserving scalability and efficiency for programs with heavy stream usage. To the best of our knowledge, this work is the first to achieve such a good efficiency-precision tradeoff for hard-to-analyze Java programs, including large-scale and feature-rich applications.\n                  <\/jats:p>","DOI":"10.1145\/3818615","type":"journal-article","created":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T13:59:45Z","timestamp":1779890385000},"page":"1-78","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Cut-Shortcut Whole-Program Pointer Analysis: Re-Imagining Context-Sensitivity without Contexts"],"prefix":"10.1145","volume":"48","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-3298-7999","authenticated-orcid":false,"given":"Shengyuan","family":"Yang","sequence":"first","affiliation":[{"name":"Computer Sciences Department, University of Wisconsin-Madison, Madison, Wisconsin, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9134-1980","authenticated-orcid":false,"given":"Wenjie","family":"Ma","sequence":"additional","affiliation":[{"name":"University of California Berkeley, Berkeley, California, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5676-9949","authenticated-orcid":false,"given":"Thomas","family":"Reps","sequence":"additional","affiliation":[{"name":"Computer Sciences Department, University of Wisconsin-Madison, Madison, Wisconsin, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-3792-1237","authenticated-orcid":false,"given":"Tian","family":"Tan","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Novel Software Technology, Nanjing University, Nanjing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-1285-2298","authenticated-orcid":false,"given":"Yue","family":"Li","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Novel Software Technology, Nanjing University, Nanjing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,8,10]]},"reference":[{"key":"e_1_3_3_2_2","unstructured":"New Relic. 2023. 2023 State of the Java Ecosystem. Retrieved from https:\/\/newrelic.com\/resources\/report\/2023-state-of-the-java-ecosystem"},{"key":"e_1_3_3_3_2","volume-title":"Program Analysis and Specialization for the C Programming Language","author":"Andersen Lars Ole","year":"1994","unstructured":"Lars Ole Andersen. 1994. Program Analysis and Specialization for the C Programming Language. Ph.D. Dissertation. University of Copenhagen."},{"key":"e_1_3_3_4_2","doi-asserted-by":"crossref","first-page":"794","DOI":"10.1145\/3385412.3386026","volume-title":"Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI \u201920)","author":"Antoniadis Anastasios","year":"2020","unstructured":"Anastasios Antoniadis, Nikos Filippakis, Paddy Krishnan, Raghavendra Ramesh, Nicholas Allen, and Yannis Smaragdakis. 2020. Static analysis of Java enterprise applications: Frameworks and caches, the elephants in the room. In Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI \u201920). ACM, New York, NY, 794\u2013807. DOI: 10.1145\/3385412.3386026"},{"key":"e_1_3_3_5_2","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1145\/2594291.2594299","volume-title":"Proceedings of the 35th ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI \u201914)","author":"Arzt Steven","year":"2014","unstructured":"Steven Arzt, Siegfried Rasthofer, Christian Fritz, Eric Bodden, Alexandre Bartel, Jacques Klein, Yves Le Traon, Damien Octeau, and Patrick McDaniel. 2014. FlowDroid: Precise context, flow, field, object-sensitive and lifecycle-aware taint analysis for Android apps. In Proceedings of the 35th ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI \u201914). ACM, New York, NY, 259\u2013269. DOI: 10.1145\/2594291.2594299"},{"key":"e_1_3_3_6_2","unstructured":"awslabs. 2026. amazon-sqs-java-temporary-queues-client. GitHub Repository. Retrieved March 4 2026 from https:\/\/github.com\/awslabs\/amazon-sqs-java-temporary-queues-client"},{"key":"e_1_3_3_7_2","first-page":"23","volume-title":"Proceedings of the 2022 26th International Conference on Engineering of Complex Computer Systems (ICECCS)","author":"Basso Matteo","year":"2022","unstructured":"Matteo Basso, Filippo Schiavio, Andrea Ros\u00e0, and Walter Binder. 2022. Optimizing parallel Java streams. In Proceedings of the 2022 26th International Conference on Engineering of Complex Computer Systems (ICECCS), 23\u201332. DOI: 10.1109\/ICECCS54210.2022.00012"},{"key":"e_1_3_3_8_2","first-page":"169","volume-title":"OOPSLA \u201906: Proceedings of the 21st Annual ACM SIGPLAN Conference on Object-Oriented Programing, Systems, Languages, and Applications","author":"Blackburn S. M.","year":"2006","unstructured":"S. M. Blackburn, R. Garner, C. Hoffman, A. M. Khan, K. S. McKinley, R. Bentzur, A. Diwan, D. Feinberg, D. Frampton, S. Z. Guyer, et al. 2006. The DaCapo benchmarks: Java benchmarking development and analysis. In OOPSLA \u201906: Proceedings of the 21st Annual ACM SIGPLAN Conference on Object-Oriented Programing, Systems, Languages, and Applications. ACM Press, New York, NY, 169\u2013190. DOI: 10.1145\/1167473.1167488"},{"key":"e_1_3_3_9_2","first-page":"243","volume-title":"Proceedings of the 24th ACM SIGPLAN Conference on Object Oriented Programming Systems Languages and Applications (OOPSLA \u201909)","author":"Bravenboer Martin","year":"2009","unstructured":"Martin Bravenboer and Yannis Smaragdakis. 2009. Strictly declarative specification of sophisticated points-to analyses. In Proceedings of the 24th ACM SIGPLAN Conference on Object Oriented Programming Systems Languages and Applications (OOPSLA \u201909). ACM, New York, NY, 243\u2013262. DOI: 10.1145\/1640089.1640108"},{"key":"e_1_3_3_10_2","first-page":"1126","volume-title":"Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation (PLDI \u201921)","author":"Cai Yuandao","year":"2021","unstructured":"Yuandao Cai, Peisen Yao, and Charles Zhang. 2021. Canary: Practical static detection of inter-thread value-flow bugs. In Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation (PLDI \u201921). ACM, New York, NY, 1126\u20131140. DOI: 10.1145\/3453483.3454099"},{"key":"e_1_3_3_11_2","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1145\/1542476.1542517","volume-title":"Proceedings of the 30th ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI \u201909)","author":"Chandra Satish","year":"2009","unstructured":"Satish Chandra, Stephen J. Fink, and Manu Sridharan. 2009. Snugglebug: A powerful approach to weakest preconditions. In Proceedings of the 30th ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI \u201909). ACM, New York, NY, 363\u2013374. DOI: 10.1145\/1542476.1542517"},{"key":"e_1_3_3_12_2","first-page":"2803","volume-title":"Proceedings of the IEEE\/ACM 47th International Conference on Software Engineering (ICSE \u201925)","author":"Chen Menglong","year":"2025","unstructured":"Menglong Chen, Tian Tan, Minxue Pan, and Yue Li. 2025. PacDroid: A pointer-analysis-centric framework for security vulnerabilities in Android apps. In Proceedings of the IEEE\/ACM 47th International Conference on Software Engineering (ICSE \u201925). IEEE Press, 2803\u20132815. DOI: 10.1109\/ICSE55347.2025.00208"},{"key":"e_1_3_3_13_2","first-page":"77","volume-title":"Proceedings of the 28th International Symposium on Static Analysis (SAS \u201921)","author":"Chen Yifan","year":"2021","unstructured":"Yifan Chen, Chenyang Yang, Xin Zhang, Yingfei Xiong, Hao Tang, Xiaoyin Wang, and Lu Zhang. 2021. Accelerating program analyses in datalog by merging library facts. In Proceedings of the 28th International Symposium on Static Analysis (SAS \u201921). Springer-Verlag, Berlin, 77\u2013101. DOI: 10.1007\/978-3-030-88806-0_4"},{"key":"e_1_3_3_14_2","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1145\/349299.349311","volume-title":"Proceedings of the ACM SIGPLAN 2000 Conference on Programming Language Design and Implementation (PLDI \u201900)","author":"Cheng Ben-Chung","year":"2000","unstructured":"Ben-Chung Cheng and Wen-Mei W. Hwu. 2000. Modular interprocedural pointer analysis using access paths: Design, implementation, and evaluation. In Proceedings of the ACM SIGPLAN 2000 Conference on Programming Language Design and Implementation (PLDI \u201900). ACM, New York, NY, 57\u201369. DOI: 10.1145\/349299.349311"},{"key":"e_1_3_3_15_2","first-page":"665","volume-title":"Proceedings of the 26th European Conference on Object-Oriented Programming (ECOOP \u201912)","author":"De Arnab","year":"2012","unstructured":"Arnab De and Deepak D\u2019Souza. 2012. Scalable flow-sensitive pointer analysis for Java with strong updates. In Proceedings of the 26th European Conference on Object-Oriented Programming (ECOOP \u201912). James Noble (Ed.), Springer, Berlin, 665\u2013687."},{"key":"e_1_3_3_16_2","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/3-540-49538-X_5","volume-title":"Proceedings of the 9th European Conference Object-Oriented Programming (ECOOP \u201995)","author":"Dean Jeffrey","year":"1995","unstructured":"Jeffrey Dean, David Grove, and Craig Chambers. 1995. Optimization of object-oriented programs using static class hierarchy analysis. In Proceedings of the 9th European Conference Object-Oriented Programming (ECOOP \u201995). Mario Tokoro and Remo Pareschi (Eds.), Springer, Berlin, 77\u2013101."},{"key":"e_1_3_3_17_2","unstructured":"dmeoli. 2026. WS4J. GitHub Repository. Retrieved March 4 2026 from https:\/\/github.com\/dmeoli\/WS4J"},{"key":"e_1_3_3_18_2","first-page":"39","volume-title":"Proceedings of the 29th International Conference on Compiler Construction (CC \u201920)","author":"Fegade Pratik","year":"2020","unstructured":"Pratik Fegade and Christian Wimmer. 2020. Scalable pointer analysis of data structures using semantic models. In Proceedings of the 29th International Conference on Compiler Construction (CC \u201920). ACM, New York, NY, 39\u201350. DOI: 10.1145\/3377555.3377885"},{"key":"e_1_3_3_19_2","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1007\/978-3-319-26529-2_25","volume-title":"Programming Languages and Systems","author":"Feng Yu","year":"2015","unstructured":"Yu Feng, Xinyu Wang, Isil Dillig, and Thomas Dillig. 2015. Bottom-up context-sensitive pointer analysis for Java. In Programming Languages and Systems. Xinyu Feng and Sungwoo Park (Eds.), Springer International Publishing, Cham, 465\u2013484."},{"key":"e_1_3_3_20_2","doi-asserted-by":"publisher","unstructured":"Stephen J. Fink Eran Yahav Nurit Dor G. Ramalingam and Emmanuel Geay. 2008. Effective typestate verification in the presence of aliasing. ACM Transactions on Software Engineering and Methodology 17 2 Article 9 (May 2008) 34 pages. DOI: 10.1145\/1348250.1348255","DOI":"10.1145\/1348250.1348255"},{"key":"e_1_3_3_21_2","unstructured":"finmath. 2026. finmath-forward-initial-margin. GitHub Repository. Retrieved March 4 2026 from https:\/\/github.com\/finmath\/finmath-forward-initial-margin"},{"key":"e_1_3_3_22_2","doi-asserted-by":"publisher","DOI":"10.1145\/5666.5673"},{"key":"e_1_3_3_23_2","first-page":"1","volume-title":"Proceedings of the 33rd European Conference on Object-Oriented Programming (ECOOP \u201919)Leibniz International Proceedings in Informatics (LIPIcs), Vol","volume":"134","author":"Fourtounis George","year":"2019","unstructured":"George Fourtounis and Yannis Smaragdakis. 2019. Deep static modeling of invokedynamic. In Proceedings of the 33rd European Conference on Object-Oriented Programming (ECOOP \u201919). Alastair F. Donaldson (Ed.), Leibniz International Proceedings in Informatics (LIPIcs), Vol. 134, Schloss Dagstuhl\u2014Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Article 15, 1\u201328. DOI: 10.4230\/LIPIcs.ECOOP.2019.15"},{"key":"e_1_3_3_24_2","doi-asserted-by":"publisher","unstructured":"Pritam M. Gharat Uday P. Khedker and Alan Mycroft. 2020. Generalized points-to graphs: A precise and scalable abstraction for points-to analysis. ACM Transactions on Programming Languages and Systems 42 2 Article 8 (May 2020) 78 pages. DOI: 10.1145\/3382092","DOI":"10.1145\/3382092"},{"key":"e_1_3_3_25_2","doi-asserted-by":"publisher","unstructured":"Neville Grech and Yannis Smaragdakis. 2017. P\/taint: Unified points-to and taint analysis. Proceedings of the ACM on Programming Languages 1 OOPSLA Article 102 (Oct. 2017) 28 pages. DOI: 10.1145\/3133926","DOI":"10.1145\/3133926"},{"key":"e_1_3_3_26_2","first-page":"13","volume-title":"Proceedings of the 6th ACM SIGPLAN International Workshop on State Of the Art in Program Analysis (SOAP \u201917)","author":"Hassanshahi Behnaz","year":"2017","unstructured":"Behnaz Hassanshahi, Raghavendra Kagalavadi Ramesh, Padmanabhan Krishnan, Bernhard Scholz, and Yi Lu. 2017. An efficient tunable selective points-to analysis for large codebases. In Proceedings of the 6th ACM SIGPLAN International Workshop on State Of the Art in Program Analysis (SOAP \u201917). ACM, New York, NY, 13\u201318. DOI: 10.1145\/3088515.3088519"},{"key":"e_1_3_3_27_2","doi-asserted-by":"publisher","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. Proceedings of the ACM on Programming Languages 7 OOPSLA2 Article 256 (Oct. 2023) 30 pages. DOI: 10.1145\/3622832","DOI":"10.1145\/3622832"},{"key":"e_1_3_3_28_2","first-page":"1","volume-title":"Proceedings of the 35th European Conference on Object-Oriented Programming (ECOOP \u201921)Leibniz International Proceedings in Informatics (LIPIcs), Vol","volume":"194","author":"He Dongjie","year":"2021","unstructured":"Dongjie He, Jingbo Lu, Yaoqing Gao, and Jingling Xue. 2021. Accelerating object-sensitive pointer analysis by exploiting object containment and reachability. In Proceedings of the 35th European Conference on Object-Oriented Programming (ECOOP \u201921). Anders M\u00f8ller and Manu Sridharan (Eds.), Leibniz International Proceedings in Informatics (LIPIcs), Vol. 194, Schloss Dagstuhl\u2014Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Article 16, 1\u201331. DOI: 10.4230\/LIPIcs.ECOOP.2021.16"},{"key":"e_1_3_3_29_2","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2022.3162236"},{"key":"e_1_3_3_30_2","doi-asserted-by":"publisher","unstructured":"Dongjie He Jingbo Lu and Jingling Xue. 2023. IFDS-based context debloating for object-sensitive pointer analysis. ACM Transactions on Software Engineering and Methodology 32 4 Article 101 (May 2023) 44 pages. DOI: 10.1145\/3579641","DOI":"10.1145\/3579641"},{"key":"e_1_3_3_31_2","first-page":"1","volume-title":"Proceedings of the 38th European Conference on Object-Oriented Programming (ECOOP \u201924)Leibniz International Proceedings in Informatics (LIPIcs), Vol","volume":"313","author":"He Dongjie","year":"2024","unstructured":"Dongjie He, Jingbo Lu, and Jingling Xue. 2024. A CFL-reachability formulation of callsite-sensitive pointer analysis with built-in on-the-fly call graph construction. In Proceedings of the 38th European Conference on Object-Oriented Programming (ECOOP \u201924). Jonathan Aldrich and Guido Salvaneschi (Eds.), Leibniz International Proceedings in Informatics (LIPIcs), Vol. 313, Schloss Dagstuhl\u2014Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Article 18, 1\u201329. DOI: 10.4230\/LIPIcs.ECOOP.2024.18"},{"key":"e_1_3_3_32_2","doi-asserted-by":"publisher","DOI":"10.1002\/spe.2493"},{"key":"e_1_3_3_33_2","doi-asserted-by":"publisher","unstructured":"Susan Horwitz Thomas W. Reps and David W. Binkley. 1990. Interprocedural slicing using dependence graphs. ACM Transactions on Programming Languages and Systems 12 1 (1990) 26\u201360. DOI: 10.1145\/77606.77608","DOI":"10.1145\/77606.77608"},{"key":"e_1_3_3_34_2","doi-asserted-by":"publisher","unstructured":"Minseok Jeon Sehun Jeong Sungdeok Cha and Hakjoo Oh. 2019. A machine-learning algorithm with disjunctive model for data-driven program analysis. ACM Transactions on Programming Languages and Systems 41 2 Article 13 (June 2019) 41 pages. DOI: 10.1145\/3293607","DOI":"10.1145\/3293607"},{"key":"e_1_3_3_35_2","doi-asserted-by":"publisher","unstructured":"Minseok Jeon Sehun Jeong and Hakjoo Oh. 2018. Precise and scalable points-to analysis via data-driven context tunneling. Proceedings of the ACM on Programming Languages 2 OOPSLA Article 140 (Oct. 2018) 29 pages. DOI: 10.1145\/3276510","DOI":"10.1145\/3276510"},{"key":"e_1_3_3_36_2","doi-asserted-by":"publisher","unstructured":"Minseok Jeon Myungho Lee and Hakjoo Oh. 2020. Learning graph-based heuristics for pointer analysis without handcrafting application-specific features. Proceedings of the ACM on Programming Languages 4 OOPSLA Article 179 (Nov. 2020) 30 pages. DOI: 10.1145\/3428247","DOI":"10.1145\/3428247"},{"key":"e_1_3_3_37_2","doi-asserted-by":"publisher","unstructured":"Minseok Jeon and Hakjoo Oh. 2022. Return of CFA: Call-site sensitivity can be superior to object sensitivity even for object-oriented programs. Proceedings of the ACM on Programming Languages 6 POPL Article 58 (Jan. 2022) 29 pages. DOI: 10.1145\/3498720","DOI":"10.1145\/3498720"},{"key":"e_1_3_3_38_2","doi-asserted-by":"publisher","unstructured":"Sehun Jeong Minseok Jeon Sungdeok Cha and Hakjoo Oh. 2017. Data-driven context-sensitivity for points-to analysis. Proceedings of the ACM on Programming Languages 1 OOPSLA Article 100 (Oct. 2017) 28 pages. DOI: 10.1145\/3133924","DOI":"10.1145\/3133924"},{"key":"e_1_3_3_39_2","doi-asserted-by":"publisher","unstructured":"Vini Kanvar and Uday P. Khedker. 2016. Heap abstractions for static analysis. ACM Computing Surveys 49 2 Article 29 (June 2016) 47 pages. DOI: 10.1145\/2931098","DOI":"10.1145\/2931098"},{"key":"e_1_3_3_40_2","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1109\/ICST57152.2023.00036","volume-title":"Proceedings of the 2023 IEEE Conference on Software Testing, Verification and Validation (ICST)","author":"Karakaya Kadiray","year":"2023","unstructured":"Kadiray Karakaya and Eric Bodden. 2023. Two sparsification strategies for accelerating demand-driven pointer analysis. In Proceedings of the 2023 IEEE Conference on Software Testing, Verification and Validation (ICST), 305\u2013316. DOI: 10.1109\/ICST57152.2023.00036"},{"key":"e_1_3_3_41_2","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1145\/2491956.2462191","volume-title":"Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (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 ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI \u201913). Hans-Juergen Boehm and Cormac Flanagan (Eds.), ACM, 423\u2013434. DOI: 10.1145\/2491956.2462191"},{"key":"e_1_3_3_42_2","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/978-3-030-45234-6_5","volume-title":"Fundamental Approaches to Software Engineering","author":"Khatchadourian Raffi","year":"2020","unstructured":"Raffi Khatchadourian, Yiming Tang, Mehdi Bagherzadeh, and Baishakhi Ray. 2020. An empirical study on the use and misuse of Java 8 streams. In Fundamental Approaches to Software Engineering. Heike Wehrheim and Jordi Cabot (Eds.), Springer International Publishing, Cham, 97\u2013118."},{"key":"e_1_3_3_43_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, 153\u2013169."},{"key":"e_1_3_3_44_2","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/11688839_5","volume-title":"Compiler Construction","author":"Lhot\u00e1k Ond\u0159ej","year":"2006","unstructured":"Ond\u0159ej Lhot\u00e1k and Laurie Hendren. 2006. Context-sensitive points-to analysis: Is it worth it? In Compiler Construction. Alan Mycroft and Andreas Zeller (Eds.), Springer, Berlin, 47\u201364."},{"key":"e_1_3_3_45_2","first-page":"1110","volume-title":"Proceedings of the 30th ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering (ESEC\/FSE \u201922)","author":"Li Haofeng","year":"2022","unstructured":"Haofeng Li, Jie Lu, Haining Meng, Liqing Cao, Yongheng Huang, Lian Li, and Lin Gao. 2022. Generic sensitivity: Customizing context-sensitive pointer analysis for generics. In Proceedings of the 30th ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering (ESEC\/FSE \u201922). ACM, New York, NY, 1110\u20131121. DOI: 10.1145\/3540250.3549122"},{"key":"e_1_3_3_46_2","first-page":"1819","volume-title":"Proceedings of the 2025 IEEE\/ACM 47th International Conference on Software Engineering (ICSE)","author":"Li Haofeng","year":"2025","unstructured":"Haofeng Li, Chenghang Shi, Jie Lu, Lian Li, and Zixuan Zhao. 2025. Module-aware context sensitive pointer analysis. In Proceedings of the 2025 IEEE\/ACM 47th International Conference on Software Engineering (ICSE). IEEE Computer Society, Los Alamitos, CA, 1819\u20131831. DOI: 10.1109\/ICSE55347.2025.00227"},{"key":"e_1_3_3_47_2","doi-asserted-by":"publisher","DOI":"10.1145\/3276511"},{"key":"e_1_3_3_48_2","first-page":"129","volume-title":"Proceedings of the 2018 26th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering (ESEC\/FSE \u201918)","author":"Li Yue","year":"2018","unstructured":"Yue Li, Tian Tan, Anders M\u00f8ller, and Yannis Smaragdakis. 2018. Scalability-first pointer analysis with self-tuning context-sensitivity. In Proceedings of the 2018 26th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering (ESEC\/FSE \u201918). ACM, New York, NY, 129\u2013140. DOI: 10.1145\/3236024.3236041"},{"key":"e_1_3_3_49_2","doi-asserted-by":"publisher","unstructured":"Yue Li Tian Tan Anders M\u00f8ller and Yannis Smaragdakis. 2020. A principled approach to selective context sensitivity for pointer analysis. ACM Transactions on Programming Languages and Systems 42 2 Article 10 (May 2020) 40 pages. DOI: 10.1145\/3381915","DOI":"10.1145\/3381915"},{"key":"e_1_3_3_50_2","doi-asserted-by":"publisher","unstructured":"Yue Li Tian Tan and Jingling Xue. 2019. Understanding and analyzing Java reflection. ACM Transactions on Software Engineering and Methodology 28 2 Article 7 (Feb. 2019) 50 pages. DOI: 10.1145\/3295739","DOI":"10.1145\/3295739"},{"key":"e_1_3_3_51_2","first-page":"1","volume-title":"Proceedings of the 30th European Conference on Object-Oriented Programming (ECOOP \u201916)Leibniz International Proceedings in Informatics (LIPIcs), Vol","volume":"56","author":"Li Yue","year":"2016","unstructured":"Yue Li, Tian Tan, Yifei Zhang, and Jingling Xue. 2016. Program tailoring: Slicing by sequential criteria. In Proceedings of the 30th European Conference on Object-Oriented Programming (ECOOP \u201916). Shriram Krishnamurthi and Benjamin S. Lerner (Eds.), Leibniz International Proceedings in Informatics (LIPIcs), Vol. 56, Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik, Dagstuhl, Article 15, 1\u201327. DOI: 10.4230\/LIPIcs.ECOOP.2016.15"},{"key":"e_1_3_3_52_2","doi-asserted-by":"publisher","unstructured":"Yufei Liang Teng Zhang Ganlin Li Tian Tan Chang Xu Chun Cao Xiaoxing Ma and Yue Li. 2025. Pointer analysis for database-backed applications. Proceedings of the ACM on Programming Languages 9 PLDI Article 204 (June 2025) 25 pages. DOI: 10.1145\/3729307","DOI":"10.1145\/3729307"},{"key":"e_1_3_3_53_2","doi-asserted-by":"publisher","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 Transactions on Software Engineering and Methodology 30 4 Article 46 (July 2021) 46 pages. DOI: 10.1145\/3450492","DOI":"10.1145\/3450492"},{"key":"e_1_3_3_54_2","first-page":"261","volume-title":"Proceedings of the 28th International Symposium on Static Analysis (SAS \u201921)","author":"Lu Jingbo","year":"2021","unstructured":"Jingbo Lu, Dongjie He, and Jingling Xue. 2021. Selective context-sensitivity for k-CFA with CFL-reachability. In Proceedings of the 28th International Symposium on Static Analysis (SAS \u201921). Springer-Verlag, Berlin, 261\u2013285. DOI: 10.1007\/978-3-030-88806-0_13"},{"key":"e_1_3_3_55_2","doi-asserted-by":"publisher","unstructured":"Wenjie Ma Shengyuan Yang Tian Tan Xiaoxing Ma Chang Xu and Yue Li. 2023. Context sensitivity without contexts: A cut-shortcut approach to fast and precise pointer analysis. Proceedings of the ACM on Programming Languages 7 PLDI Article 128 (June 2023) 26 pages. DOI: 10.1145\/3591242","DOI":"10.1145\/3591242"},{"key":"e_1_3_3_56_2","first-page":"1","volume-title":"Proceedings of the 2002 ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA \u201902)","author":"Milanova Ana","year":"2002","unstructured":"Ana Milanova, Atanas Rountev, and Barbara G. Ryder. 2002. Parameterized object sensitivity for points-to and side-effect analyses for Java. In Proceedings of the 2002 ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA \u201902). ACM, New York, NY, 1\u201311. DOI: 10.1145\/566172.566174"},{"key":"e_1_3_3_57_2","doi-asserted-by":"publisher","unstructured":"Ana Milanova Atanas Rountev and Barbara G. Ryder. 2005. Parameterized object sensitivity for points-to analysis for Java. ACM Transactions on Software Engineering and Methodology 14 1 (Jan. 2005) 1\u201341. DOI: 10.1145\/1044834.1044835","DOI":"10.1145\/1044834.1044835"},{"key":"e_1_3_3_58_2","doi-asserted-by":"publisher","unstructured":"Anders M\u00f8ller and Oskar Haarklou Veileborg. 2020. Eliminating abstraction overhead of Java stream pipelines using ahead-of-time program optimization. Proceedings of the ACM on Programming Languages 4 OOPSLA Article 168 (Nov. 2020) 29 pages. DOI: 10.1145\/3428236","DOI":"10.1145\/3428236"},{"key":"e_1_3_3_59_2","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1145\/1133981.1134018","volume-title":"Proceedings of the 27th ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI \u201906)","author":"Naik Mayur","year":"2006","unstructured":"Mayur Naik, Alex Aiken, and John Whaley. 2006. Effective static race detection for Java. In Proceedings of the 27th ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI \u201906). ACM, New York, NY, 308\u2013319. DOI: 10.1145\/1133981.1134018"},{"key":"e_1_3_3_60_2","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/978-3-030-87007-2_23","volume-title":"Computational Science and Its Applications\u2014ICCSA 2021","author":"Nostas Joshua","year":"2021","unstructured":"Joshua Nostas, Juan Pablo Sandoval Alcocer, Diego Elias Costa, and Alexandre Bergel. 2021. How do developers use the Java stream API? In Computational Science and Its Applications\u2014ICCSA 2021. Osvaldo Gervasi, Beniamino Murgante, Sanjay Misra, Chiara Garau, Ivan Ble\u010di\u0107, David Taniar, Bernady O. Apduhan, Ana Maria A. C. Rocha, Eufemia Tarantino, and Carmelo Maria Torre (Eds.), Springer International Publishing, Cham, 323\u2013335."},{"key":"e_1_3_3_61_2","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/978-3-540-27864-1_14","volume-title":"Static Analysis","author":"Nystrom Erik M.","year":"2004","unstructured":"Erik M. Nystrom, Hong-Seok Kim, and Wen-Mei W. Hwu. 2004. Bottom-up and top-down context-sensitive summary-based pointer analysis. In Static Analysis. Roberto Giacobazzi (Ed.), Springer, Berlin, 165\u2013180."},{"key":"e_1_3_3_62_2","first-page":"475","volume-title":"Proceedings of the 35th ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI \u201914)","author":"Oh Hakjoo","year":"2014","unstructured":"Hakjoo Oh, Wonchan Lee, Kihong Heo, Hongseok Yang, and Kwangkeun Yi. 2014. Selective context-sensitivity guided by impact pre-analysis. In Proceedings of the 35th ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI \u201914). ACM, New York, NY, 475\u2013484. DOI: 10.1145\/2594291.2594318"},{"key":"e_1_3_3_63_2","doi-asserted-by":"publisher","unstructured":"Hakjoo Oh Wonchan Lee Kihong Heo Hongseok Yang and Kwangkeun Yi. 2015. Selective X-sensitive analysis guided by impact pre-analysis. ACM Transactions on Programming Languages and Systems 38 2 Article 6 (Dec. 2015) 45 pages. DOI: 10.1145\/2821504","DOI":"10.1145\/2821504"},{"key":"e_1_3_3_64_2","doi-asserted-by":"crossref","first-page":"925","DOI":"10.1109\/ICSE.2012.6227127","volume-title":"Proceedings of the 2012 34th International Conference on Software Engineering (ICSE)","author":"Pradel Michael","year":"2012","unstructured":"Michael Pradel, Ciera Jaspan, Jonathan Aldrich, and Thomas R. Gross. 2012. Statically checking API protocol conformance with mined multi-object specifications. In Proceedings of the 2012 34th International Conference on Software Engineering (ICSE), 925\u2013935. DOI: 10.1109\/ICSE.2012.6227127"},{"key":"e_1_3_3_65_2","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1145\/3314221.3314637","volume-title":"Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI \u201919)","author":"Prokopec Aleksandar","year":"2019","unstructured":"Aleksandar Prokopec, Andrea Ros\u00e0, David Leopoldseder, Gilles Duboscq, Petr T\u016fma, Martin Studener, Lubom\u00edr Bulej, Yudi Zheng, Alex Villaz\u00f3n, Doug Simon, Thomas W\u00fcrthinger, and Walter Binder. 2019. Renaissance: Benchmarking suite for parallel applications on the JVM. In Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI \u201919). ACM, New York, NY, 31\u201347. DOI: 10.1145\/3314221.3314637"},{"key":"e_1_3_3_66_2","unstructured":"renaissance-benchmarks. 2026. Renaissance Benchmark Suite. GitHub Repository. Retrieved March 4 2026 from https:\/\/github.com\/renaissance-benchmarks\/renaissance"},{"key":"e_1_3_3_67_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0950-5849(98)00093-7"},{"key":"e_1_3_3_68_2","doi-asserted-by":"publisher","unstructured":"Thomas Reps. 2000. Undecidability of context-sensitive data-dependence analysis. ACM Transactions on Programming Languages and Systems 22 1 (Jan. 2000) 162\u2013186. DOI: 10.1145\/345099.345137","DOI":"10.1145\/345099.345137"},{"key":"e_1_3_3_69_2","first-page":"49","volume-title":"Proceedings of the 22nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL \u201995)","author":"Reps Thomas","year":"1995","unstructured":"Thomas Reps, Susan Horwitz, and Mooly Sagiv. 1995. Precise interprocedural dataflow analysis via graph reachability. In Proceedings of the 22nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL \u201995). ACM, New York, NY, 49\u201361. DOI: 10.1145\/199448.199462"},{"issue":"9","key":"e_1_3_3_70_2","first-page":"1763","article-title":"Large-scale characterization of Java streams","volume":"53","author":"Rosales Eduardo","year":"2023","unstructured":"Eduardo Rosales, Matteo Basso, Andrea Ros\u00e0, and Walter Binder. 2023. Large-scale characterization of Java streams. Software: Practice and Experience 53, 9 (2023), 1763\u20131792.","journal-title":"Software: Practice and Experience"},{"key":"e_1_3_3_71_2","first-page":"143","volume-title":"Proceedings of the 2022 26th International Conference on Engineering of Complex Computer Systems (ICECCS)","author":"Rosales Eduardo","year":"2022","unstructured":"Eduardo Rosales, Andrea Ros\u00e0, Matteo Basso, Alex Villaz\u00f3n, Adriana Orellana, \u00c1ngel Zenteno, Jhon Rivero, and Walter Binder. 2022. Characterizing Java streams in the wild. In Proceedings of the 2022 26th International Conference on Engineering of Complex Computer Systems (ICECCS), 143\u2013152. DOI: 10.1109\/ICECCS54210.2022.00025"},{"key":"e_1_3_3_72_2","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1145\/3564719.3568699","volume-title":"Proceedings of the 21st ACM SIGPLAN International Conference on Generative Programming: Concepts and Experiences (GPCE \u201922)","author":"Schiavio Filippo","year":"2022","unstructured":"Filippo Schiavio, Andrea Ros\u00e0, and Walter Binder. 2022. SQL to stream with S2S: An automatic benchmark generator for the Java stream API. In Proceedings of the 21st ACM SIGPLAN International Conference on Generative Programming: Concepts and Experiences (GPCE \u201922). ACM, New York, NY, 179\u2013186. DOI: 10.1145\/3564719.3568699"},{"key":"e_1_3_3_73_2","first-page":"264","volume-title":"Proceedings of the 10th International Symposium on Code Generation and Optimization (CGO \u201912)","author":"Shang Lei","year":"2012","unstructured":"Lei Shang, Xinwei Xie, and Jingling Xue. 2012. On-demand dynamic summary-based points-to analysis. In Proceedings of the 10th International Symposium on Code Generation and Optimization (CGO \u201912). ACM, New York, NY, 264\u2013274. DOI: 10.1145\/2259016.2259050"},{"key":"e_1_3_3_74_2","first-page":"189","volume-title":"Two Approaches to Interprocedural Data Flow Analysis","author":"Sharir Micha","year":"1981","unstructured":"Micha Sharir and Amir Pnueli. 1981. Two Approaches to Interprocedural Data Flow Analysis, Chapter 7. Prentice-Hall, 189\u2013234."},{"key":"e_1_3_3_75_2","volume-title":"Control-Flow Analysis of Higher-Order Languages or Taming Lambda","author":"Grigsby Shivers Olin","year":"1991","unstructured":"Olin Grigsby Shivers. 1991. Control-Flow Analysis of Higher-Order Languages or Taming Lambda. Carnegie Mellon University."},{"key":"e_1_3_3_76_2","doi-asserted-by":"publisher","unstructured":"Yannis Smaragdakis and George Balatsouras. 2015. Pointer analysis. Foundations and Trends in Programming Languages 2 1 (Apr. 2015) 1\u201369. DOI: 10.1561\/2500000014","DOI":"10.1561\/2500000014"},{"key":"e_1_3_3_77_2","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1007\/978-3-319-26529-2_26","volume-title":"Programming Languages and Systems","author":"Smaragdakis Yannis","year":"2015","unstructured":"Yannis Smaragdakis, George Balatsouras, George Kastrinis, and Martin Bravenboer. 2015. More sound static handling of Java reflection. In Programming Languages and Systems. Xinyu Feng and Sungwoo Park (Eds.), Springer International Publishing, Cham, 485\u2013503."},{"key":"e_1_3_3_78_2","first-page":"17","volume-title":"Proceedings of the 38th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL \u201911)","author":"Smaragdakis Yannis","year":"2011","unstructured":"Yannis Smaragdakis, Martin Bravenboer, and Ondrej Lhot\u00e1k. 2011. Pick your contexts well: Understanding object-sensitivity. In Proceedings of the 38th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL \u201911). ACM, New York, NY, 17\u201330. DOI: 10.1145\/1926385.1926390"},{"key":"e_1_3_3_79_2","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1145\/2594291.2594320","volume-title":"Proceedings of the 35th ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI \u201914)","author":"Smaragdakis Yannis","year":"2014","unstructured":"Yannis Smaragdakis, George Kastrinis, and George Balatsouras. 2014. Introspective analysis: Context-sensitivity, across the board. In Proceedings of the 35th ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI \u201914). ACM, New York, NY, 485\u2013495. DOI: 10.1145\/2594291.2594320"},{"key":"e_1_3_3_80_2","first-page":"1","volume-title":"Proceedings of the 30th European Conference on Object-Oriented Programming (ECOOP \u201916)","volume":"56","author":"Sp\u00e4th Johannes","year":"2016","unstructured":"Johannes Sp\u00e4th, Lisa Nguyen Quang Do, Karim Ali, and Eric Bodden. 2016. Boomerang: Demand-driven flow- and context-sensitive pointer analysis for Java. In Proceedings of the 30th European Conference on Object-Oriented Programming (ECOOP \u201916). Shriram Krishnamurthi and Benjamin S. Lerner (Eds.), Leibniz International Proceedings in Informatics (LIPIcs), Vol. 56, Schloss Dagstuhl\u2014Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Article 22, 1\u201326. DOI: 10.4230\/LIPIcs.ECOOP.2016.22"},{"key":"e_1_3_3_81_2","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1145\/1133981.1134027","volume-title":"Proceedings of the 27th ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI \u201906)","author":"Sridharan Manu","year":"2006","unstructured":"Manu Sridharan and Rastislav Bod\u00edk. 2006. Refinement-based context-sensitive points-to analysis for Java. In Proceedings of the 27th ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI \u201906). ACM, New York, NY, 387\u2013400. DOI: 10.1145\/1133981.1134027"},{"key":"e_1_3_3_82_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36946-9_8"},{"key":"e_1_3_3_83_2","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1145\/1250734.1250748","volume-title":"Proceedings of the 28th ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI \u201907)","author":"Sridharan Manu","year":"2007","unstructured":"Manu Sridharan, Stephen J. Fink, and Rastislav Bodik. 2007. Thin slicing. In Proceedings of the 28th ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI \u201907). ACM, New York, NY, 112\u2013122. DOI: 10.1145\/1250734.1250748"},{"key":"e_1_3_3_84_2","first-page":"59","volume-title":"Proceedings of the 20th Annual ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA \u201905)","author":"Sridharan Manu","year":"2005","unstructured":"Manu Sridharan, Denis Gopan, Lexin Shan, and Rastislav Bod\u00edk. 2005. Demand-driven points-to analysis for Java. In Proceedings of the 20th Annual ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA \u201905). ACM, New York, NY, 59\u201376. DOI: 10.1145\/1094811.1094817"},{"key":"e_1_3_3_85_2","doi-asserted-by":"crossref","first-page":"1093","DOI":"10.1145\/3597926.3598120","volume-title":"Proceedings of the 32nd ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA \u201923)","author":"Tan Tian","year":"2023","unstructured":"Tian Tan and Yue Li. 2023. Tai-e: A developer-friendly static analysis framework for Java by harnessing the good designs of classics. In Proceedings of the 32nd ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA \u201923). ACM, New York, NY, 1093\u20131105. DOI: 10.1145\/3597926.3598120"},{"key":"e_1_3_3_86_2","doi-asserted-by":"publisher","unstructured":"Tian Tan Yue Li Xiaoxing Ma Chang Xu and Yannis Smaragdakis. 2021. Making pointer analysis more precise by unleashing the power of selective context sensitivity. Proceedings of the ACM on Programming Languages 5 OOPSLA Article 147 (Oct. 2021) 27 pages. DOI: 10.1145\/3485524","DOI":"10.1145\/3485524"},{"key":"e_1_3_3_87_2","first-page":"489","volume-title":"Proceedings of the 23rd International Symposium on Static Analysis (SAS \u201916)","volume":"9837","author":"Tan Tian","year":"2016","unstructured":"Tian Tan, Yue Li, and Jingling Xue. 2016. Making k-object-sensitive pointer analysis more precise with still k-limiting. In Proceedings of the 23rd International Symposium on Static Analysis (SAS \u201916). Xavier Rival (Ed.), Lecture Notes in Computer Science, Vol. 9837, Springer, 489\u2013510. DOI: 10.1007\/978-3-662-53413-7_24"},{"key":"e_1_3_3_88_2","first-page":"278","volume-title":"Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI \u201917)","author":"Tan Tian","year":"2017","unstructured":"Tian Tan, Yue Li, and Jingling Xue. 2017. Efficient and precise points-to analysis: Modeling the heap by merging equivalent automata. In Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI \u201917). ACM, New York, NY, 278\u2013291. DOI: 10.1145\/3062341.3062360"},{"key":"e_1_3_3_89_2","first-page":"135","volume-title":"Proceedings of the 28th International Conference on Compiler Construction (CC \u201919)","author":"Thakur Manas","year":"2019","unstructured":"Manas Thakur and V. Krishna Nandivada. 2019. Compare less, defer more: Scaling value-contexts based whole-program heap analyses. In Proceedings of the 28th International Conference on Compiler Construction (CC \u201919). ACM, New York, NY, 135\u2013146. DOI: 10.1145\/3302516.3307359"},{"key":"e_1_3_3_90_2","first-page":"27","volume-title":"Proceedings of the 29th International Conference on Compiler Construction (CC \u201920)","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 \u201920). ACM, New York, NY, 27\u201338. DOI: 10.1145\/3377555.3377902"},{"key":"e_1_3_3_91_2","first-page":"263","volume-title":"Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI \u201917)","author":"Thiessen Rei","year":"2017","unstructured":"Rei Thiessen and Ond\u0159ej Lhot\u00e1k. 2017. Context transformations for pointer analysis. In Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI \u201917). ACM, New York, NY, 263\u2013277. DOI: 10.1145\/3062341.3062359"},{"key":"e_1_3_3_92_2","doi-asserted-by":"publisher","DOI":"10.1007\/b102522"},{"key":"e_1_3_3_93_2","unstructured":"USI-DAG. 2022. BSS: Benchmark Suite for the Stream API. https:\/\/github.com\/usi-dag\/BSS"},{"key":"e_1_3_3_94_2","unstructured":"vangj. 2026. jbayes. GitHub Repository. Retrieved March 4 2026 from https:\/\/github.com\/vangj\/jbayes"},{"key":"e_1_3_3_95_2","unstructured":"WALA. 2006. Watson Libraries for Analysis. http:\/\/wala.sf.net"},{"key":"e_1_3_3_96_2","first-page":"712","volume-title":"Proceedings of the 29th European Conference on Object-Oriented Programming (ECOOP \u201915)","volume":"37","author":"Wei Shiyi","year":"2015","unstructured":"Shiyi Wei and Barbara G. Ryder. 2015. Adaptive context-sensitive analysis for JavaScript. In Proceedings of the 29th European Conference on Object-Oriented Programming (ECOOP \u201915). John Tang Boyland (Ed.), Leibniz International Proceedings in Informatics (LIPIcs), Vol. 37, Schloss Dagstuhl\u2014Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, 712\u2013734. DOI: 10.4230\/LIPIcs.ECOOP.2015.712"},{"key":"e_1_3_3_97_2","first-page":"1","volume-title":"Proceedings of the ACM SIGPLAN 1995 Conference on Programming Language Design and Implementation (PLDI \u201995)","author":"Wilson Robert P.","year":"1995","unstructured":"Robert P. Wilson and Monica S. Lam. 1995. Efficient context-sensitive pointer analysis for C programs. In Proceedings of the ACM SIGPLAN 1995 Conference on Programming Language Design and Implementation (PLDI \u201995). ACM, New York, NY, 1\u201312. DOI: 10.1145\/207110.207111"},{"key":"e_1_3_3_98_2","first-page":"225","volume-title":"Proceedings of the 2008 International Symposium on Software Testing and Analysis (ISSTA \u201908)","author":"Xu Guoqing","year":"2008","unstructured":"Guoqing Xu and Atanas Rountev. 2008. Merging equivalent contexts for scalable heap-cloning-based context-sensitive points-to analysis. In Proceedings of the 2008 International Symposium on Software Testing and Analysis (ISSTA \u201908). ACM, New York, NY, 225\u2013236. DOI: 10.1145\/1390630.1390658"},{"key":"e_1_3_3_99_2","first-page":"155","volume-title":"Proceedings of the 2011 International Symposium on Software Testing and Analysis (ISSTA \u201911)","author":"Yan Dacong","year":"2011","unstructured":"Dacong Yan, Guoqing Xu, and Atanas Rountev. 2011. Demand-driven context-sensitive alias analysis for Java. In Proceedings of the 2011 International Symposium on Software Testing and Analysis (ISSTA \u201911). ACM, New York, NY, 155\u2013165. DOI: 10.1145\/2001420.2001440"},{"key":"e_1_3_3_100_2","doi-asserted-by":"publisher","unstructured":"ShengYuan Yang Wenjie Ma Thomas Reps Tian Tan and Yue Li. 2026. Cut-Shortcut Whole-Program Pointer Analysis: Re-Imagining Context-Sensitivity without Contexts (Artifact Document). Zenodo. DOI: 10.5281\/zenodo.19197254","DOI":"10.5281\/zenodo.19197254"},{"key":"e_1_3_3_101_2","first-page":"612","volume-title":"Proceedings of the 2025 IEEE\/ACM 47th International Conference on Software Engineering (ICSE)","author":"Zhang Chenxi","year":"2025","unstructured":"Chenxi Zhang, Yufei Liang, Tian Tan, Chang Xu, Shuangxiang Kan, Yulei Sui, and Yue Li. 2025. Interactive cross-language pointer analysis for resolving native code in Java programs. In Proceedings of the 2025 IEEE\/ACM 47th International Conference on Software Engineering (ICSE). IEEE Computer Society, Los Alamitos, CA, 612\u2013612. DOI: 10.1109\/ICSE55347.2025.00075"},{"key":"e_1_3_3_102_2","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1145\/2491956.2462159","volume-title":"Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI \u201913)","author":"Zhang Qirun","year":"2013","unstructured":"Qirun Zhang, Michael R. Lyu, Hao Yuan, and Zhendong Su. 2013. Fast algorithms for Dyck-CFL-reachability with applications to alias analysis. In Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI \u201913). ACM, New York, NY, 435\u2013446. DOI: 10.1145\/2491956.2462159"},{"key":"e_1_3_3_103_2","doi-asserted-by":"publisher","unstructured":"Teng Zhang Yufei Liang Ganlin Li Tian Tan Chang Xu and Yue Li. 2025. Bridge the islands: Pointer analysis for microservice systems. Proceedings of the ACM on Software Engineering 2 ISSTA Article ISSTA023 (June 2025) 23 pages. DOI: 10.1145\/3728896","DOI":"10.1145\/3728896"},{"key":"e_1_3_3_104_2","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1145\/2594291.2594328","volume-title":"Proceedings of the 35th ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI \u201914)","author":"Zhang Xin","year":"2014","unstructured":"Xin Zhang, Ravi Mangal, Mayur Naik, and Hongseok Yang. 2014. Hybrid top-down and bottom-up interprocedural analysis. In Proceedings of the 35th ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI \u201914). ACM, New York, NY, 249\u2013258. DOI: 10.1145\/2594291.2594328"}],"container-title":["ACM Transactions on Programming Languages and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3818615","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,10]],"date-time":"2026-08-10T10:35:24Z","timestamp":1786358124000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3818615"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8,10]]},"references-count":103,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,9,30]]}},"alternative-id":["10.1145\/3818615"],"URL":"https:\/\/doi.org\/10.1145\/3818615","relation":{},"ISSN":["0164-0925","1558-4593"],"issn-type":[{"value":"0164-0925","type":"print"},{"value":"1558-4593","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,8,10]]},"assertion":[{"value":"2025-10-17","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-05-06","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-08-10","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}