{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T13:40:11Z","timestamp":1755870011173,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":86,"publisher":"ACM","license":[{"start":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T00:00:00Z","timestamp":1755820800000},"content-version":"vor","delay-in-days":75,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["2106383, 1813173"],"award-info":[{"award-number":["2106383, 1813173"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,6,8]]},"DOI":"10.1145\/3721145.3725762","type":"proceedings-article","created":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T12:57:17Z","timestamp":1755867437000},"page":"1131-1145","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["GraCFL: A Holistically Designed Vertex-Centric Graph System for CFL Reachability"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-7586-4753","authenticated-orcid":false,"given":"Sakib","family":"Fuad","sequence":"first","affiliation":[{"name":"University of California, Riverside, Riverside, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-4344-3819","authenticated-orcid":false,"given":"Amir Hossein Nodehi","family":"Sabet","sequence":"additional","affiliation":[{"name":"University of California, Riverside, Riverside, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7229-9847","authenticated-orcid":false,"given":"Umar","family":"Farooq","sequence":"additional","affiliation":[{"name":"University of California, Riverside, Riverside, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2616-4241","authenticated-orcid":false,"given":"Zhijia","family":"Zhao","sequence":"additional","affiliation":[{"name":"University of California, Riverside, Riverside, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,8,22]]},"reference":[{"key":"e_1_3_3_2_2_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44585-4_18"},{"key":"e_1_3_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/2594291.2594299"},{"key":"e_1_3_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.1145\/3078597.3078616"},{"key":"e_1_3_3_2_5_2","doi-asserted-by":"publisher","unstructured":"Sergey Brin and Lawrence Page. 1998. The anatomy of a large-scale hypertextual Web search engine. Computer Networks and ISDN Systems 30 1 (1998) 107\u2013117. 10.1016\/S0169-7552(98)00110-XProceedings of the Seventh International World Wide Web Conference.","DOI":"10.1016\/S0169-7552(98)00110-X"},{"key":"e_1_3_3_2_6_2","doi-asserted-by":"publisher","unstructured":"Krishnendu Chatterjee Bhavya Choudhary and Andreas Pavlogiannis. 2017. Optimal Dyck Reachability for Data-Dependence and Alias Analysis. Proc. ACM Program. Lang. 2 POPL Article 30 (dec 2017) 30\u00a0pages. 10.1145\/3158118","DOI":"10.1145\/3158118"},{"key":"e_1_3_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1145\/1328438.1328460"},{"key":"e_1_3_3_2_8_2","doi-asserted-by":"publisher","unstructured":"Dmitry Chistikov Rupak Majumdar and Philipp Schepper. 2022. Subcubic certificates for CFL reachability. Proc. ACM Program. Lang. 6 POPL Article 41 (jan 2022) 29\u00a0pages. 10.1145\/3498702","DOI":"10.1145\/3498702"},{"key":"e_1_3_3_2_9_2","volume-title":"Programming Languages and Their Compilers: Preliminary Notes","author":"Cocke John","year":"1970","unstructured":"John Cocke and Jacob\u00a0T. Schwartz. 1970. Programming Languages and Their Compilers: Preliminary Notes. Technical Report. Courant Institute of Mathematical Sciences, New York University. Unpublished manuscript."},{"key":"e_1_3_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-44245-2_12"},{"key":"e_1_3_3_2_11_2","doi-asserted-by":"publisher","unstructured":"Manuel F\u00e4hndrich Jeffrey\u00a0S. Foster Zhendong Su and Alexander Aiken. 1998. Partial online cycle elimination in inclusion constraint graphs. SIGPLAN Not. 33 5 (May 1998) 85\u201396. 10.1145\/277652.277667","DOI":"10.1145\/277652.277667"},{"key":"e_1_3_3_2_12_2","doi-asserted-by":"crossref","unstructured":"Umar Farooq Zhijia Zhao Manu Sridharan and Iulian Neamtiu. 2020. Livedroid: Identifying and preserving mobile app state in volatile runtime environments. Proceedings of the ACM on Programming Languages 4 OOPSLA (2020) 1\u201330.","DOI":"10.1145\/3428228"},{"key":"e_1_3_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1145\/1134760.1134762"},{"key":"e_1_3_3_2_14_2","first-page":"17","volume-title":"10th USENIX symposium on operating systems design and implementation (OSDI 12)","author":"Gonzalez Joseph\u00a0E","year":"2012","unstructured":"Joseph\u00a0E Gonzalez, Yucheng Low, Haijie Gu, Danny Bickson, and Carlos Guestrin. 2012. { PowerGraph} : distributed { Graph-Parallel} computation on natural graphs. In 10th USENIX symposium on operating systems design and implementation (OSDI 12). 17\u201330."},{"key":"e_1_3_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2015.23089"},{"key":"e_1_3_3_2_16_2","doi-asserted-by":"crossref","unstructured":"Samuel Grossman Heiner Litz and Christos Kozyrakis. 2018. Making pull-based graph processing performant. ACM SIGPLAN Notices 53 1 (2018) 246\u2013260.","DOI":"10.1145\/3200691.3178506"},{"key":"e_1_3_3_2_17_2","unstructured":"Intel Corporation. 2024. concurrent_unordered_set Class. oneAPI Specification by Intel. https:\/\/spec.oneapi.io\/versions\/latest\/elements\/oneTBB\/source\/containers\/concurrent_unordered_set_cls.html Accessed: 2024-06-07."},{"key":"e_1_3_3_2_18_2","unstructured":"Intel Corporation. 2024. concurrent_vector Class. oneAPI Specification by Intel. https:\/\/spec.oneapi.io\/versions\/latest\/elements\/oneTBB\/source\/containers\/concurrent_vector_cls.html Accessed: 2024-06-07."},{"key":"e_1_3_3_2_19_2","doi-asserted-by":"crossref","unstructured":"Lin Jiang Junqiao Qiu and Zhijia Zhao. 2020. Scalable structural index construction for JSON analytics. Proceedings of the VLDB Endowment 14 4 (2020) 694.","DOI":"10.14778\/3436905.3436926"},{"key":"e_1_3_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.1145\/3297858.3304008"},{"key":"e_1_3_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.1145\/3503222.3507719"},{"key":"e_1_3_3_2_22_2","volume-title":"An efficient recognition and syntax-analysis algorithm for context-free languages","author":"Kasami Tadao","year":"1965","unstructured":"Tadao Kasami. 1965. An efficient recognition and syntax-analysis algorithm for context-free languages. Technical Report AFCRL-65-758. Air Force Cambridge Research Laboratory, Bedford, MA."},{"key":"e_1_3_3_2_23_2","doi-asserted-by":"publisher","DOI":"10.1145\/2600212.2600227"},{"key":"e_1_3_3_2_24_2","doi-asserted-by":"publisher","DOI":"10.1145\/996841.996867"},{"key":"e_1_3_3_2_25_2","doi-asserted-by":"publisher","unstructured":"Paraschos Koutris and Shaleen Deep. 2023. The Fine-Grained Complexity of CFL Reachability. Proc. ACM Program. Lang. 7 POPL Article 59 (jan 2023) 27\u00a0pages. 10.1145\/3571252","DOI":"10.1145\/3571252"},{"key":"e_1_3_3_2_26_2","doi-asserted-by":"publisher","unstructured":"Shankaranarayanan Krishna Aniket Lal Andreas Pavlogiannis and Omkar Tuppe. 2024. On-the-Fly Static Analysis via Dynamic Bidirected Dyck Reachability. Proc. ACM Program. Lang. 8 POPL Article 42 (jan 2024) 30\u00a0pages. 10.1145\/3632884","DOI":"10.1145\/3632884"},{"key":"e_1_3_3_2_27_2","first-page":"31","volume-title":"10th USENIX symposium on operating systems design and implementation (OSDI 12)","author":"Kyrola Aapo","year":"2012","unstructured":"Aapo Kyrola, Guy Blelloch, and Carlos Guestrin. 2012. { GraphChi} :{ Large-Scale} graph computation on just a { PC}. In 10th USENIX symposium on operating systems design and implementation (OSDI 12). 31\u201346."},{"key":"e_1_3_3_2_28_2","doi-asserted-by":"crossref","unstructured":"Geoff Langdale and Daniel Lemire. 2019. Parsing gigabytes of JSON per second. The VLDB Journal 28 6 (2019) 941\u2013960.","DOI":"10.1007\/s00778-019-00578-5"},{"key":"e_1_3_3_2_29_2","doi-asserted-by":"publisher","unstructured":"Yuxiang Lei Camille Bossut Yulei Sui and Qirun Zhang. 2024. Context-Free Language Reachability via Skewed Tabulation. Proc. ACM Program. Lang. 8 PLDI Article 221 (jun 2024) 24\u00a0pages. 10.1145\/3656451","DOI":"10.1145\/3656451"},{"key":"e_1_3_3_2_30_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-32304-2_3"},{"key":"e_1_3_3_2_31_2","doi-asserted-by":"crossref","unstructured":"Yuxiang Lei Yulei Sui Shuo Ding and Qirun Zhang. 2022. Taming transitive redundancy for context-free language reachability. Proceedings of the ACM on Programming Languages 6 OOPSLA2 (2022) 1556\u20131582.","DOI":"10.1145\/3563343"},{"key":"e_1_3_3_2_32_2","doi-asserted-by":"publisher","unstructured":"Yuxiang Lei Yulei Sui Shin\u00a0Hwei Tan and Qirun Zhang. 2023. Recursive State Machine Guided Graph Folding for Context-Free Language Reachability. Proc. ACM Program. Lang. 7 PLDI Article 119 (jun 2023) 25\u00a0pages. 10.1145\/3591233","DOI":"10.1145\/3591233"},{"key":"e_1_3_3_2_33_2","doi-asserted-by":"publisher","unstructured":"Nicola Leone Gerald Pfeifer Wolfgang Faber Thomas Eiter Georg Gottlob Simona Perri and Francesco Scarcello. 2006. The DLV System for Knowledge Representation and Reasoning. ACM Trans. Comput. Logic 7 3 (jul 2006) 499\u2013562. 10.1145\/1149114.1149117","DOI":"10.1145\/1149114.1149117"},{"key":"e_1_3_3_2_34_2","doi-asserted-by":"publisher","DOI":"10.1109\/CGO57630.2024.10444884"},{"key":"e_1_3_3_2_35_2","doi-asserted-by":"publisher","DOI":"10.1109\/CGO51591.2021.9370311"},{"key":"e_1_3_3_2_36_2","doi-asserted-by":"crossref","unstructured":"Yinan Li Nikos\u00a0R Katsipoulakis Badrish Chandramouli Jonathan Goldstein and Donald Kossmann. 2017. Mison: a fast JSON parser for data analytics. Proceedings of the VLDB Endowment 10 10 (2017) 1118\u20131129.","DOI":"10.14778\/3115404.3115416"},{"key":"e_1_3_3_2_37_2","doi-asserted-by":"publisher","unstructured":"Yuanbo Li Kris Satya and Qirun Zhang. 2022. Efficient algorithms for dynamic bidirected Dyck-reachability. Proc. ACM Program. Lang. 6 POPL Article 62 (jan 2022) 29\u00a0pages. 10.1145\/3498724","DOI":"10.1145\/3498724"},{"key":"e_1_3_3_2_38_2","doi-asserted-by":"publisher","unstructured":"Yuanbo Li Qirun Zhang and Thomas Reps. 2021. On the complexity of bidirected interleaved Dyck-reachability. Proc. ACM Program. Lang. 5 POPL Article 59 (jan 2021) 28\u00a0pages. 10.1145\/3434340","DOI":"10.1145\/3434340"},{"key":"e_1_3_3_2_39_2","doi-asserted-by":"publisher","unstructured":"Yuanbo Li Qirun Zhang and Thomas Reps. 2022. Fast Graph Simplification for Interleaved-Dyck Reachability. ACM Trans. Program. Lang. Syst. 44 2 Article 11 (may 2022) 28\u00a0pages. 10.1145\/3492428","DOI":"10.1145\/3492428"},{"key":"e_1_3_3_2_40_2","doi-asserted-by":"publisher","unstructured":"Yuanbo Li Qirun Zhang and Thomas Reps. 2023. Single-Source-Single-Target Interleaved-Dyck Reachability via Integer Linear Programming. Proc. ACM Program. Lang. 7 POPL Article 35 (jan 2023) 24\u00a0pages. 10.1145\/3571228","DOI":"10.1145\/3571228"},{"key":"e_1_3_3_2_41_2","unstructured":"LLNL SAFIRE Contributors. 2025. CFL Andersen Alias Analysis Implementation in SAFIRE (LLVM 3.9.0). https:\/\/github.com\/LLNL\/SAFIRE\/blob\/master\/llvm-3.9.0\/lib\/Analysis\/CFLAndersAliasAnalysis.cpp. Accessed: 2025-01-14."},{"key":"e_1_3_3_2_42_2","unstructured":"LLVM Project Contributors. 2025. LLVM Alias Analysis Documentation. https:\/\/llvm.org\/docs\/AliasAnalysis.html. Accessed: 2025-01-14."},{"key":"e_1_3_3_2_43_2","unstructured":"LLVM Project Contributors. 2025. Unification-based Alias Analysis. https:\/\/github.com\/llvm-mirror\/llvm\/blob\/master\/lib\/Analysis\/CFLSteensAliasAnalysis.cpp. Accessed: 2025-01-14."},{"key":"e_1_3_3_2_44_2","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"key":"e_1_3_3_2_45_2","doi-asserted-by":"crossref","unstructured":"Robert\u00a0Ryan McCune Tim Weninger and Greg Madey. 2015. Thinking like a vertex: a survey of vertex-centric frameworks for large-scale distributed graph processing. ACM Computing Surveys (CSUR) 48 2 (2015) 1\u201339.","DOI":"10.1145\/2818185"},{"key":"e_1_3_3_2_46_2","doi-asserted-by":"crossref","unstructured":"David Melski and Thomas Reps. 2000. Interconvertibility of a class of set constraints and context-free-language reachability. Theoretical Computer Science 248 1-2 (2000) 29\u201398.","DOI":"10.1016\/S0304-3975(00)00049-9"},{"key":"e_1_3_3_2_47_2","doi-asserted-by":"publisher","unstructured":"Ana Milanova. 2020. FlowCFL: generalized type-based reachability analysis: graph reduction and equivalence of CFL-based and type-based reachability. Proc. ACM Program. Lang. 4 OOPSLA Article 178 (nov 2020) 29\u00a0pages. 10.1145\/3428246","DOI":"10.1145\/3428246"},{"key":"e_1_3_3_2_48_2","doi-asserted-by":"crossref","unstructured":"Amir\u00a0Hossein Nodehi\u00a0Sabet Junqiao Qiu and Zhijia Zhao. 2018. Tigr: Transforming irregular graphs for gpu-friendly graph processing. ACM SIGPLAN Notices 53 2 (2018) 622\u2013636.","DOI":"10.1145\/3296957.3173180"},{"key":"e_1_3_3_2_49_2","doi-asserted-by":"publisher","unstructured":"Andreas Pavlogiannis. 2023. CFL\/Dyck Reachability: An Algorithmic Perspective. ACM SIGLOG News 9 4 (feb 2023) 5\u201325. 10.1145\/3583660.3583664","DOI":"10.1145\/3583660.3583664"},{"key":"e_1_3_3_2_50_2","doi-asserted-by":"publisher","DOI":"10.1109\/CGO.2009.9"},{"key":"e_1_3_3_2_51_2","doi-asserted-by":"publisher","DOI":"10.1007\/11823230_7"},{"key":"e_1_3_3_2_52_2","doi-asserted-by":"crossref","unstructured":"Jakob Rehof and Manuel F\u00e4hndrich. 2001. Type-base flow analysis: from polymorphic subtyping to CFL-reachability. ACM SIGPLAN Notices 36 3 (2001) 54\u201366.","DOI":"10.1145\/373243.360208"},{"key":"e_1_3_3_2_53_2","doi-asserted-by":"publisher","DOI":"10.1145\/215465.215466"},{"key":"e_1_3_3_2_54_2","doi-asserted-by":"publisher","unstructured":"Thomas Reps. 1998. Program analysis via graph reachability. Information and Software Technology 40 11 (1998) 701\u2013726. 10.1016\/S0950-5849(98)00093-7","DOI":"10.1016\/S0950-5849(98)00093-7"},{"key":"e_1_3_3_2_55_2","doi-asserted-by":"publisher","DOI":"10.1145\/199448.199462"},{"key":"e_1_3_3_2_56_2","doi-asserted-by":"crossref","unstructured":"Thomas Reps Susan Horwitz Mooly Sagiv and Genevieve Rosay. 1994. Speeding up slicing. ACM SIGSOFT Software Engineering Notes 19 5 (1994) 11\u201320.","DOI":"10.1145\/195274.195287"},{"key":"e_1_3_3_2_57_2","doi-asserted-by":"publisher","DOI":"10.1145\/3342195.3387537"},{"key":"e_1_3_3_2_58_2","doi-asserted-by":"crossref","unstructured":"Majid Saeedan Ahmed Eldawy and Zhijia Zhao. 2023. dsJSON: A Distributed SQL JSON Processor. Proceedings of the ACM on Management of Data 1 1 (2023) 1\u201325.","DOI":"10.1145\/3588957"},{"key":"e_1_3_3_2_59_2","first-page":"593","volume-title":"Proceedings of the International Conference on Machine Translation of Languages and Applied Language Analysis","author":"Sakai Itiroo","year":"1962","unstructured":"Itiroo Sakai. 1962. Syntax in Universal Translation. In Proceedings of the International Conference on Machine Translation of Languages and Applied Language Analysis. Her Majesty\u2019s Stationery Office, London, 593\u2013608."},{"key":"e_1_3_3_2_60_2","doi-asserted-by":"publisher","DOI":"10.1145\/2892208.2892226"},{"key":"e_1_3_3_2_61_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544832"},{"key":"e_1_3_3_2_62_2","doi-asserted-by":"publisher","DOI":"10.1145\/2259016.2259050"},{"key":"e_1_3_3_2_63_2","doi-asserted-by":"publisher","DOI":"10.1145\/3650212.3680346"},{"key":"e_1_3_3_2_64_2","doi-asserted-by":"publisher","DOI":"10.1109\/ASE56229.2023.00118"},{"key":"e_1_3_3_2_65_2","doi-asserted-by":"publisher","unstructured":"Qingkai Shi Yongchao Wang Peisen Yao and Charles Zhang. 2022. Indexing the Extended Dyck-CFL Reachability for Context-Sensitive Program Analysis. Proc. ACM Program. Lang. 6 OOPSLA2 Article 176 (oct 2022) 31\u00a0pages. 10.1145\/3563339","DOI":"10.1145\/3563339"},{"key":"e_1_3_3_2_66_2","doi-asserted-by":"publisher","DOI":"10.1145\/2442516.2442530"},{"key":"e_1_3_3_2_67_2","doi-asserted-by":"crossref","unstructured":"Manu Sridharan and Rastislav Bod\u00edk. 2006. Refinement-based context-sensitive points-to analysis for Java. ACM SIGPLAN Notices 41 6 (2006) 387\u2013400.","DOI":"10.1145\/1133255.1134027"},{"key":"e_1_3_3_2_68_2","doi-asserted-by":"crossref","unstructured":"Manu Sridharan Denis Gopan Lexin Shan and Rastislav Bod\u00edk. 2005. Demand-driven points-to analysis for Java. ACM SIGPLAN Notices 40 10 (2005) 59\u201376.","DOI":"10.1145\/1103845.1094817"},{"key":"e_1_3_3_2_69_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2014.54"},{"key":"e_1_3_3_2_70_2","doi-asserted-by":"publisher","DOI":"10.1145\/2892208.2892235"},{"key":"e_1_3_3_2_71_2","doi-asserted-by":"publisher","DOI":"10.1145\/3611643.3616348"},{"key":"e_1_3_3_2_72_2","doi-asserted-by":"publisher","unstructured":"Wensheng Tang Dejun Dong Shijie Li Chengpeng Wang Peisen Yao Jinguo Zhou and Charles Zhang. 2024. Octopus: Scaling Value-Flow Analysis via Parallel Collection of Realizable Path Conditions. ACM Trans. Softw. Eng. Methodol. 33 3 Article 66 (mar 2024) 33\u00a0pages. 10.1145\/3632743","DOI":"10.1145\/3632743"},{"key":"e_1_3_3_2_73_2","doi-asserted-by":"publisher","DOI":"10.1145\/1925805.1925818"},{"key":"e_1_3_3_2_74_2","doi-asserted-by":"publisher","DOI":"10.1145\/3037697.3037744"},{"key":"e_1_3_3_2_75_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE48619.2023.00208"},{"key":"e_1_3_3_2_76_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03013-0_6"},{"key":"e_1_3_3_2_77_2","doi-asserted-by":"publisher","unstructured":"Pei Xu Yuxiang Lei Yulei Sui and Jingling Xue. 2024. Iterative-Epoch Online Cycle Elimination for Context-Free Language Reachability. Proc. ACM Program. Lang. 8 OOPSLA1 Article 145 (apr 2024) 26\u00a0pages. 10.1145\/3649862","DOI":"10.1145\/3649862"},{"key":"e_1_3_3_2_78_2","doi-asserted-by":"publisher","DOI":"10.1145\/3225058.3225122"},{"key":"e_1_3_3_2_79_2","doi-asserted-by":"publisher","DOI":"10.1145\/298514.298576"},{"key":"e_1_3_3_2_80_2","doi-asserted-by":"crossref","unstructured":"Daniel\u00a0H. Younger. 1967. Recognition and parsing of context-free languages in time n\u2227 3. Information and Control 10 2 (1967) 189\u2013208.","DOI":"10.1016\/S0019-9958(67)80007-X"},{"key":"e_1_3_3_2_81_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00590-9_13"},{"key":"e_1_3_3_2_82_2","doi-asserted-by":"publisher","DOI":"10.1145\/2491956.2462159"},{"key":"e_1_3_3_2_83_2","doi-asserted-by":"publisher","DOI":"10.1145\/1328438.1328464"},{"key":"e_1_3_3_2_84_2","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2019.00086"},{"key":"e_1_3_3_2_85_2","doi-asserted-by":"publisher","DOI":"10.1145\/3302424.3303972"},{"key":"e_1_3_3_2_86_2","doi-asserted-by":"publisher","unstructured":"Zhiqiang Zuo Kai Wang Aftab Hussain Ardalan\u00a0Amiri Sani Yiyu Zhang Shenming Lu Wensheng Dou Linzhang Wang Xuandong Li Chenxi Wang and Guoqing\u00a0Harry Xu. 2021. Systemizing Interprocedural Static Analysis of Large-scale Systems Code with Graspan. ACM Trans. Comput. Syst. 38 1\u20132 Article 4 (jul 2021) 39\u00a0pages. 10.1145\/3466820","DOI":"10.1145\/3466820"},{"key":"e_1_3_3_2_87_2","doi-asserted-by":"publisher","DOI":"10.1145\/3453483.3454085"}],"event":{"name":"ICS '25: 2025 International Conference on Supercomputing","location":"Salt Lake City USA","acronym":"ICS '25","sponsor":["SIGARCH ACM Special Interest Group on Computer Architecture"]},"container-title":["Proceedings of the 39th ACM International Conference on Supercomputing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3721145.3725762","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3721145.3725762","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T13:01:55Z","timestamp":1755867715000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3721145.3725762"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,8]]},"references-count":86,"alternative-id":["10.1145\/3721145.3725762","10.1145\/3721145"],"URL":"https:\/\/doi.org\/10.1145\/3721145.3725762","relation":{},"subject":[],"published":{"date-parts":[[2025,6,8]]},"assertion":[{"value":"2025-08-22","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}