{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T00:28:49Z","timestamp":1769732929533,"version":"3.49.0"},"reference-count":142,"publisher":"Association for Computing Machinery (ACM)","issue":"OOPSLA1","license":[{"start":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T00:00:00Z","timestamp":1744156800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001843","name":"Science and Engineering Research Board","doi-asserted-by":"publisher","award":["CRG\/2022\/006971"],"award-info":[{"award-number":["CRG\/2022\/006971"]}],"id":[{"id":"10.13039\/501100001843","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100015178","name":"IBM Canada","doi-asserted-by":"publisher","award":["1156"],"award-info":[{"award-number":["1156"]}],"id":[{"id":"10.13039\/100015178","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. ACM Program. Lang."],"published-print":{"date-parts":[[2025,4,9]]},"abstract":"<jats:p>Iterative dataflow analyses (IDFAs) are important static analyses employed by tools like compilers for enabling program optimizations, comprehension, verification, and more. During compilation of a program, optimizations\/transformations can render existing dataflow solutions stale, jeopardizing the optimality and correctness of subsequent compiler passes. Exhaustively recomputing these solutions can be costly. Since most program changes impact only small portions of the flowgraph, several incrementalization approaches have been proposed for various subclasses of IDFAs. However, these approaches face one or more of these limitations: (i) loss of precision compared to exhaustive analysis, (ii) inability to handle arbitrary lattices and dataflow functions, and (iii) lacking fully automated incrementalization of the IDFA. As a result, mainstream compilers lack frameworks for generating precise incremental versions of arbitrary IDFAs, leaving analysis writers to create ad hoc algorithms for incrementalization \u2013 an often cumbersome and error-prone task. \n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \nTo tackle these challenges, we introduce IncIDFA, a novel algorithm that delivers precise and efficient incremental variants of any monotone IDFA. IncIDFA utilizes a two-pass approach to maintain precision. Unlike prior works, IncIDFA avoids resetting the dataflow solutions to least informative values when dealing with strongly-connected regions and arbitrary program changes. We formally prove the precision guarantees of IncIDFA for arbitrary dataflow problems and program changes. IncIDFA has been implemented in the IMOP compiler framework for parallel OpenMP C programs. To showcase its generality, we have instantiated IncIDFA to ten specific dataflow analyses, without requiring any additional code for incrementalization. We present an evaluation of IncIDFA on a real-world set of optimization passes, across two different architectures. As compared to exhaustive recomputation, IncIDFA resulted in a speedup of up to 11\u00d7(geomean 2.6\u00d7) in incremental-update time, and improvement of up to 46% (geomean 15.1%) in the total compilation time.<\/jats:p>","DOI":"10.1145\/3720436","type":"journal-article","created":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T13:48:26Z","timestamp":1744206506000},"page":"617-648","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["IncIDFA: An Efficient and Generic Algorithm for Incremental Iterative Dataflow Analysis"],"prefix":"10.1145","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2563-2480","authenticated-orcid":false,"given":"Aman","family":"Nougrahiya","sequence":"first","affiliation":[{"name":"IIT Madras, Chennai, India"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5949-0046","authenticated-orcid":false,"given":"V. Krishna","family":"Nandivada","sequence":"additional","affiliation":[{"name":"IIT Madras, Chennai, India"}]}],"member":"320","published-online":{"date-parts":[[2025,4,9]]},"reference":[{"key":"e_1_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3632928"},{"key":"e_1_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/PACT58117.2023.00011"},{"key":"e_1_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/800116.803767"},{"key":"e_1_2_2_4_1","volume-title":"Incremental Attribute Evaluation","author":"Alblas Henk","unstructured":"Henk Alblas. 1991. Incremental Attribute Evaluation. In Attribute Grammars, Applications and Systems, Henk Alblas and Bo\u0159ivoj Melichar (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg. 215\u2013233. isbn:978-3-540-38490-8"},{"key":"e_1_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/360018.360025"},{"key":"e_1_2_2_6_1","volume-title":"Michael Peyton Jones, and C.-H. Luke Ong","author":"Alvarez-Picallo Mario","year":"2019","unstructured":"Mario Alvarez-Picallo, Alex Eyers-Taylor, Michael Peyton Jones, and C.-H. Luke Ong. 2019. Fixing Incremental Computation. In Programming Languages and Systems, Lu\u00eds Caires (Ed.). Springer International Publishing, Cham. 525\u2013552. isbn:978-3-030-17184-1"},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2568225.2568243"},{"key":"e_1_2_2_8_1","volume-title":"SPEComp: A New Benchmark Suite for Measuring Parallel Computer Performance. In Workshop on OpenMP Applications and Tools, Rudolf Eigenmann and Michael J. Voss (Eds.). Springer Berlin Heidelberg","author":"Aslot Vishal","year":"2001","unstructured":"Vishal Aslot, Max Domeika, Rudolf Eigenmann, Greg Gaertner, Wesley B. Jones, and Bodo Parady. 2001. SPEComp: A New Benchmark Suite for Measuring Parallel Computer Performance. In Workshop on OpenMP Applications and Tools, Rudolf Eigenmann and Michael J. Voss (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg. 1\u201310. isbn:978-3-540-44587-6"},{"key":"e_1_2_2_9_1","volume-title":"Graph Grammars and Their Application to Computer Science","author":"Uwe A\u00df","unstructured":"Uwe A\u00df mann. 1996. On Edge Addition Rewrite Systems and Their Relevance to Program Analysis. In Graph Grammars and Their Application to Computer Science, Janice Cuny, Hartmut Ehrig, Gregor Engels, and Grzegorz Rozenberg (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg. 321\u2013335. isbn:978-3-540-68388-9"},{"key":"e_1_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00264319"},{"key":"e_1_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00264320"},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2543728.2543735"},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2678015.2682541"},{"key":"e_1_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/78969.78963"},{"key":"e_1_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/32.56098"},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3196398.3196433"},{"key":"e_1_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/74587.74612"},{"key":"e_1_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/24208.24228"},{"key":"e_1_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/73560.73584"},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:IJPP.0000035816.93295.68"},{"key":"e_1_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.43410"},{"key":"e_1_2_2_22_1","volume-title":"Incremental Points-to Analysis for Java via Edit Propagation","author":"Chen Yuting","unstructured":"Yuting Chen, Qiuwei Shi, and Weikai Miao. 2015. Incremental Points-to Analysis for Java via Edit Propagation. In Structured Object-Oriented Formal Language and Method, Shaoying Liu and Zhenhua Duan (Eds.). Springer International Publishing, Cham. 164\u2013178. isbn:978-3-319-17404-4"},{"key":"e_1_2_2_23_1","volume-title":"Edwards","author":"Conway Christopher L.","year":"2005","unstructured":"Christopher L. Conway, Kedar S. Namjoshi, Dennis Dams, and Stephen A. Edwards. 2005. Incremental Algorithms for Inter-procedural Analysis of Safety Properties. In Computer Aided Verification, Kousha Etessami and Sriram K. Rajamani (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg. 449\u2013461. isbn:978-3-540-31686-2"},{"key":"e_1_2_2_24_1","volume-title":"Revisited","author":"Cooper Keith D.","unstructured":"Keith D. Cooper, Timothy J. Harvey, and Ken Kennedy. 2002. Iterative Data-flow Analysis, Revisited. Rice University."},{"key":"e_1_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/502874.502898"},{"key":"e_1_2_2_26_1","volume-title":"Modular Static Program Analysis","author":"Cousot Patrick","unstructured":"Patrick Cousot and Radhia Cousot. 2002. Modular Static Program Analysis. In Compiler Construction, R. Nigel Horspool (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg. 159\u2013179."},{"key":"e_1_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/567532.567544"},{"key":"e_1_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3092703.3092705"},{"key":"e_1_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/199448.199461"},{"key":"e_1_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-69611-7_7"},{"key":"e_1_2_2_31_1","doi-asserted-by":"publisher","unstructured":"Julian Erhard Simmo Saan Sarah Tilscher Michael Schwarz Karoliine Holter Vesal Vojdani and Helmut Seidl. 2024. Interactive Abstract Interpretation: Reanalyzing Multithreaded C Programs for Cheap. International Journal on Software Tools for Technology Transfer isbn:1433-2787 https:\/\/doi.org\/10.1007\/s10009-024-00768-9 10.1007\/s10009-024-00768-9","DOI":"10.1007\/s10009-024-00768-9"},{"key":"e_1_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/174634.174635"},{"key":"e_1_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-45260-5_3"},{"key":"e_1_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068420000496"},{"key":"e_1_2_2_35_1","unstructured":"GCC-Developer-Community. 2024. GCC GitHub Repository. https:\/\/github.com\/gcc-mirror\/gcc"},{"key":"e_1_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1297105.1297033"},{"key":"e_1_2_2_37_1","volume-title":"Incremental Analysis of Programs. Ph. D. Dissertation","author":"Ghoddsi Vida","unstructured":"Vida Ghoddsi. 1983. Incremental Analysis of Programs. Ph. D. Dissertation. University of Central Florida."},{"key":"e_1_2_2_38_1","unstructured":"Google. 2001. Chrome V8. https:\/\/github.com\/v8\/v8"},{"key":"e_1_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/321921.321939"},{"key":"e_1_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/256428.167063"},{"key":"e_1_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSM.1994.336794"},{"key":"e_1_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/32.538603"},{"key":"e_1_2_2_43_1","volume-title":"Flow Analysis of Computer Programs","author":"Hecht Matthew S.","unstructured":"Matthew S. Hecht. 1977. Flow Analysis of Computer Programs. Elsevier Science Inc., USA. isbn:0444002162"},{"key":"e_1_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/512927.512946"},{"key":"e_1_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/321832.321835"},{"key":"e_1_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/349214.349216"},{"key":"e_1_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00282621"},{"key":"e_1_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/222132.222146"},{"key":"e_1_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/117009.117012"},{"key":"e_1_2_2_50_1","unstructured":"IBM. 2017. Eclipse OpenJ9. https:\/\/github.com\/eclipse\/openj9"},{"key":"e_1_2_2_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/53990.54006"},{"key":"e_1_2_2_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/3456563"},{"key":"e_1_2_2_53_1","volume-title":"Souffl\u00e9: On Synthesis of Program Analyzers","author":"Jordan Herbert","year":"2016","unstructured":"Herbert Jordan, Bernhard Scholz, and Pavle Suboti\u0107. 2016. Souffl\u00e9: On Synthesis of Program Analyzers. In Computer Aided Verification, Swarat Chaudhuri and Azadeh Farzan (Eds.). Springer International Publishing, Cham. 422\u2013430. isbn:978-3-319-41540-6"},{"key":"e_1_2_2_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/151299.151312"},{"key":"e_1_2_2_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/321921.321938"},{"key":"e_1_2_2_56_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00290339"},{"key":"e_1_2_2_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/10590.10601"},{"key":"e_1_2_2_58_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSM.1988.10185"},{"key":"e_1_2_2_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/512976.512978"},{"key":"e_1_2_2_60_1","unstructured":"Uday P. Khedker. 1995. A Generalised Theory of Bit Vector Data Flow Analysis. Ph. D. Dissertation."},{"key":"e_1_2_2_61_1","doi-asserted-by":"publisher","DOI":"10.1145\/186025.186043"},{"key":"e_1_2_2_62_1","doi-asserted-by":"publisher","DOI":"10.1145\/606666.606676"},{"key":"e_1_2_2_63_1","doi-asserted-by":"publisher","DOI":"10.1145\/512927.512945"},{"key":"e_1_2_2_64_1","doi-asserted-by":"publisher","DOI":"10.1145\/3689713"},{"key":"e_1_2_2_65_1","doi-asserted-by":"publisher","DOI":"10.1145\/3098572.3098578"},{"key":"e_1_2_2_66_1","doi-asserted-by":"publisher","DOI":"10.1145\/3362064"},{"key":"e_1_2_2_67_1","doi-asserted-by":"publisher","DOI":"10.1109\/CGO.2004.1281665"},{"key":"e_1_2_2_68_1","doi-asserted-by":"publisher","DOI":"10.1145\/3296979.3192390"},{"key":"e_1_2_2_69_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293606"},{"key":"e_1_2_2_70_1","unstructured":"LLVM-Developer-Community. 2017. LLVM GitHub Repository. https:\/\/github.com\/llvm\/llvm-project\/commit\/b323f4f173710c60bcc76628d8155e476023c5b5"},{"key":"e_1_2_2_71_1","unstructured":"LLVM-Developer-Community. 2024. LLVM GitHub Repository. https:\/\/github.com\/llvm\/llvm-project"},{"key":"e_1_2_2_72_1","volume-title":"Compiler Construction","author":"Lu Yi","unstructured":"Yi Lu, Lei Shang, Xinwei Xie, and Jingling Xue. 2013. An Incremental Points-to Analysis with CFL-Reachability. In Compiler Construction, Ranjit Jhala and Koen De Bosschere (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg. 61\u201381. isbn:978-3-642-37051-9"},{"key":"e_1_2_2_73_1","doi-asserted-by":"publisher","DOI":"10.1145\/3428193"},{"key":"e_1_2_2_74_1","doi-asserted-by":"publisher","DOI":"10.1145\/2908080.2908096"},{"key":"e_1_2_2_75_1","doi-asserted-by":"publisher","DOI":"10.1109\/HICSS.1991.184005"},{"key":"e_1_2_2_76_1","doi-asserted-by":"publisher","DOI":"10.1145\/96709.96728"},{"key":"e_1_2_2_77_1","doi-asserted-by":"publisher","DOI":"10.1109\/32.221136"},{"key":"e_1_2_2_78_1","doi-asserted-by":"publisher","DOI":"10.1145\/3633331"},{"key":"e_1_2_2_79_1","volume-title":"Advanced Compiler Design and Implementation","author":"Muchnick Steven S.","unstructured":"Steven S. Muchnick. 1998. Advanced Compiler Design and Implementation. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA. isbn:1558603204"},{"key":"e_1_2_2_80_1","volume-title":"Practical Extensions to the IFDS Algorithm","author":"Naeem Nomair A.","year":"1970","unstructured":"Nomair A. Naeem, Ond\u0159ej Lhot\u00e1k, and Jonathan Rodriguez. 2010. Practical Extensions to the IFDS Algorithm. In Compiler Construction, Rajiv Gupta (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg. 124\u2013144. isbn:978-3-642-11970-5"},{"key":"e_1_2_2_81_1","doi-asserted-by":"publisher","DOI":"10.1145\/3315568.3329964"},{"key":"e_1_2_2_82_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2009.09.046"},{"key":"e_1_2_2_83_1","volume-title":"IMOP : IIT Madras OpenMP compiler framework. https:\/\/github.com\/amannougrahiya\/imop-compiler","author":"Nougrahiya Aman","year":"2019","unstructured":"Aman Nougrahiya and V. Krishna Nandivada. 2019. IMOP : IIT Madras OpenMP compiler framework. https:\/\/github.com\/amannougrahiya\/imop-compiler"},{"key":"e_1_2_2_84_1","doi-asserted-by":"publisher","DOI":"10.1145\/3649308"},{"key":"e_1_2_2_85_1","doi-asserted-by":"publisher","unstructured":"Aman Nougrahiya and V Krishna Nandivada. 2025. Artifact for IncIDFA: an Efficient and Generic Algorithm for Incremental Iterative Dataflow Analysis. https:\/\/doi.org\/10.5281\/zenodo.14598500 10.5281\/zenodo.14598500","DOI":"10.5281\/zenodo.14598500"},{"key":"e_1_2_2_86_1","doi-asserted-by":"publisher","unstructured":"Aman Nougrahiya and V. Krishna Nandivada. 2025. IncIDFA: An Efficient and Generic Algorithm for Incremental Iterative Dataflow Analysis (Supplementary Material). https:\/\/doi.org\/10.1145\/3720436 10.1145\/3720436","DOI":"10.1145\/3720436"},{"key":"e_1_2_2_87_1","unstructured":"Oracle. 1999. HotSpot. https:\/\/github.com\/openjdk-mirror\/jdk7u-hotspot"},{"key":"e_1_2_2_88_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487568.2487569"},{"key":"e_1_2_2_89_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2023.102944"},{"key":"e_1_2_2_90_1","doi-asserted-by":"publisher","DOI":"10.1109\/32.58766"},{"key":"e_1_2_2_91_1","volume-title":"Optimized Algorithms for Incremental Analysis of Logic Programs","author":"Puebla Germ\u00e1n","unstructured":"Germ\u00e1n Puebla and Manuel Hermenegildo. 1996. Optimized Algorithms for Incremental Analysis of Logic Programs. In Static Analysis, Radhia Cousot and David A. Schmidt (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg. 270\u2013284. isbn:978-3-540-70674-8"},{"key":"e_1_2_2_92_1","unstructured":"Daniel Quinlan Chunhua Liao Thomas Panas Robb Matzke Markus Schordan Rich Vuduc and Qing Yi. 2013. ROSE User Manual: A Tool for Building Source-to-Source Translators. Lawrence Livermore National Laboratory."},{"key":"e_1_2_2_93_1","doi-asserted-by":"publisher","DOI":"10.1145\/174675.177905"},{"key":"e_1_2_2_94_1","doi-asserted-by":"publisher","DOI":"10.1145\/582153.582172"},{"key":"e_1_2_2_95_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00263583"},{"key":"e_1_2_2_96_1","volume-title":"Solving Demand Versions of Interprocedural Analysis Problems","author":"Reps Thomas","unstructured":"Thomas Reps. 1994. Solving Demand Versions of Interprocedural Analysis Problems. In Compiler Construction, Peter A. Fritzson (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg. 389\u2013403. isbn:978-3-540-48371-7"},{"key":"e_1_2_2_97_1","doi-asserted-by":"publisher","DOI":"10.1145\/199448.199462"},{"key":"e_1_2_2_98_1","doi-asserted-by":"publisher","DOI":"10.1145\/2166.357218"},{"key":"e_1_2_2_99_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6423(88)90061-5"},{"key":"e_1_2_2_100_1","doi-asserted-by":"publisher","DOI":"10.1145\/567067.567084"},{"key":"e_1_2_2_101_1","doi-asserted-by":"publisher","DOI":"10.1145\/27632.27649"},{"key":"e_1_2_2_102_1","doi-asserted-by":"publisher","DOI":"10.1145\/42192.42193"},{"key":"e_1_2_2_103_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(96)00072-2"},{"key":"e_1_2_2_104_1","doi-asserted-by":"publisher","DOI":"10.1145\/1069774.1069785"},{"key":"e_1_2_2_105_1","doi-asserted-by":"crossref","unstructured":"Diptikalyan Saha and C. R. Ramakrishnan. 2005. Symbolic Support Graph: A Space Efficient Data Structure for Incremental Tabled Evaluation. In Logic Programming Maurizio Gabbrielli and Gopal Gupta (Eds.). Springer Berlin Heidelberg Berlin Heidelberg. 235\u2013249. isbn:978-3-540-31947-4","DOI":"10.1007\/11562931_19"},{"key":"e_1_2_2_106_1","doi-asserted-by":"crossref","unstructured":"Diptikalyan Saha and C. R. Ramakrishnan. 2006. A Local Algorithm for Incremental Evaluation of Tabled Logic Programs. In Logic Programming Sandro Etalle and Miros\u0142 aw Truszczy\u0144ski (Eds.). Springer Berlin Heidelberg Berlin Heidelberg. 56\u201371. isbn:978-3-540-36636-2","DOI":"10.1007\/11799573_7"},{"key":"e_1_2_2_107_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46423-9_19"},{"key":"e_1_2_2_108_1","doi-asserted-by":"publisher","DOI":"10.1145\/2892208.2892226"},{"key":"e_1_2_2_109_1","doi-asserted-by":"publisher","unstructured":"Seager M. 2008. The ASC Sequoia Programming Model. 8 https:\/\/doi.org\/10.2172\/945684 10.2172\/945684","DOI":"10.2172\/945684"},{"key":"e_1_2_2_110_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-41103-9_5"},{"key":"e_1_2_2_111_1","doi-asserted-by":"publisher","unstructured":"Lei Shang Yi Lu and Jingling Xue. 2012. Fast and Precise Points-to Analysis with Incremental CFL-Reachability Summarisation: Preliminary Experience. In 2012 Proceedings of the 27th IEEE\/ACM International Conference on Automated Software Engineering. 270\u2013273. https:\/\/doi.org\/10.1145\/2351676.2351720 10.1145\/2351676.2351720","DOI":"10.1145\/2351676.2351720"},{"key":"e_1_2_2_112_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS47924.2020.00093"},{"key":"e_1_2_2_113_1","doi-asserted-by":"publisher","DOI":"10.1145\/3136014.3136029"},{"key":"e_1_2_2_114_1","unstructured":"Soot-Developer-Community. 2024. Soot GitHub Repository. https:\/\/github.com\/soot-oss\/soot"},{"key":"e_1_2_2_115_1","doi-asserted-by":"publisher","DOI":"10.1145\/231379.231434"},{"key":"e_1_2_2_116_1","doi-asserted-by":"publisher","DOI":"10.1145\/244795.244799"},{"issue":"3","key":"e_1_2_2_117_1","first-page":"3","article-title":"Using The GNU Compiler Collection","volume":"4","author":"Stallman Richard M.","year":"2009","unstructured":"Richard M. Stallman and GCC-Developer-Community. 2009. Using The GNU Compiler Collection: A GNU Manual For GCC Version 4.3.3. CreateSpace, Paramount, CA.","journal-title":"A GNU Manual For GCC Version"},{"key":"e_1_2_2_118_1","doi-asserted-by":"publisher","DOI":"10.1145\/3453483.3454044"},{"key":"e_1_2_2_119_1","doi-asserted-by":"publisher","DOI":"10.1145\/3611643.3616348"},{"key":"e_1_2_2_120_1","doi-asserted-by":"publisher","DOI":"10.1145\/3611643.3613860"},{"key":"e_1_2_2_121_1","doi-asserted-by":"publisher","DOI":"10.1145\/3276509"},{"key":"e_1_2_2_122_1","doi-asserted-by":"publisher","DOI":"10.1145\/3453483.3454026"},{"key":"e_1_2_2_123_1","doi-asserted-by":"publisher","DOI":"10.1145\/2970276.2970298"},{"key":"e_1_2_2_124_1","doi-asserted-by":"publisher","DOI":"10.1145\/800125.804040"},{"key":"e_1_2_2_125_1","doi-asserted-by":"publisher","DOI":"10.1109\/SWAT.1972.1"},{"key":"e_1_2_2_126_1","doi-asserted-by":"publisher","DOI":"10.1145\/1925805.1925818"},{"key":"e_1_2_2_127_1","doi-asserted-by":"crossref","unstructured":"Jens Van der Plas Quentin Sti\u00e9venart and Coen De Roover. 2023. Result Invalidation for Incremental Modular Analyses. In Verification Model Checking and Abstract Interpretation Cezara Dragoi Michael Emmi and Jingbo Wang (Eds.). Springer Nature Switzerland Cham. 296\u2013319.","DOI":"10.1007\/978-3-031-24950-1_14"},{"key":"e_1_2_2_128_1","doi-asserted-by":"publisher","DOI":"10.1109\/SCAM51674.2020.00008"},{"key":"e_1_2_2_129_1","unstructured":"Rob F Van der Wijngaart and Parkson Wong. 2002. NAS parallel benchmarks version 3.0. NAS technical report NAS-02-007."},{"key":"e_1_2_2_130_1","volume-title":"Compiler Enhanced Scheduling for OpenMP for Heterogeneous Multiprocessors. In Workshop on Energy Efficiency with Heterogeneous Computing (EEHCO \u201916)","author":"Viswakaran Jyothi Krishna","year":"2016","unstructured":"Jyothi Krishna Viswakaran Sreelatha and Shankar Balachandran. 2016. Compiler Enhanced Scheduling for OpenMP for Heterogeneous Multiprocessors. In Workshop on Energy Efficiency with Heterogeneous Computing (EEHCO \u201916). ACM, Prague, Czech Republic."},{"key":"e_1_2_2_131_1","doi-asserted-by":"publisher","DOI":"10.1109\/TMSCS.2018.2791955"},{"key":"e_1_2_2_132_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2018.2858366"},{"key":"e_1_2_2_133_1","doi-asserted-by":"publisher","DOI":"10.1145\/381694.378804"},{"key":"e_1_2_2_134_1","doi-asserted-by":"publisher","DOI":"10.1145\/53990.54011"},{"key":"e_1_2_2_135_1","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.2402.10754"},{"key":"e_1_2_2_136_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01934460"},{"key":"e_1_2_2_137_1","doi-asserted-by":"publisher","unstructured":"D. Yeh and U. Kastens. 1988. Improvements of an Incremental Evaluation Algorithm for Ordered Attribute Grammars. SIGPLAN Not. 23 12 (1988) Dec 45\u201350. issn:0362-1340 https:\/\/doi.org\/10.1145\/57669.57672 10.1145\/57669.57672","DOI":"10.1145\/57669.57672"},{"key":"e_1_2_2_138_1","doi-asserted-by":"publisher","DOI":"10.1145\/302405.302676"},{"key":"e_1_2_2_139_1","doi-asserted-by":"publisher","DOI":"10.1145\/253228.253369"},{"key":"e_1_2_2_140_1","doi-asserted-by":"publisher","DOI":"10.1145\/502874.502888"},{"key":"e_1_2_2_141_1","doi-asserted-by":"publisher","DOI":"10.1145\/2950290.2950332"},{"key":"e_1_2_2_142_1","doi-asserted-by":"publisher","DOI":"10.1145\/3479394.3479415"}],"container-title":["Proceedings of the ACM on Programming Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3720436","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3720436","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T17:12:37Z","timestamp":1760029957000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3720436"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,9]]},"references-count":142,"journal-issue":{"issue":"OOPSLA1","published-print":{"date-parts":[[2025,4,9]]}},"alternative-id":["10.1145\/3720436"],"URL":"https:\/\/doi.org\/10.1145\/3720436","relation":{},"ISSN":["2475-1421"],"issn-type":[{"value":"2475-1421","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,4,9]]},"assertion":[{"value":"2024-10-16","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-02-18","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-04-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}