{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T20:07:47Z","timestamp":1773778067202,"version":"3.50.1"},"reference-count":94,"publisher":"Association for Computing Machinery (ACM)","issue":"1","funder":[{"DOI":"10.13039\/501100005145","name":"Basic Research Program of Jiangsu Province","doi-asserted-by":"crossref","award":["BK20250067"],"award-info":[{"award-number":["BK20250067"]}],"id":[{"id":"10.13039\/501100005145","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62272217"],"award-info":[{"award-number":["62272217"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"National Key Research and Development Program of China","award":["2024YFB2505604"],"award-info":[{"award-number":["2024YFB2505604"]}]},{"name":"Alibaba Group via Alibaba Innovative Research (AIR) program"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Program. Lang. Syst."],"published-print":{"date-parts":[[2026,3,31]]},"abstract":"<jats:p>Apart from forming the backbone of compiler optimization, static dataflow analysis has been widely applied in a vast variety of applications, such as bug detection, privacy analysis, and program comprehension. Despite its importance, performing inter-procedural dataflow analysis on large-scale programs is well-known to be challenging. In this article, we propose a novel distributed analysis framework supporting the general inter-procedural dataflow analysis. Inspired by large-scale graph processing, we devise dedicated distributed worklist algorithms for both whole-program analysis and incremental analysis. We implement these algorithms and develop a distributed framework called BigDataflow running on a large-scale cluster. The experimental results validate the promising performance of BigDataflow\u2014BigDataflow can finish analyzing the program of million lines of code in minutes. Compared with the state-of-the-art, BigDataflow achieves much more analysis efficiency.<\/jats:p>","DOI":"10.1145\/3786763","type":"journal-article","created":{"date-parts":[[2025,12,26]],"date-time":"2025-12-26T14:20:17Z","timestamp":1766758817000},"page":"1-40","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Scaling Inter-procedural Dataflow Analysis on the Cloud"],"prefix":"10.1145","volume":"48","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-1293-122X","authenticated-orcid":false,"given":"Zewen","family":"Sun","sequence":"first","affiliation":[{"name":"Nanjing University, Nanjing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-2563-4554","authenticated-orcid":false,"given":"Yujin","family":"Zhang","sequence":"additional","affiliation":[{"name":"Nanjing University, Nanjing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-1129-722X","authenticated-orcid":false,"given":"Yueyang","family":"Wang","sequence":"additional","affiliation":[{"name":"Nanjing University, Nanjing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-3833-5381","authenticated-orcid":false,"given":"Duanchen","family":"Xu","sequence":"additional","affiliation":[{"name":"Nanjing University, Nanjing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-7412-5293","authenticated-orcid":false,"given":"Yiyu","family":"Zhang","sequence":"additional","affiliation":[{"name":"Nanjing University, Nanjing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-4901-369X","authenticated-orcid":false,"given":"Yun","family":"Qi","sequence":"additional","affiliation":[{"name":"Nanjing University, Nanjing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8123-9018","authenticated-orcid":false,"given":"Zhaokang","family":"Wang","sequence":"additional","affiliation":[{"name":"Nanjing University, Nanjing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-1285-2298","authenticated-orcid":false,"given":"Yue","family":"Li","sequence":"additional","affiliation":[{"name":"Nanjing University, Nanjing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3090-9568","authenticated-orcid":false,"given":"Xuandong","family":"Li","sequence":"additional","affiliation":[{"name":"Nanjing University, Nanjing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-8492-6096","authenticated-orcid":false,"given":"Qingda","family":"Lu","sequence":"additional","affiliation":[{"name":"Alibaba Cloud Computing, Sunnyvale, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-4700-0225","authenticated-orcid":false,"given":"Wenwen","family":"Peng","sequence":"additional","affiliation":[{"name":"Alibaba Cloud Computing, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9145-9279","authenticated-orcid":false,"given":"Shengjian","family":"Guo","sequence":"additional","affiliation":[{"name":"Baidu Research, Mountain View, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7104-9918","authenticated-orcid":false,"given":"Zhiqiang","family":"Zuo","sequence":"additional","affiliation":[{"name":"Nanjing University, Nanjing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2026,3,17]]},"reference":[{"key":"e_1_3_3_2_2","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/1086.001.0001","volume-title":"Actors: A Model of Concurrent Computation in Distributed Systems","author":"Agha Gul","year":"1986","unstructured":"Gul Agha. 1986. Actors: A Model of Concurrent Computation in Distributed Systems. MIT Press."},{"key":"e_1_3_3_3_2","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1145\/1251535.1251543","volume-title":"PASTE","author":"Aiken Alex","year":"2007","unstructured":"Alex Aiken, Suhabe Bugrara, Isil Dillig, Thomas Dillig, Brian Hackett, and Peter Hawkins. 2007. An overview of the Saturn project. In PASTE. ACM, 43\u201348. DOI: 10.1145\/1251535.1251543"},{"key":"e_1_3_3_4_2","first-page":"217","volume-title":"PLDI","author":"Albarghouthi Aws","year":"2012","unstructured":"Aws Albarghouthi, Rahul Kumar, Aditya V. Nori, and Sriram K. Rajamani. 2012. Parallelizing top-down interprocedural analyses. In PLDI. ACM, 217\u2013228. DOI: 10.1145\/2254064.2254091"},{"key":"e_1_3_3_5_2","first-page":"288","volume-title":"ICSE","author":"Arzt Steven","year":"2014","unstructured":"Steven Arzt and Eric Bodden. 2014. Reviser: Efficiently updating IDE-\/IFDS-based data-flow analyses in response to incremental program changes. In ICSE. ACM, 288\u2013298. DOI: 10.1145\/2568225.2568243"},{"key":"e_1_3_3_6_2","first-page":"259","volume-title":"PLDI","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 PLDI. ACM, 259\u2013269. DOI: 10.1145\/2594291.2594299"},{"issue":"3","key":"e_1_3_3_7_2","first-page":"5","article-title":"Giraph: Large-scale graph processing infrastructure on hadoop","volume":"11","author":"Avery Ching","year":"2011","unstructured":"Ching Avery. 2011. Giraph: Large-scale graph processing infrastructure on hadoop. Proceedings of the Hadoop Summit, Santa Clara 11, 3 (2011), 5\u20139.","journal-title":"Proceedings of the Hadoop Summit, Santa Clara"},{"key":"e_1_3_3_8_2","volume-title":"Laws for Communicating Parallel Processes","author":"Baker Henry","year":"1977","unstructured":"Henry Baker and Carl Hewitt. 1977. Laws for Communicating Parallel Processes. MIT Artificial Intelligence Laboratory Working Papers, WP-134A. MIT Artificial Intelligence Laboratory."},{"key":"e_1_3_3_9_2","volume-title":"Computer Systems: A Programmer\u2019s Perspective","author":"Bryant Randal E.","year":"2011","unstructured":"Randal E. Bryant and David Richard O\u2019Hallaron. 2011. Computer Systems: A Programmer\u2019s Perspective. Prentice Hall."},{"key":"e_1_3_3_10_2","doi-asserted-by":"publisher","DOI":"10.1109\/32.56098"},{"key":"e_1_3_3_11_2","doi-asserted-by":"publisher","DOI":"10.1145\/3498721"},{"key":"e_1_3_3_12_2","volume-title":"Frameworks for Intra- and Interprocedural Dataflow Analysis\n                  Technical Report","author":"Chambers Craig","year":"1996","unstructured":"Craig Chambers, Jeffrey Dean, and David Grove. 1996. Frameworks for Intra- and Interprocedural Dataflow Analysis. Technical Report. University of Washington."},{"key":"e_1_3_3_13_2","doi-asserted-by":"publisher","DOI":"10.14778\/2824032.2824077"},{"key":"e_1_3_3_14_2","first-page":"55","volume-title":"POPL","author":"Choi Jong-Deok","unstructured":"Jong-Deok Choi, Ron Cytron, and Jeanne Ferrante. 1991. Automatic construction of sparse data flow evaluation graphs. In POPL. ACM, 55\u201366. DOI: 10.1145\/99583.99594"},{"key":"e_1_3_3_15_2","first-page":"1367","volume-title":"ESEC\/FSE","author":"Christakis Maria","year":"2022","unstructured":"Maria Christakis, Thomas Cottenier, Antonio Filieri, Linghui Luo, Muhammad Numair Mansur, Lee Pike, Nicol\u00e1s Rosner, Martin Sch\u00e4f, Aritra Sengupta, and Willem Visser. 2022. Input splitting for cloud-based static application security testing platforms. In ESEC\/FSE. ACM, 1367\u20131378. DOI: 10.1145\/3540250.3558944"},{"key":"e_1_3_3_16_2","volume-title":"Asynchronous Iterative Methods for Solving a Fixpoint System of Monotone Equations","year":"1977","unstructured":"Patrick Cousot. 1977. Asynchronous Iterative Methods for Solving a Fixpoint System of Monotone Equations. Technical Report. Research Report IMAG-RR-88, University of Grenoble, France."},{"key":"e_1_3_3_17_2","first-page":"238","volume-title":"POPL","author":"Cousot Patrick","unstructured":"Patrick Cousot and Radhia Cousot. 1977. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In POPL. ACM, 238\u2013252. DOI: 10.1145\/512950.512973"},{"key":"e_1_3_3_18_2","first-page":"237","volume-title":"IFIP","author":"Cousot Patrick","year":"1977","unstructured":"Patrick Cousot and Radhia Cousot. 1977. Static determination of dynamic properties of recursive procedures. In IFIP, 237\u2013277."},{"issue":"1","key":"e_1_3_3_19_2","doi-asserted-by":"crossref","first-page":"43","DOI":"10.2140\/pjm.1979.82.43","article-title":"Constructive versions of Tarski\u2019s fixed point theorems","volume":"82","author":"Cousot Patrick","year":"1979","unstructured":"Patrick Cousot and Radhia Cousot. 1979. Constructive versions of Tarski\u2019s fixed point theorems. Pacific Journal of Mathematics 82, 1 (1979), 43\u201357.","journal-title":"Pacific Journal of Mathematics"},{"key":"e_1_3_3_20_2","first-page":"269","volume-title":"PLILP","author":"Cousot Patrick","year":"1992","unstructured":"Patrick Cousot and Radhia Cousot. 1992. Comparing the Galois connection and widening\/narrowing approaches to abstract interpretation. In PLILP. Springer, 269\u2013295. DOI: 10.1007\/3-540-55844-6_142"},{"key":"e_1_3_3_21_2","first-page":"2","volume-title":"CEUR","volume":"3801","author":"de Lima Bruno Rucy Carneiro Alves","year":"2024","unstructured":"Bruno Rucy Carneiro Alves de Lima, Merlin Kramer, Kalmer Apinis, and Kristopher Micinski. 2024. Incremental evaluation of dynamic datalog programs as a higher-order DBSP program. In CEUR, Vol. 3801, CEUR-WS, 2\u201316."},{"key":"e_1_3_3_22_2","first-page":"34","volume-title":"CGO","author":"Dewey Kyle","year":"2015","unstructured":"Kyle Dewey, Vineeth Kashyap, and Ben Hardekopf. 2015. A parallel abstract interpreter for JavaScript. In CGO. IEEE, 34\u201345. DOI: 10.1109\/CGO.2015.7054185"},{"key":"e_1_3_3_23_2","doi-asserted-by":"publisher","DOI":"10.1145\/2756550"},{"key":"e_1_3_3_24_2","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1145\/178243.178264","volume-title":"PLDI","author":"Emami Maryam","year":"1994","unstructured":"Maryam Emami, Rakesh Ghiya, and Laurie J. Hendren. 1994. Context-sensitive interprocedural points-to analysis in the presence of function pointers. In PLDI. ACM, 242\u2013256. DOI: 10.1145\/178243.178264"},{"key":"e_1_3_3_25_2","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1023\/A:1008186323068","article-title":"Efficient and precise cache behavior prediction for real-time systems","volume":"17","author":"Ferdinand Christian","year":"1999","unstructured":"Christian Ferdinand and Reinhard Wilhelm. 1999. Efficient and precise cache behavior prediction for real-time systems. Real-Time Systems 17 (1999), 131\u2013181. https:\/\/doi.org\/10.1023\/A:1008186323068","journal-title":"Real-Time Systems"},{"key":"e_1_3_3_26_2","first-page":"442","volume-title":"ESEC\/FSE","author":"Garbervetsky Diego","year":"2017","unstructured":"Diego Garbervetsky, Edgardo Zoppi, and Benjamin Livshits. 2017. Toward full elasticity in distributed static analysis: The case of callgraph analysis. In ESEC\/FSE. ACM, 442\u2013453. DOI: 10.1145\/3106237.3106261"},{"key":"e_1_3_3_27_2","first-page":"17","volume-title":"OSDI","author":"Gonzalez Joseph E.","year":"2012","unstructured":"Joseph E. Gonzalez, Yucheng Low, Haijie Gu, Danny Bickson, and Carlos Guestrin. 2012. PowerGraph: Distributed graph-parallel computation on natural graphs. In OSDI. USENIX Association, 17\u201330. Retrieved from https:\/\/www.usenix.org\/conference\/osdi12\/technical-sessions\/presentation\/gonzalez"},{"key":"e_1_3_3_28_2","first-page":"599","volume-title":"OSDI","author":"Gonzalez Joseph E.","year":"2014","unstructured":"Joseph E. Gonzalez, Reynold S. Xin, Ankur Dave, Daniel Crankshaw, Michael J. Franklin, and Ion Stoica. 2014. GraphX: Graph processing in a distributed dataflow framework. In OSDI. USENIX Association, 599\u2013613. Retrieved from https:\/\/www.usenix.org\/system\/files\/conference\/osdi14\/osdi14-paper-gonzalez.pdf"},{"key":"e_1_3_3_29_2","author":"Goodman Nathan","year":"1976","unstructured":"Nathan Goodman. 1976. Coordination of Parallel Processes in the Actor Model of Computation. Technical Report. Retrieved from https:\/\/hdl.handle.net\/1721.1\/149466","journal-title":"Coordination of Parallel Processes in the Actor Model of Computation"},{"key":"e_1_3_3_30_2","first-page":"277","volume-title":"CGO","author":"Greathouse Joseph L.","year":"2011","unstructured":"Joseph L. Greathouse, Chelsea LeBlanc, Todd Austin, and Valeria Bertacco. 2011. Highly scalable distributed dataflow analysis. In CGO. IEEE, 277\u2013288. DOI: 10.1109\/CGO.2011.5764695"},{"key":"e_1_3_3_31_2","first-page":"246","volume-title":"PPoPP","author":"Grossman Samuel","year":"2018","unstructured":"Samuel Grossman, Heiner Litz, and Christos Kozyrakis. 2018. Making pull-based graph processing performant. In PPoPP. ACM, 246\u2013260. DOI: 10.1145\/3178487.3178506"},{"key":"e_1_3_3_32_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2020.3036190"},{"key":"e_1_3_3_33_2","first-page":"253","volume-title":"ESOP","author":"Gulwani Sumit","year":"2007","unstructured":"Sumit Gulwani and Ashish Tiwari. 2007. Computing procedure summaries for interprocedural analysis. In ESOP. Springer, 253\u2013267. DOI: 10.1007\/978-3-540-71316-6_18"},{"key":"e_1_3_3_34_2","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1145\/1480881.1480911","volume-title":"POPL","author":"Hardekopf Ben","year":"2009","unstructured":"Ben Hardekopf and Calvin Lin. 2009. Semi-sparse flow-sensitive pointer analysis. In POPL. ACM, 226\u2013238. DOI: 10.1145\/1480881.1480911"},{"key":"e_1_3_3_35_2","first-page":"289","volume-title":"CGO","author":"Hardekopf Ben","year":"2011","unstructured":"Ben Hardekopf and Calvin Lin. 2011. Flow-sensitive pointer analysis for millions of lines of code. In CGO. IEEE, 289\u2013298. DOI: 10.1109\/CGO.2011.5764696"},{"key":"e_1_3_3_36_2","first-page":"383","volume-title":"QRS-C","author":"Harianto Koko","year":"2024","unstructured":"Koko Harianto, Feng-Jian Wang, and Mahmoud M. Abouzeid. 2024. Enhancing incremental dataflow analysis in an IDE. In QRS-C. IEEE, 383\u2013390. DOI: 10.1109\/QRS-C63300.2024.00055"},{"key":"e_1_3_3_37_2","doi-asserted-by":"publisher","DOI":"10.1145\/3276510"},{"key":"e_1_3_3_38_2","doi-asserted-by":"publisher","DOI":"10.1145\/321921.321938"},{"key":"e_1_3_3_39_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF00290339"},{"key":"e_1_3_3_40_2","unstructured":"Arijit Khan. 2016. Vertex-centric graph processing: The good the bad and the ugly. arXiv:1612.07404. Retrieved from https:\/\/arxiv.org\/abs\/1612.07404"},{"key":"e_1_3_3_41_2","first-page":"194","volume-title":"POPL","author":"Kildall Gary A.","unstructured":"Gary A. Kildall. 1973. A unified approach to global program optimization. In POPL. ACM, 194\u2013206. DOI: 10.1145\/512927.512945"},{"key":"e_1_3_3_42_2","doi-asserted-by":"publisher","DOI":"10.1145\/3371082"},{"key":"e_1_3_3_43_2","first-page":"250","volume-title":"ASE","author":"Lee Sungho","year":"2016","unstructured":"Sungho Lee, Julian Dolby, and Sukyoung Ryu. 2016. HybriDroid: Static analysis framework for android hybrid applications. In ASE. ACM, 250\u2013261. DOI: 10.1145\/2970276.2970368"},{"key":"e_1_3_3_44_2","first-page":"236","volume-title":"ICS","author":"Lee Yong-Fong","unstructured":"Yong-Fong Lee and Barbara G. Ryder. 1992. A comprehensive approach to parallel data flow analysis. In ICS. ACM, 236\u2013247. DOI: 10.1145\/143369.143415"},{"key":"e_1_3_3_45_2","doi-asserted-by":"publisher","DOI":"10.1145\/3276511"},{"key":"e_1_3_3_46_2","doi-asserted-by":"publisher","DOI":"10.1145\/3527332"},{"key":"e_1_3_3_47_2","doi-asserted-by":"publisher","DOI":"10.1145\/3293606"},{"key":"e_1_3_3_48_2","unstructured":"Yucheng Low Joseph Gonzalez Aapo Kyrola Danny Bickson Carlos Guestrin and Joseph M. Hellerstein. 2012. Distributed GraphLab: A framework for machine learning in the cloud. arXiv:1204.6078. Retrieved from https:\/\/arxiv.org\/abs\/1204.6078"},{"key":"e_1_3_3_49_2","first-page":"61","volume-title":"CC","author":"Lu Yi","year":"2013","unstructured":"Yi Lu, Lei Shang, Xinwei Xie, and Jingling Xue. 2013. An incremental points-to analysis with CFL-reachability. In CC. Springer, 61\u201381. DOI: 10.1007\/978-3-642-37051-9_4"},{"key":"e_1_3_3_50_2","doi-asserted-by":"publisher","DOI":"10.4230\/LITES-v003-i001-a005"},{"key":"e_1_3_3_51_2","first-page":"135","volume-title":"SIGMOD","author":"Malewicz Grzegorz","year":"2010","unstructured":"Grzegorz Malewicz, Matthew H. Austern, Aart J. C. Bik, James C. Dehnert, Ilan Horn, Naty Leiser, and Grzegorz Czajkowski. 2010. Pregel: A system for large-scale graph processing. In SIGMOD. ACM, 135\u2013146. DOI: 10.1145\/1807167.1807184"},{"key":"e_1_3_3_52_2","first-page":"184","volume-title":"POPL","author":"Marlowe Thomas J.","year":"1989","unstructured":"Thomas J. Marlowe and Barbara G. Ryder. 1989. An efficient hybrid algorithm for incremental data flow analysis. In POPL. ACM, 184\u2013196. DOI: 10.1145\/96709.96728"},{"key":"e_1_3_3_53_2","doi-asserted-by":"publisher","DOI":"10.1145\/2818185"},{"key":"e_1_3_3_54_2","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1145\/328690.328703","volume-title":"PEPM","author":"Murphy Brian R.","year":"1999","unstructured":"Brian R. Murphy and Monica S. Lam. 1999. Program analysis with partial transfer functions. In PEPM. ACM, 94\u2013103. DOI: 10.1145\/328690.328703"},{"key":"e_1_3_3_55_2","first-page":"19","volume-title":"In PACT","author":"Nagaraj Vaivaswatha","year":"2013","unstructured":"Vaivaswatha Nagaraj and R. Govindarajan. 2013. Parallel flow-sensitive pointer analysis by graph-rewriting. In PACT. IEEE, 19\u201328. DOI: 10.1109\/PACT.2013.6618800"},{"key":"e_1_3_3_56_2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03811-6","volume-title":"Principles of Program Analysis","author":"Nielson Flemming","year":"1999","unstructured":"Flemming Nielson, Hanne R. Nielson, and Chris Hankin. 1999. Principles of Program Analysis. Springer."},{"key":"e_1_3_3_57_2","doi-asserted-by":"publisher","DOI":"10.1109\/32.58766"},{"key":"e_1_3_3_58_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00315-7"},{"key":"e_1_3_3_59_2","first-page":"5","volume-title":"ILPS","author":"Thomas Reps","year":"1997","unstructured":"Reps Thomas. 1997. Program analysis via graph reachability. In ILPS. MIT Press, 5\u201319."},{"key":"e_1_3_3_60_2","first-page":"49","volume-title":"POPL","author":"Reps Thomas","unstructured":"Thomas Reps, Susan Horwitz, and Mooly Sagiv. 1995. Precise interprocedural dataflow analysis via graph reachability. In POPL. ACM, 49\u201361. DOI: 10.1145\/199448.199462"},{"key":"e_1_3_3_61_2","first-page":"179","volume-title":"CC","author":"Rodriguez Jonathan","year":"2011","unstructured":"Jonathan Rodriguez and Ond\u0159ej Lhot\u00e1k. 2011. Actor-based parallel dataflow analysis. In CC. Springer, 179\u2013197. DOI: 10.1007\/978-3-642-19861-8_11"},{"key":"e_1_3_3_62_2","first-page":"167","volume-title":"POPL","author":"Ryder Barbara G.","unstructured":"Barbara G. Ryder. 1983. Incremental data flow analysis. In POPL. ACM, 167\u2013176. DOI: 10.1145\/567067.567084"},{"key":"e_1_3_3_63_2","first-page":"4","article-title":"Differential datalog","volume":"2","author":"Ryzhyk Leonid","year":"2019","unstructured":"Leonid Ryzhyk and Mihai Budiu. 2019. Differential datalog. Datalog 2 (2019), 4\u20135.","journal-title":"Datalog"},{"key":"e_1_3_3_64_2","doi-asserted-by":"publisher","DOI":"10.1145\/3188720"},{"key":"e_1_3_3_65_2","first-page":"598","volume-title":"ICSE","author":"Sadowski Caitlin","year":"2015","unstructured":"Caitlin Sadowski, Jeffrey van Gogh, Ciera Jaspan, Emma S\u00f6derberg, and Collin Winter. 2015. Tricorder: Building a program analysis ecosystem. In ICSE. IEEE, 598\u2013608. DOI: 10.1109\/ICSE.2015.76"},{"key":"e_1_3_3_66_2","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1145\/1069774.1069785","volume-title":"PPDP","author":"Saha Diptikalyan","year":"2005","unstructured":"Diptikalyan Saha and C. R. Ramakrishnan. 2005. Incremental and demand-driven points-to analysis using logic programming. In PPDP. ACM, 117\u2013128. DOI: 10.1145\/1069774.1069785"},{"key":"e_1_3_3_67_2","volume-title":"Practical Graph Analytics with Apache Giraph","author":"Shaposhnik Roman","year":"2015","unstructured":"Roman Shaposhnik, Claudio Martella, and Dionysios Logothetis. 2015. Practical Graph Analytics with Apache Giraph (1st ed.). Apress.","edition":"1"},{"key":"e_1_3_3_68_2","volume-title":"Two Approaches to Interprocedural Data Flow Analysis","author":"Sharir Micha","year":"1978","unstructured":"Micha Sharir and Amir Pnueli. 1978. Two Approaches to Interprocedural Data Flow Analysis. New York University Computer Science Department. Retrieved from https:\/\/cds.cern.ch\/record\/120118"},{"key":"e_1_3_3_69_2","first-page":"693","volume-title":"PLDI","author":"Shi Qingkai","year":"2018","unstructured":"Qingkai Shi, Xiao Xiao, Rongxin Wu, Jinguo Zhou, Gang Fan, and Charles Zhang. 2018. Pinpoint: Fast and precise sparse value flow analysis for million lines of code. In PLDI. ACM, 693\u2013706. DOI: 10.1145\/3192366.3192418"},{"key":"e_1_3_3_70_2","volume-title":"Control-Flow Analysis of Higher-Order Languages of Taming Lambda","author":"Olin Grigsby Shivers","year":"1991","unstructured":"Shivers Olin Grigsby. 1991. Control-Flow Analysis of Higher-Order Languages of Taming Lambda. Ph.D. Dissertation. UMI Order No. GAX91-26964. Carnegie Mellon University."},{"key":"e_1_3_3_71_2","first-page":"135","volume-title":"PPoPP","author":"Shun Julian","year":"2013","unstructured":"Julian Shun and Guy E. Blelloch. 2013. Ligra: A lightweight graph processing framework for shared memory. In PPoPP. ACM, 135\u2013146. DOI: 10.1145\/2442516.2442530"},{"key":"e_1_3_3_72_2","doi-asserted-by":"publisher","DOI":"10.1145\/276393.278523"},{"key":"e_1_3_3_73_2","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1145\/1094811.1094817","volume-title":"OOPSLA","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 OOPSLA. ACM, 59\u201376. DOI: 10.1145\/1094811.1094817"},{"key":"e_1_3_3_74_2","doi-asserted-by":"publisher","DOI":"10.1145\/3020266"},{"key":"e_1_3_3_75_2","first-page":"451","volume-title":"ICPP","author":"Su Yu","year":"2014","unstructured":"Yu Su, Ding Ye, and Jingling Xue. 2014. Parallel pointer analysis with CFL-reachability. In ICPP. IEEE, 451\u2013460. DOI: 10.1109\/ICPP.2014.54"},{"key":"e_1_3_3_76_2","first-page":"265","volume-title":"CC","author":"Sui Yulei","year":"2016","unstructured":"Yulei Sui and Jingling Xue. 2016. SVF: Interprocedural static value-flow analysis in LLVM. In CC. ACM, 265\u2013266. DOI: 10.1145\/2892208.2892235"},{"key":"e_1_3_3_77_2","doi-asserted-by":"publisher","DOI":"10.1145\/3276509"},{"key":"e_1_3_3_78_2","first-page":"1","volume-title":"PLDI","author":"Szab\u00f3 Tam\u00e1s","year":"2021","unstructured":"Tam\u00e1s Szab\u00f3, Sebastian Erdweg, and G\u00e1bor Bergmann. 2021. Incremental whole-program analysis in datalog with lattices. In PLDI. ACM, 1\u201315. DOI: 10.1145\/3453483.3454026"},{"key":"e_1_3_3_79_2","first-page":"320","volume-title":"ASE","author":"Szab\u00f3 Tam\u00e1s","year":"2016","unstructured":"Tam\u00e1s Szab\u00f3, Sebastian Erdweg, and Markus Voelter. 2016. IncA: A DSL for the definition of incremental program analyses. In ASE. ACM, 320\u2013331. DOI: 10.1145\/2970276.2970298"},{"key":"e_1_3_3_80_2","doi-asserted-by":"crossref","first-page":"285","DOI":"10.2140\/pjm.1955.5.285","article-title":"A lattice-theoretical fixpoint theorem and its applications","volume":"5","author":"Tarski Alfred","year":"1955","unstructured":"Alfred Tarski. 1955. A lattice-theoretical fixpoint theorem and its applications. Pacific Journal of Mathematics 5 (1955), 285\u2013309.","journal-title":"Pacific Journal of Mathematics"},{"key":"e_1_3_3_81_2","first-page":"25","volume-title":"SCAM","author":"Van der Plas Jens","year":"2020","unstructured":"Jens Van der Plas, Quentin Sti\u00e9venart, Noah Van Es, and Coen De Roover. 2020. Incremental flow analysis through computational dependency reification. In SCAM. IEEE, 25\u201336. DOI: 10.1109\/SCAM51674.2020.00008"},{"key":"e_1_3_3_82_2","first-page":"389","volume-title":"ASPLOS","author":"Wang Kai","year":"2017","unstructured":"Kai Wang, Aftab Hussain, Zhiqiang Zuo, Guoqing Xu, and Ardalan Amiri Sani. 2017. Graspan: A single-machine disk-based graph system for interprocedural static analyses of large-scale systems code. In ASPLOS. ACM, 389\u2013404. DOI: 10.1145\/3037697.3037744"},{"key":"e_1_3_3_83_2","first-page":"49","volume-title":"SCAM","author":"Wauters Cindy","year":"2023","unstructured":"Cindy Wauters, Jens Van der Plas, Quentin Sti\u00e9venart, and Coen De Roover. 2023. Change pattern detection for optimising incremental static analysis. In SCAM. IEEE, 49\u201360. DOI: 10.1109\/SCAM59687.2023.00016"},{"key":"e_1_3_3_84_2","first-page":"131","volume-title":"PLDI","author":"Whaley John","year":"2004","unstructured":"John Whaley and Monica S. Lam. 2004. Cloning-based context-sensitive pointer alias analysis using binary decision diagrams. In PLDI. ACM, 131\u2013144. DOI: 10.1145\/996841.996859"},{"key":"e_1_3_3_85_2","first-page":"1","volume-title":"PLDI","author":"Wilson Robert P.","year":"1995","unstructured":"Robert P. Wilson and Monica S. Lam. 1995. Efficient context-sensitive pointer analysis for C programs. In PLDI. ACM, 1\u201312. DOI: 10.1145\/207110.207111"},{"key":"e_1_3_3_86_2","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1145\/178243.178430","volume-title":"PLDI","author":"Wism\u00fcller Roland","year":"1994","unstructured":"Roland Wism\u00fcller. 1994. Debugging of globally optimized programs using data flow analysis. In PLDI. ACM, 278\u2013289. DOI: 10.1145\/178243.178430"},{"key":"e_1_3_3_87_2","first-page":"802","volume-title":"PLDI","author":"Wu Meng","year":"2019","unstructured":"Meng Wu and Chao Wang. 2019. Abstract interpretation under speculative execution. In PLDI. ACM, 802\u2013815. DOI: 10.1145\/3314221.3314647"},{"key":"e_1_3_3_88_2","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1145\/1328438.1328467","volume-title":"POPL","author":"Yorsh Greta","year":"2008","unstructured":"Greta Yorsh, Eran Yahav, and Satish Chandra. 2008. Generating precise and concise procedure summaries. In POPL. ACM, 221\u2013234. DOI: 10.1145\/1328438.1328467"},{"key":"e_1_3_3_89_2","first-page":"442","volume-title":"ICSE","author":"Yur Jyh-Shiarn","year":"1999","unstructured":"Jyh-Shiarn Yur, Barbara G. Ryder, and William A. Landi. 1999. An incremental flow-and context-sensitive pointer aliasing analysis. In ICSE. IEEE, 442\u2013451. DOI: 10.1145\/302405.302676"},{"key":"e_1_3_3_90_2","first-page":"183","volume-title":"PPoPP","author":"Zhang Kaiyuan","year":"2015","unstructured":"Kaiyuan Zhang, Rong Chen, and Haibo Chen. 2015. NUMA-aware graph-structured analytics. In PPoPP. ACM, 183\u2013193. DOI: 10.1145\/2688500.2688507"},{"key":"e_1_3_3_91_2","first-page":"16","volume-title":"PPDP","author":"Zhao David","year":"2021","unstructured":"David Zhao, Pavle Subotic, Mukund Raghothaman, and Bernhard Scholz. 2021. Towards elastic incrementalization for datalog. In PPDP. ACM, Article 20 (2021), 16 pages. DOI: 10.1145\/3479394.3479415"},{"key":"e_1_3_3_92_2","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1145\/1328438.1328464","volume-title":"POPL","author":"Zheng Xin","year":"2008","unstructured":"Xin Zheng and Radu Rugina. 2008. Demand-driven alias analysis for C. In POPL. ACM, 197\u2013208. DOI: 10.1145\/1328438.1328464"},{"key":"e_1_3_3_93_2","first-page":"771","volume-title":"IPDPS","author":"Zuo Zhiqiang","year":"2019","unstructured":"Zhiqiang Zuo, Rong Gu, Xi Jiang, Zhaokang Wang, Yihua Huang, Linzhang Wang, and Xuandong Li. 2019. BigSpa: An efficient interprocedural static analysis engine in the cloud. In IPDPS. IEEE, 771\u2013780. DOI: 10.1109\/IPDPS.2019.00086"},{"key":"e_1_3_3_94_2","doi-asserted-by":"publisher","DOI":"10.1145\/3466820"},{"key":"e_1_3_3_95_2","first-page":"914","volume-title":"PLDI","author":"Zuo Zhiqiang","year":"2021","unstructured":"Zhiqiang Zuo, Yiyu Zhang, Qiuhong Pan, Shenming Lu, Yue Li, Linzhang Wang, Xuandong Li, and Guoqing Harry Xu. 2021. Chianina: An evolving graph system for flow-and context-sensitive analyses of million lines of C code. In PLDI. ACM, 914\u2013929. DOI: 10.1145\/3453483.3454085"}],"container-title":["ACM Transactions on Programming Languages and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3786763","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T17:03:36Z","timestamp":1773767016000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3786763"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,17]]},"references-count":94,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,3,31]]}},"alternative-id":["10.1145\/3786763"],"URL":"https:\/\/doi.org\/10.1145\/3786763","relation":{},"ISSN":["0164-0925","1558-4593"],"issn-type":[{"value":"0164-0925","type":"print"},{"value":"1558-4593","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,17]]},"assertion":[{"value":"2024-12-17","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-12-11","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-03-17","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}