{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T03:06:20Z","timestamp":1767927980916,"version":"3.49.0"},"publisher-location":"Cham","reference-count":82,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031249495","type":"print"},{"value":"9783031249501","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-24950-1_9","type":"book-chapter","created":{"date-parts":[[2023,1,16]],"date-time":"2023-01-16T14:03:19Z","timestamp":1673877799000},"page":"177-202","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Efficient Interprocedural Data-Flow Analysis Using Treedepth and\u00a0Treewidth"],"prefix":"10.1007","author":[{"given":"Amir Kafshdar","family":"Goharshady","sequence":"first","affiliation":[]},{"given":"Ahmed Khaled","family":"Zaher","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,1,17]]},"reference":[{"key":"9_CR1","unstructured":"T.J. Watson libraries for analysis, with frontends for Java, Android, and JavaScript, and many common static program analyses. https:\/\/github.com\/wala\/WALA"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Ahmadi, A., Daliri, M., Goharshady, A.K., Pavlogiannis, A.: Efficient approximations for cache-conscious data placement. In: PLDI, pp. 857\u2013871 (2022)","DOI":"10.1145\/3519939.3523436"},{"issue":"1","key":"9_CR3","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1145\/3527540.3527542","volume":"9","author":"C Aiswarya","year":"2022","unstructured":"Aiswarya, C.: How treewidth helps in verification. ACM SIGLOG News 9(1), 6\u201321 (2022)","journal-title":"ACM SIGLOG News"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Arzt, S., et al.: FlowDroid: precise context, flow, field, object-sensitive and lifecycle-aware taint analysis for Android apps. In: PLDI, pp. 259\u2013269 (2014)","DOI":"10.1145\/2666356.2594299"},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/978-3-030-59152-6_14","volume-title":"Automated Technology for Verification and Analysis","author":"A Asadi","year":"2020","unstructured":"Asadi, A., Chatterjee, K., Goharshady, A.K., Mohammadi, K., Pavlogiannis, A.: Faster algorithms for quantitative analysis of MCs and MDPs with small treewidth. In: Hung, D.V., Sokolsky, O. (eds.) ATVA 2020. LNCS, vol. 12302, pp. 253\u2013270. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-59152-6_14"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Babich, W.A., Jazayeri, M.: The method of attributes for data flow analysis: Part II. Demand analysis. Acta Informatica 10, 265\u2013272 (1978)","DOI":"10.1007\/BF00264320"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Bebenita, M., et al.: SPUR: a trace-based JIT compiler for CIL. In: OOPSLA, pp. 708\u2013725 (2010)","DOI":"10.1145\/1932682.1869517"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Blackburn, S.M., et al.: The DaCapo benchmarks: Java benchmarking development and analysis. In: OOPSLA, pp. 169\u2013190 (2006)","DOI":"10.1145\/1167515.1167488"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Bodden, E.: Inter-procedural data-flow analysis with IFDS\/IDE and soot. In: SOAP, pp. 3\u20138 (2012)","DOI":"10.1145\/2259051.2259052"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Bodden, E., Tol\u00eado, T., Ribeiro, M., Brabrand, C., Borba, P., Mezini, M.: SPLLIFT: statically analyzing software product lines in minutes instead of years. In: PLDI, pp. 355\u2013364 (2013)","DOI":"10.1145\/2499370.2491976"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Bodlaender, H.L.: Dynamic programming on graphs with bounded treewidth. In: ICALP, pp. 105\u2013118 (1988)","DOI":"10.1007\/3-540-19488-6_110"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Bodlaender, H.L.: A linear time algorithm for finding tree-decompositions of small treewidth. In: STOC, pp. 226\u2013234 (1993)","DOI":"10.1145\/167088.167161"},{"issue":"1\u20132","key":"9_CR13","first-page":"1","volume":"11","author":"HL Bodlaender","year":"1993","unstructured":"Bodlaender, H.L.: A tourist guide through treewidth. Acta Cybern. 11(1\u20132), 1\u201321 (1993)","journal-title":"Acta Cybern."},{"issue":"1","key":"9_CR14","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1137\/S0895480195282550","volume":"11","author":"HL Bodlaender","year":"1998","unstructured":"Bodlaender, H.L., et al.: Rankings of graphs. SIAM J. Discret. Math. 11(1), 168\u2013181 (1998)","journal-title":"SIAM J. Discret. Math."},{"issue":"6","key":"9_CR15","doi-asserted-by":"publisher","first-page":"1725","DOI":"10.1137\/S0097539795289859","volume":"27","author":"HL Bodlaender","year":"1998","unstructured":"Bodlaender, H.L., Hagerup, T.: Parallel algorithms with optimal speedup for bounded treewidth. SIAM J. Comput. 27(6), 1725\u20131746 (1998)","journal-title":"SIAM J. Comput."},{"key":"9_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/978-3-540-24841-5_6","volume-title":"Reliable Software Technologies - Ada-Europe 2004","author":"B Burgstaller","year":"2004","unstructured":"Burgstaller, B., Blieberger, J., Scholz, B.: On the tree width of Ada programs. In: Llamos\u00ed, A., Strohmeier, A. (eds.) Ada-Europe 2004. LNCS, vol. 3063, pp. 78\u201390. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24841-5_6"},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Callahan, D., Cooper, K.D., Kennedy, K., Torczon, L.: Interprocedural constant propagation. In: CC, pp. 152\u2013161 (1986)","DOI":"10.1145\/13310.13327"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Chang, W., Streiff, B., Lin, C.: Efficient and extensible security enforcement using dynamic data flow analysis. In: CCS, pp. 39\u201350 (2008)","DOI":"10.1145\/1455770.1455778"},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Goharshady, A.K., Goharshady, E.K.: The treewidth of smart contracts. In: SAC, pp. 400\u2013408 (2019)","DOI":"10.1145\/3297280.3297322"},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Goharshady, A.K., Goyal, P., Ibsen-Jensen, R., Pavlogiannis, A.: Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth. TOPLAS 41(4), 23:1\u201323:46 (2019)","DOI":"10.1145\/3363525"},{"key":"9_CR21","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Goharshady, A.K., Ibsen-Jensen, R., Pavlogiannis, A.: Algorithms for algebraic path properties in concurrent systems of constant treewidth components. In: POPL, pp. 733\u2013747 (2016)","DOI":"10.1145\/2914770.2837624"},{"key":"9_CR22","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Goharshady, A.K., Ibsen-Jensen, R., Pavlogiannis, A.: Optimal and perfectly parallel algorithms for on-demand data-flow analysis. In: ESOP, pp. 112\u2013140 (2020)","DOI":"10.1007\/978-3-030-44914-8_5"},{"key":"9_CR23","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Goharshady, A.K., Okati, N., Pavlogiannis, A.: Efficient parameterized algorithms for data packing. In: POPL, pp. 53:1\u201353:28 (2019)","DOI":"10.1145\/3290366"},{"key":"9_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/978-3-319-68167-2_4","volume-title":"Automated Technology for Verification and Analysis","author":"K Chatterjee","year":"2017","unstructured":"Chatterjee, K., Goharshady, A.K., Pavlogiannis, A.: JTDec: a tool for tree decompositions in soot. In: D\u2019Souza, D., Narayan Kumar, K. (eds.) ATVA 2017. LNCS, vol. 10482, pp. 59\u201366. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-68167-2_4"},{"key":"9_CR25","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Ibsen-Jensen, R., Goharshady, A.K., Pavlogiannis, A.: Algorithms for algebraic path properties in concurrent systems of constant treewidth components. TOPLAS 40(3), 9:1\u20139:43 (2018)","DOI":"10.1145\/3210257"},{"key":"9_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/978-3-319-21690-4_9","volume-title":"Computer Aided Verification","author":"K Chatterjee","year":"2015","unstructured":"Chatterjee, K., Ibsen-Jensen, R., Pavlogiannis, A.: Faster algorithms for quantitative verification in constant treewidth graphs. In: Kroening, D., P\u0103s\u0103reanu, C.S. (eds.) CAV 2015. LNCS, vol. 9206, pp. 140\u2013157. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21690-4_9"},{"key":"9_CR27","unstructured":"Chatterjee, K., Ibsen-Jensen, R., Pavlogiannis, A.: Quantitative verification on product graphs of small treewidth. In: FSTTCS, pp. 42:1\u201342:23 (2021)"},{"key":"9_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/978-3-540-24723-4_5","volume-title":"Compiler Construction","author":"T Chen","year":"2004","unstructured":"Chen, T., Lin, J., Dai, X., Hsu, W.-C., Yew, P.-C.: Data dependence profiling for speculative optimizations. In: Duesterwald, E. (ed.) CC 2004. LNCS, vol. 2985, pp. 57\u201372. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24723-4_5"},{"key":"9_CR29","doi-asserted-by":"crossref","unstructured":"Chow, A.L., Rudmik, A.: The design of a data flow analyzer. In: CC, pp. 106\u2013113 (1982)","DOI":"10.1145\/872726.806985"},{"key":"9_CR30","unstructured":"Collard, J.F., Knoop, J.: A comparative study of reaching-definitions analyses (1998)"},{"key":"9_CR31","unstructured":"Dangel, A., Fournier, C., et al.: PMD Eclipse plugin. https:\/\/github.com\/pmd\/pmd-eclipse-plugin"},{"key":"9_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/978-3-319-68167-2_2","volume-title":"Automated Technology for Verification and Analysis","author":"A Das","year":"2017","unstructured":"Das, A., Lal, A.: Precise null pointer analysis through global value numbering. In: D\u2019Souza, D., Narayan Kumar, K. (eds.) ATVA 2017. LNCS, vol. 10482, pp. 25\u201341. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-68167-2_2"},{"key":"9_CR33","unstructured":"Dell, H., Komusiewicz, C., Talmon, N., Weller, M.: The PACE 2017 parameterized algorithms and computational experiments challenge: the second iteration. In: IPEC, pp. 30:1\u201330:12 (2018)"},{"key":"9_CR34","doi-asserted-by":"crossref","unstructured":"Duesterwald, E., Gupta, R., Soffa, M.L.: Demand-driven computation of interprocedural data flow. In: POPL, pp. 37\u201348 (1995)","DOI":"10.1145\/199448.199461"},{"key":"9_CR35","unstructured":"Eclipse Foundation: Eclipse documentation, Java development user guide. http:\/\/help.eclipse.org\/2022-06\/index.jsp?topic=\/org.eclipse.jdt.doc.user\/reference\/preferences\/java\/compiler\/ref-preferences-errors-warnings.htm"},{"key":"9_CR36","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/11591191_34","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"A Ferrara","year":"2005","unstructured":"Ferrara, A., Pan, G., Vardi, M.Y.: Treewidth in verification: local vs. global. In: Sutcliffe, G., Voronkov, A. (eds.) LPAR 2005. LNCS (LNAI), vol. 3835, pp. 489\u2013503. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11591191_34"},{"key":"9_CR37","doi-asserted-by":"crossref","unstructured":"Fl\u00fcckiger, O., Scherer, G., Yee, M., Goel, A., Ahmed, A., Vitek, J.: Correctness of speculative optimizations with dynamic deoptimization. In: POPL, pp. 49:1\u201349:28 (2018)","DOI":"10.1145\/3158137"},{"key":"9_CR38","unstructured":"Goharshady, A.K.: Parameterized and algebro-geometric advances in static program analysis. Ph.D. thesis, Institute of Science and Technology Austria, Klosterneuburg, Austria (2020)"},{"key":"9_CR39","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1016\/j.dam.2015.06.014","volume":"198","author":"AK Goharshady","year":"2016","unstructured":"Goharshady, A.K., Hooshmandasl, M.R., Meybodi, M.A.: [1, 2]-sets and [1, 2]-total sets in trees with algorithms. Discret. Appl. Math. 198, 136\u2013146 (2016)","journal-title":"Discret. Appl. Math."},{"key":"9_CR40","doi-asserted-by":"publisher","DOI":"10.1016\/j.ress.2019.106665","volume":"193","author":"AK Goharshady","year":"2020","unstructured":"Goharshady, A.K., Mohammadi, F.: An efficient algorithm for computing network reliability in small treewidth. Reliab. Eng. Syst. Saf. 193, 106665 (2020)","journal-title":"Reliab. Eng. Syst. Saf."},{"key":"9_CR41","unstructured":"Gould, C., Su, Z., Devanbu, P.T.: JDBC checker: a static analysis tool for SQL\/JDBC applications. In: ICSE, pp. 697\u2013698 (2004)"},{"key":"9_CR42","doi-asserted-by":"crossref","unstructured":"Grove, D., Torczon, L.: Interprocedural constant propagation: a study of jump function implementations. In: PLDI, pp. 90\u201399 (1993)","DOI":"10.1145\/173262.155099"},{"key":"9_CR43","doi-asserted-by":"crossref","unstructured":"Gupta, R., Benson, D., Fang, J.Z.: Path profile guided partial dead code elimination using predication. In: PACT, pp. 102\u2013113 (1997)","DOI":"10.1109\/PACT.1997.644007"},{"key":"9_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/3-540-45643-0_7","volume-title":"Algorithm Engineering and Experiments","author":"J Gustedt","year":"2002","unstructured":"Gustedt, J., M\u00e6hle, O.A., Telle, J.A.: The treewidth of Java programs. In: Mount, D.M., Stein, C. (eds.) ALENEX 2002. LNCS, vol. 2409, pp. 86\u201397. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45643-0_7"},{"key":"9_CR45","doi-asserted-by":"crossref","unstructured":"Horwitz, S., Reps, T.W., Sagiv, S.: Demand interprocedural dataflow analysis. In: FSE, pp. 104\u2013115 (1995)","DOI":"10.1145\/222132.222146"},{"key":"9_CR46","doi-asserted-by":"publisher","DOI":"10.1201\/9780849332517","volume-title":"Data Flow Analysis: Theory and Practice","author":"U Khedker","year":"2017","unstructured":"Khedker, U., Sanyal, A., Sathe, B.: Data Flow Analysis: Theory and Practice. CRC Press, Boca Raton (2017)"},{"key":"9_CR47","doi-asserted-by":"crossref","unstructured":"Kildall, G.A.: A unified approach to global program optimization. In: POPL, pp. 194\u2013206 (1973)","DOI":"10.1145\/512927.512945"},{"key":"9_CR48","unstructured":"Kildall, G.A.: Global Expression Optimization During Compilation. University of Washington (1972)"},{"key":"9_CR49","unstructured":"Knoop, J., Steffen, B.: Efficient and optimal bit-vector data flow analyses: a uniform interprocedural framework. Institut f\u00fcr Informatik und Praktische Mathematik Kiel, Bericht (1993)"},{"issue":"3","key":"9_CR50","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1145\/229542.229545","volume":"18","author":"J Knoop","year":"1996","unstructured":"Knoop, J., Steffen, B., Vollmer, J.: Parallelism for free: efficient and optimal bitvector analyses for parallel programs. TOPLAS 18(3), 268\u2013299 (1996)","journal-title":"TOPLAS"},{"key":"9_CR51","unstructured":"Kowalik, \u0141., Mucha, M., Nadara, W., Pilipczuk, M., Sorge, M., Wygocki, P.: The PACE 2020 parameterized algorithms and computational experiments challenge: treedepth. In: IPEC, pp. 37:1\u201337:18 (2020)"},{"key":"9_CR52","doi-asserted-by":"crossref","unstructured":"Kurdahi, F.J., Parker, A.C.: REAL: a program for register allocation. In: DAC, pp. 210\u2013215 (1987)","DOI":"10.1145\/37888.37920"},{"key":"9_CR53","doi-asserted-by":"crossref","unstructured":"Lin, J., et al.: A compiler framework for speculative optimizations. TACO (3), 247\u2013271 (2004)","DOI":"10.1145\/1022969.1022970"},{"key":"9_CR54","doi-asserted-by":"crossref","unstructured":"Meybodi, M.A., Goharshady, A.K., Hooshmandasl, M.R., Shakiba, A.: Optimal mining: maximizing Bitcoin miners\u2019 revenues from transaction fees. In: Blockchain, pp. 266\u2013273. IEEE (2022)","DOI":"10.1109\/Blockchain55522.2022.00044"},{"issue":"5","key":"9_CR55","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1145\/3057284","volume":"60","author":"B Meyer","year":"2017","unstructured":"Meyer, B.: Ending null pointer crashes. Commun. ACM 60(5), 8\u20139 (2017)","journal-title":"Commun. ACM"},{"key":"9_CR56","unstructured":"Nadara, W., Pilipczuk, M., Smulewicz, M.: Computing treedepth in polynomial space and linear FPT time. CoRR abs\/2205.02656 (2022)"},{"key":"9_CR57","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-642-11970-5_8","volume-title":"Compiler Construction","author":"NA Naeem","year":"2010","unstructured":"Naeem, N.A., Lhot\u00e1k, O., Rodriguez, J.: Practical extensions to the IFDS algorithm. In: Gupta, R. (ed.) CC 2010. LNCS, vol. 6011, pp. 124\u2013144. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-11970-5_8"},{"key":"9_CR58","doi-asserted-by":"crossref","unstructured":"Nanda, M.G., Sinha, S.: Accurate interprocedural null-dereference analysis for Java. In: ICSE, pp. 133\u2013143. IEEE (2009)","DOI":"10.1109\/ICSE.2009.5070515"},{"key":"9_CR59","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-27875-4","volume-title":"Sparsity: Graphs, Structures, and Algorithms","author":"J Ne\u0161et\u0159il","year":"2012","unstructured":"Ne\u0161et\u0159il, J., De Mendez, P.O.: Sparsity: Graphs, Structures, and Algorithms. Springer, Cham (2012)"},{"issue":"6","key":"9_CR60","doi-asserted-by":"publisher","first-page":"1022","DOI":"10.1016\/j.ejc.2005.01.010","volume":"27","author":"J Nesetril","year":"2006","unstructured":"Nesetril, J., de Mendez, P.O.: Tree-depth, subgraph coloring and homomorphism bounds. Eur. J. Comb. 27(6), 1022\u20131041 (2006)","journal-title":"Eur. J. Comb."},{"key":"9_CR61","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/3-540-36579-6_16","volume-title":"Compiler Construction","author":"TVN Nguyen","year":"2003","unstructured":"Nguyen, T.V.N., Irigoin, F., Ancourt, C., Coelho, F.: Automatic detection of uninitialized variables. In: Hedin, G. (ed.) CC 2003. LNCS, vol. 2622, pp. 217\u2013231. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36579-6_16"},{"key":"9_CR62","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/978-3-540-45069-6_7","volume-title":"Computer Aided Verification","author":"J Obdr\u017e\u00e1lek","year":"2003","unstructured":"Obdr\u017e\u00e1lek, J.: Fast mu-calculus model checking when tree-width is bounded. In: Hunt, W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol. 2725, pp. 80\u201392. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45069-6_7"},{"key":"9_CR63","unstructured":"Pessoa, T., Monteiro, M.P., Bryton, S., et al.: An eclipse plugin to support code smells detection. arXiv preprint arXiv:1204.6492 (2012)"},{"key":"9_CR64","unstructured":"Pothen, A.: The complexity of optimal elimination trees. Technical report (1988)"},{"key":"9_CR65","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/978-3-662-48288-9_4","volume-title":"Static Analysis","author":"M Rapoport","year":"2015","unstructured":"Rapoport, M., Lhot\u00e1k, O., Tip, F.: Precise data flow analysis in the presence of correlated method calls. In: Blazy, S., Jensen, T. (eds.) SAS 2015. LNCS, vol. 9291, pp. 54\u201371. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48288-9_4"},{"issue":"1","key":"9_CR66","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1145\/345099.345137","volume":"22","author":"T Reps","year":"2000","unstructured":"Reps, T.: Undecidability of context-sensitive data-dependence analysis. TOPLAS 22(1), 162\u2013186 (2000)","journal-title":"TOPLAS"},{"key":"9_CR67","series-title":"The Springer International Series in Engineering and Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-1-4615-2207-2_8","volume-title":"Applications of Logic Databases","author":"TW Reps","year":"1993","unstructured":"Reps, T.W.: Demand interprocedural program analysis using logic databases. In: Ramakrishnan, R. (ed.) Applications of Logic Databases. SECS, pp. 163\u2013196. Springer, Boston (1993). https:\/\/doi.org\/10.1007\/978-1-4615-2207-2_8"},{"issue":"11\u201312","key":"9_CR68","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1016\/S0950-5849(98)00093-7","volume":"40","author":"TW Reps","year":"1998","unstructured":"Reps, T.W.: Program analysis via graph reachability. Inf. Softw. Technol. 40(11\u201312), 701\u2013726 (1998)","journal-title":"Inf. Softw. Technol."},{"key":"9_CR69","doi-asserted-by":"crossref","unstructured":"Reps, T.W., Horwitz, S., Sagiv, S.: Precise interprocedural dataflow analysis via graph reachability. In: POPL, pp. 49\u201361 (1995)","DOI":"10.1145\/199448.199462"},{"key":"9_CR70","doi-asserted-by":"crossref","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. III. Planar tree-width. J. Comb. Theory Ser. B 36(1), 49\u201364 (1984)","DOI":"10.1016\/0095-8956(84)90013-3"},{"key":"9_CR71","doi-asserted-by":"crossref","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. II. Algorithmic aspects of tree-width. J. Algorithms 7(3), 309\u2013322 (1986)","DOI":"10.1016\/0196-6774(86)90023-4"},{"key":"9_CR72","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/11688839_2","volume-title":"Compiler Construction","author":"A Rountev","year":"2006","unstructured":"Rountev, A., Kagan, S., Marlowe, T.: Interprocedural dataflow analysis in the presence of large libraries. In: Mycroft, A., Zeller, A. (eds.) CC 2006. LNCS, vol. 3923, pp. 2\u201316. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11688839_2"},{"key":"9_CR73","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0304-3975(96)00072-2","volume":"167","author":"S Sagiv","year":"1996","unstructured":"Sagiv, S., Reps, T.W., Horwitz, S.: Precise interprocedural dataflow analysis with applications to constant propagation. Theor. Comput. Sci. 167, 131\u2013170 (1996)","journal-title":"Theor. Comput. Sci."},{"key":"9_CR74","doi-asserted-by":"crossref","unstructured":"Shang, L., Xie, X., Xue, J.: On-demand dynamic summary-based points-to analysis. In: CGO, pp. 264\u2013274 (2012)","DOI":"10.1145\/2259016.2259050"},{"key":"9_CR75","doi-asserted-by":"crossref","unstructured":"Sp\u00e4th, J., Ali, K., Bodden, E.: Context-, flow-, and field-sensitive data-flow analysis using synchronized pushdown systems. In: POPL, pp. 48:1\u201348:29 (2019)","DOI":"10.1145\/3290361"},{"key":"9_CR76","doi-asserted-by":"crossref","unstructured":"Sridharan, M., Bod\u00edk, R.: Refinement-based context-sensitive points-to analysis for Java. In: PLDI, pp. 387\u2013400 (2006)","DOI":"10.1145\/1133255.1134027"},{"key":"9_CR77","doi-asserted-by":"crossref","unstructured":"Sridharan, M., Gopan, D., Shan, L., Bod\u00edk, R.: Demand-driven points-to analysis for Java. In: OOPSLA, pp. 59\u201376 (2005)","DOI":"10.1145\/1103845.1094817"},{"issue":"2","key":"9_CR78","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1006\/inco.1997.2697","volume":"142","author":"M Thorup","year":"1998","unstructured":"Thorup, M.: All structured programs have small tree-width and good register allocation. Inf. Comput. 142(2), 159\u2013181 (1998)","journal-title":"Inf. Comput."},{"key":"9_CR79","unstructured":"Vall\u00e9e-Rai, R., Co, P., Gagnon, E., Hendren, L.J., Lam, P., Sundaresan, V.: Soot - a Java bytecode optimization framework. In: CASCON, p. 13. IBM (1999)"},{"key":"9_CR80","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/978-3-642-03013-0_6","volume-title":"ECOOP 2009 \u2013 Object-Oriented Programming","author":"G Xu","year":"2009","unstructured":"Xu, G., Rountev, A., Sridharan, M.: Scaling CFL-reachability-based points-to analysis using context-sensitive must-not-alias analysis. In: Drossopoulou, S. (ed.) ECOOP 2009. LNCS, vol. 5653, pp. 98\u2013122. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03013-0_6"},{"key":"9_CR81","doi-asserted-by":"crossref","unstructured":"Yan, D., Xu, G., Rountev, A.: Demand-driven context-sensitive alias analysis for Java. In: ISSTA, pp. 155\u2013165 (2011)","DOI":"10.1145\/2001420.2001440"},{"key":"9_CR82","doi-asserted-by":"crossref","unstructured":"Zheng, X., Rugina, R.: Demand-driven alias analysis for C. In: POPL, pp. 197\u2013208 (2008)","DOI":"10.1145\/1328897.1328464"}],"container-title":["Lecture Notes in Computer Science","Verification, Model Checking, and Abstract Interpretation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-24950-1_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,12]],"date-time":"2024-10-12T09:09:15Z","timestamp":1728724155000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-24950-1_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031249495","9783031249501"],"references-count":82,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-24950-1_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"17 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"VMCAI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Verification, Model Checking, and Abstract Interpretation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Boston, MA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 January 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 January 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"vmcai2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/vmcai-2023.github.io\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"34","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"17","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"50% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}