{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T17:45:50Z","timestamp":1778694350001,"version":"3.51.4"},"reference-count":77,"publisher":"Association for Computing Machinery (ACM)","issue":"OOPSLA2","license":[{"start":{"date-parts":[[2024,10,8]],"date-time":"2024-10-08T00:00:00Z","timestamp":1728345600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key R\\\\&D Program of China","doi-asserted-by":"crossref","award":["2022YFB3103900"],"award-info":[{"award-number":["2022YFB3103900"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62402474, 62132020 and 62202452"],"award-info":[{"award-number":["62402474, 62132020 and 62202452"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002858","name":"China Postdoctoral Science Foundation","doi-asserted-by":"publisher","award":["2024M753295"],"award-info":[{"award-number":["2024M753295"]}],"id":[{"id":"10.13039\/501100002858","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":[[2024,10,8]]},"abstract":"<jats:p>The IFDS algorithm is pivotal in solving field-sensitive data-flow problems. However, its conventional use of access paths for field sensitivity leads to the generation of a large number of data-flow facts. This causes scalability challenges in larger programs, limiting its practical application in extensive codebases. In response, we propose a new field-sensitive technique that reinterprets the generation of access paths as a Context-Free Language (CFL) for field-sensitivity and formulates it as an IDE problem. This approach significantly reduces the number of data-flow facts generated and handled during the analysis, which is a major factor in performance degradation.<\/jats:p>\n                  <jats:p>\n                    To demonstrate the effectiveness of this approach, we developed a taint analysis tool, IDEDroid, in the IFDS\/IDE framework. IDEDroid outperforms FlowDroid, an established IFDS-based taint analysis tool, in the analysis of 24 major Android apps while improving its precision (guaranteed theoretically). The speed improvement ranges from\n                    <jats:inline-formula>\n                      <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" display=\"inline\" overflow=\"scroll\">\n                        <mml:mn>2.1<\/mml:mn>\n                        <mml:mo>\u00d7<\/mml:mo>\n                      <\/mml:math>\n                    <\/jats:inline-formula>\n                    to\n                    <jats:inline-formula>\n                      <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" display=\"inline\" overflow=\"scroll\">\n                        <mml:mn>2,368.4<\/mml:mn>\n                        <mml:mo>\u00d7<\/mml:mo>\n                      <\/mml:math>\n                    <\/jats:inline-formula>\n                    , averaging at\n                    <jats:inline-formula>\n                      <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" display=\"inline\" overflow=\"scroll\">\n                        <mml:mn>222.0<\/mml:mn>\n                        <mml:mo>\u00d7<\/mml:mo>\n                      <\/mml:math>\n                    <\/jats:inline-formula>\n                    , with precision gains reaching up to\n                    <jats:inline-formula>\n                      <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" display=\"inline\" overflow=\"scroll\">\n                        <mml:mn>20.0<\/mml:mn>\n                        <mml:mo>%<\/mml:mo>\n                      <\/mml:math>\n                    <\/jats:inline-formula>\n                    (in terms of false positives reduced). This performance indicates that IDEDroid is substantially more effective in detecting information-flow leaks, making it a potentially superior tool for mobile app vetting in the market.\n                  <\/jats:p>","DOI":"10.1145\/3689804","type":"journal-article","created":{"date-parts":[[2024,10,8]],"date-time":"2024-10-08T03:23:04Z","timestamp":1728357784000},"page":"2633-2661","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Boosting the Performance of Alias-Aware IFDS Analysis with CFL-Based Environment Transformers"],"prefix":"10.1145","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-0931-8767","authenticated-orcid":false,"given":"Haofeng","family":"Li","sequence":"first","affiliation":[{"name":"SKLP, Institute of Computing Technology, CAS, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-3055-8929","authenticated-orcid":false,"given":"Chenghang","family":"Shi","sequence":"additional","affiliation":[{"name":"SKLP, Institute of Computing Technology, CAS, Beijing, China"},{"name":"University of Chinese Academy of Sciences, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4162-0404","authenticated-orcid":false,"given":"Jie","family":"Lu","sequence":"additional","affiliation":[{"name":"SKLP, Institute of Computing Technology, CAS, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4476-0541","authenticated-orcid":false,"given":"Lian","family":"Li","sequence":"additional","affiliation":[{"name":"SKLP, Institute of Computing Technology, CAS, Beijing, China"},{"name":"University of Chinese Academy of Sciences, Beijing, China"},{"name":"Zhongguancun Laboratory, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0380-3506","authenticated-orcid":false,"given":"Jingling","family":"Xue","sequence":"additional","affiliation":[{"name":"University of New South Wales, Sydney, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,10,8]]},"reference":[{"key":"e_1_3_1_2_1","unstructured":"Lars Ole Andersen. 1994. Program analysis and specialization for the C programming language. Ph. D. Dissertation. University of Copenhagen."},{"key":"e_1_3_1_3_1","first-page":"23","volume-title":"21st Annual Network and Distributed System Security Symposium, NDSS 2014, San Diego, California, USA, February 23-26, 2014","author":"Arp Daniel","year":"2014","unstructured":"Daniel Arp, Michael Spreitzenbarth, Malte Hubner, Hugo Gascon, Konrad Rieck, and CERT Siemens. 2014. DREBIN: Effective and Explainable Detection of Android Malware in Your Pocket. In 21st Annual Network and Distributed System Security Symposium, NDSS 2014, San Diego, California, USA, February 23-26, 2014. The Internet Society, San Diego, California, 23\u201326. https:\/\/www.ndss-symposium.org\/ndss2014\/drebin-effective-and-explainable-detection-android-malware-your-pocket"},{"key":"e_1_3_1_4_1","volume-title":"Static Data Flow Analysis for Android Applications","author":"Arzt Steven","year":"2017","unstructured":"Steven Arzt. 2017. Static Data Flow Analysis for Android Applications. Ph. D. Dissertation. Darmstadt University of Technology, Germany. http:\/\/tuprints.ulb.tu-darmstadt.de\/5937\/"},{"key":"e_1_3_1_5_1","first-page":"1098","volume-title":"Proceedings of the 43rd International Conference on Software Engineering (Madrid, Spain) (ICSE \u201921)","author":"Arzt Steven","year":"2021","unstructured":"Steven Arzt. 2021. Sustainable Solving: Reducing The Memory Footprint of IFDS-Based Data Flow Analyses Using Intelligent Garbage Collection. In Proceedings of the 43rd International Conference on Software Engineering (Madrid, Spain) (ICSE \u201921). IEEE Press, Madrid, Spain, 1098\u20131110. https:\/\/doi.org\/10.1109\/ICSE43902.2021.00102 10.1109\/ICSE43902.2021.00102"},{"key":"e_1_3_1_6_1","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1145\/2594291.2594299","volume-title":"Proceedings of the 35th ACM SIGPLAN Conference on Programming Language Design and Implementation (Edinburgh, United Kingdom) (PLDI \u201914)","author":"Arzt Steven","year":"2014","unstructured":"Steven Arzt, Siegfried Rasthofer, Christian Fritz, Eric Bodden, Alexandre Bartel, Jacques Klein, Yves Le Traon, Damien Octeau, and Patrick McDaniel. 2014. FlowDroid: Precise Context, Flow, Field, Object-Sensitive and Lifecycle-Aware Taint Analysis for Android Apps. In Proceedings of the 35th ACM SIGPLAN Conference on Programming Language Design and Implementation (Edinburgh, United Kingdom) (PLDI \u201914). Association for Computing Machinery, New York, NY, USA, 259\u2013269. https:\/\/doi.org\/10.1145\/2594291.2594299 10.1145\/2594291.2594299"},{"key":"e_1_3_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/2818754.2818808"},{"key":"e_1_3_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2259051.2259052"},{"key":"e_1_3_1_9_1","first-page":"344","volume-title":"Static Analysis, 11th International Symposium, SAS 2004, Verona, Italy, August 26-28, 2004, Proceedings (Lecture Notes in Computer Science, Vol. 3148)","author":"Bozga Marius","year":"2004","unstructured":"Marius Bozga, Radu Iosif, and Yassine Lakhnech. 2004. On Logics of Aliasing. In Static Analysis, 11th International Symposium, SAS 2004, Verona, Italy, August 26-28, 2004, Proceedings (Lecture Notes in Computer Science, Vol. 3148), Roberto Giacobazzi (Ed.). Springer, Verona, Italy, 344\u2013360. https:\/\/doi.org\/10.1007\/978-3-540-27864-1_25 10.1007\/978-3-540-27864-1_25"},{"key":"e_1_3_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3196398.3196433"},{"key":"e_1_3_1_11_1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3158118","article-title":"Optimal Dyck reachability for data-dependence and alias analysis","volume":"2","author":"Chatterjee Krishnendu","year":"2017","unstructured":"Krishnendu Chatterjee, Bhavya Choudhary, and Andreas Pavlogiannis. 2017. Optimal Dyck reachability for data-dependence and alias analysis. Proceedings of the ACM on Programming Languages 2, POPL (2017), 1\u201330. https:\/\/doi.org\/10.1145\/3158118 10.1145\/3158118","journal-title":"Proceedings of the ACM on Programming Languages"},{"key":"e_1_3_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3622868"},{"key":"e_1_3_1_13_1","first-page":"665","volume-title":"Proceedings of the 26th European Conference on Object-Oriented Programming (Beijing, China) (ECOOP\u201912)","author":"De Arnab","year":"2012","unstructured":"Arnab De and Deepak D\u2019Souza. 2012. Scalable Flow-Sensitive Pointer Analysis for Java with Strong Updates. In Proceedings of the 26th European Conference on Object-Oriented Programming (Beijing, China) (ECOOP\u201912). Springer-Verlag, Berlin, Heidelberg, 665\u2013687. https:\/\/doi.org\/10.1007\/978-3-642-31057-7_29 10.1007\/978-3-642-31057-7_29"},{"key":"e_1_3_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/773473.178263"},{"key":"e_1_3_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2022.3197638"},{"key":"e_1_3_1_16_1","unstructured":"FossDroid 2023. Fossdroid: Free and open source Android apps. Retrieved 2023 from https:\/\/fossdroid.com\/"},{"key":"e_1_3_1_17_1","first-page":"110","volume-title":"22nd Annual Network and Distributed System Security Symposium, NDSS 2015, San Diego, California, USA, February 8-11, 2015","author":"Gordon Michael I.","year":"2015","unstructured":"Michael I. Gordon, Deokhwan Kim, Jeff H. Perkins, Limei Gilham, Nguyen Nguyen, and Martin C. Rinard. 2015. Information Flow Analysis of Android Applications in DroidSafe. In 22nd Annual Network and Distributed System Security Symposium, NDSS 2015, San Diego, California, USA, February 8-11, 2015, Vol. 15. The Internet Society, San Diego, California, 110. https:\/\/www.ndss-symposium.org\/ndss2015\/information-flow-analysis-android-applications-droidsafe"},{"key":"e_1_3_1_18_1","first-page":"240","volume-title":"Static Analysis, 13th International Symposium, SAS 2006, Seoul, Korea, August 29-31, 2006, Proceedings (Lecture Notes in Computer Science, Vol. 4134)","author":"Gotsman Alexey","year":"2006","unstructured":"Alexey Gotsman, Josh Berdine, and Byron Cook. 2006. Interprocedural Shape Analysis with Separated Heap Abstractions. In Static Analysis, 13th International Symposium, SAS 2006, Seoul, Korea, August 29-31, 2006, Proceedings (Lecture Notes in Computer Science, Vol. 4134), Kwangkeun Yi (Ed.). Springer, Seoul, Korea, 240\u2013260. https:\/\/doi.org\/10.1007\/11823230_16 10.1007\/11823230_16"},{"key":"e_1_3_1_19_1","doi-asserted-by":"crossref","unstructured":"Yujiang Gui Dongjie He and Jingling Xue. 2023. Merge-Replay: Efficient IFDS-Based Taint Analysis by Consolidating Equivalent Value Flows. In 38th IEEE\/ACM International Conference on Automated Software Engineering (ASE). https:\/\/doi.org\/10.1109\/ASE56229.2023.00027 10.1109\/ASE56229.2023.00027","DOI":"10.1109\/ASE56229.2023.00027"},{"key":"e_1_3_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/512529.512539"},{"key":"e_1_3_1_21_1","first-page":"101","volume-title":"Proceedings of the 32nd ACM SIGSOFT International Symposium on Software Testing and Analysis (Seattle, WA, USA) (ISSTA 2023)","author":"He Dongjie","year":"2023","unstructured":"Dongjie He, Yujiang Gui, Yaoqing Gao, and Jingling Xue. 2023. Reducing the Memory Footprint of IFDS-Based Data-Flow Analyses Using Fine-Grained Garbage Collection. In Proceedings of the 32nd ACM SIGSOFT International Symposium on Software Testing and Analysis (Seattle, WA, USA) (ISSTA 2023). Association for Computing Machinery, New York, NY, USA, 101\u2013113. https:\/\/doi.org\/10.1145\/3597926.3598041 10.1145\/3597926.3598041"},{"key":"e_1_3_1_22_1","first-page":"267","volume-title":"Proceedings of the 34th IEEE\/ACM International Conference on Automated Software Engineering (San Diego, California) (ASE \u201919)","author":"He Dongjie","year":"2019","unstructured":"Dongjie He, Haofeng Li, Lei Wang, Haining Meng, Hengjie Zheng, Jie Liu, Shuangwei Hu, Lian Li, and Jingling Xue. 2019. Performance-Boosting Sparsification of the IFDS Algorithm with Applications to Taint Analysis. In Proceedings of the 34th IEEE\/ACM International Conference on Automated Software Engineering (San Diego, California) (ASE \u201919). IEEE Press, San Diego, California, 267\u2013279. https:\/\/doi.org\/10.1109\/ASE.2019.00034 10.1109\/ASE.2019.00034"},{"key":"e_1_3_1_23_1","unstructured":"IBM 2006. WALA: T.J. Watson Libraries for Analysis. Retrieved 2023 from http:\/\/wala.sourceforge.net"},{"key":"e_1_3_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2931098"},{"issue":"1","key":"e_1_3_1_25_1","article-title":"Heap reference analysis using access graphs","volume":"30","author":"Khedker Uday P","year":"2007","unstructured":"Uday P Khedker, Amitabha Sanyal, and Amey Karkare. 2007. Heap reference analysis using access graphs. ACM Transactions on Programming Languages and Systems (TOPLAS) 30, 1 (2007), 1-es. https:\/\/doi.org\/10.1145\/1290520.1290521 10.1145\/1290520.1290521","journal-title":"ACM Transactions on Programming Languages and Systems (TOPLAS)"},{"key":"e_1_3_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2614628.2614633"},{"key":"e_1_3_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/996893.996867"},{"key":"e_1_3_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2006.125"},{"key":"e_1_3_1_29_1","unstructured":"Patrick Lam Eric Bodden Ondrej Lhot\u00e1k and Laurie Hendren. 2011. The Soot framework for Java program analysis: a retrospective. In Cetus Users and Compiler Infrastructure Workshop (CETUS 2011). http:\/\/www.bodden.de\/pubs\/lblh11soot.pdf"},{"key":"e_1_3_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30579-8_28"},{"key":"e_1_3_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/143103.143137"},{"key":"e_1_3_1_32_1","first-page":"75","volume-title":"Proceedings of the International Symposium on Code Generation and Optimization: Feedback-Directed and Runtime Optimization (Palo Alto, California) (CGO \u201904)","author":"Lattner Chris","year":"2004","unstructured":"Chris Lattner and Vikram Adve. 2004. LLVM: A Compilation Framework for Lifelong Program Analysis & Transformation. In Proceedings of the International Symposium on Code Generation and Optimization: Feedback-Directed and Runtime Optimization (Palo Alto, California) (CGO \u201904). IEEE Computer Society, USA, 75. https:\/\/doi.org\/10.1109\/CGO.2004.1281665 10.1109\/CGO.2004.1281665"},{"key":"e_1_3_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3563343"},{"key":"e_1_3_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/3591233"},{"key":"e_1_3_1_35_1","first-page":"619","volume-title":"Proceedings of the 30th IEEE\/ACM International Conference on Automated Software Engineering (Lincoln, Nebraska) (ASE \u201915)","author":"Lerch Johannes","year":"2015","unstructured":"Johannes Lerch, Johannes Sp\u00e4th, Eric Bodden, and Mira Mezini. 2015. Access-Path Abstraction: Scaling Field-Sensitive Data-Flow Analysis with Unbounded Access Paths. In Proceedings of the 30th IEEE\/ACM International Conference on Automated Software Engineering (Lincoln, Nebraska) (ASE \u201915). IEEE Press, Lincoln, Nebraska, 619\u2013629. https:\/\/doi.org\/10.1109\/ASE.2015.9 10.1109\/ASE.2015.9"},{"key":"e_1_3_1_36_1","unstructured":"Haofeng Li. 2024. Boosting the Performance of Alias-Aware IFDS Analysis with CFL-based Environment Transformers (Artifact). (7 2024). https:\/\/doi.org\/10.6084\/m9.figshare.26105056.v1 10.6084\/m9.figshare.26105056.v1"},{"key":"e_1_3_1_37_1","doi-asserted-by":"crossref","unstructured":"Haofeng Li Jie Lu Haining Meng Liqing Cao Lian Li and Lin Gao. 2024. Boosting the Performance of Multi-Solver IFDS Algorithms with Flow-Sensitivity Optimizations. In 2024 IEEE\/ACM International Symposium on Code Generation and Optimization (CGO). 296\u2013307. https:\/\/doi.org\/10.1109\/CGO57630.2024.10444884 10.1109\/CGO57630.2024.10444884","DOI":"10.1109\/CGO57630.2024.10444884"},{"key":"e_1_3_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/CGO51591.2021.9370311"},{"key":"e_1_3_1_39_1","first-page":"280","volume-title":"Proceedings of the 37th International Conference on Software Engineering - Volume 1 (Florence, Italy) (ICSE \u201915)","author":"Li Li","year":"2015","unstructured":"Li Li, Alexandre Bartel, Tegawend\u00e9 F. Bissyand\u00e9, Jacques Klein, Yves Le Traon, Steven Arzt, Siegfried Rasthofer, Eric Bodden, Damien Octeau, and Patrick McDaniel. 2015. IccTA: Detecting Inter-Component Privacy Leaks in Android Apps. In Proceedings of the 37th International Conference on Software Engineering - Volume 1 (Florence, Italy) (ICSE \u201915). IEEE Press, Florence, Italy, 280\u2013291. https:\/\/doi.org\/10.1109\/ICSE.2015.48 10.1109\/ICSE.2015.48"},{"key":"e_1_3_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/3498724"},{"key":"e_1_3_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3492428"},{"key":"e_1_3_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/3360574"},{"key":"e_1_3_1_43_1","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1145\/1029894.1029907","volume-title":"Proceedings of the 12th ACM SIGSOFT Twelfth International Symposium on Foundations of Software Engineering (Newport Beach, CA, USA) (SIGSOFT \u201904\/FSE-12)","author":"Manevich Roman","year":"2004","unstructured":"Roman Manevich, Manu Sridharan, Stephen Adams, Manuvir Das, and Zhe Yang. 2004. PSE: Explaining Program Failures via Postmortem Static Analysis. In Proceedings of the 12th ACM SIGSOFT Twelfth International Symposium on Foundations of Software Engineering (Newport Beach, CA, USA) (SIGSOFT \u201904\/FSE-12). Association for Computing Machinery, New York, NY, USA, 63\u201372. https:\/\/doi.org\/10.1145\/1029894.1029907 10.1145\/1029894.1029907"},{"key":"e_1_3_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/2259016.2259049"},{"key":"e_1_3_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/381694.378851"},{"key":"e_1_3_1_46_1","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1007\/978-3-642-11970-5_8","volume-title":"Compiler Construction","author":"Naeem Nomair A.","year":"2010","unstructured":"Nomair A. Naeem, Ondrej 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. https:\/\/doi.org\/10.1007\/978-3-642-11970-5_8 10.1007\/978-3-642-11970-5_8"},{"key":"e_1_3_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/3236024.3236029"},{"key":"e_1_3_1_48_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0950-5849(98)00093-7"},{"key":"e_1_3_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/345099.345137"},{"key":"e_1_3_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/199448.199462"},{"key":"e_1_3_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/195274.195287"},{"key":"e_1_3_1_52_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(96)00072-2"},{"key":"e_1_3_1_53_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-17465-1_22"},{"key":"e_1_3_1_54_1","first-page":"264","volume-title":"10th Annual IEEE\/ACM International Symposium on Code Generation and Optimization, CGO 2012, San Jose, CA, USA, March 31 - April 04, 2012","author":"Shang Lei","year":"2012","unstructured":"Lei Shang, Xinwei Xie, and Jingling Xue. 2012. On-demand dynamic summary-based points-to analysis. In 10th Annual IEEE\/ACM International Symposium on Code Generation and Optimization, CGO 2012, San Jose, CA, USA, March 31 - April 04, 2012, Carol Eidt, Anne M. Holler, Uma Srinivasan, and Saman P. Amarasinghe (Eds.). ACM, 264\u2013274. https:\/\/doi.org\/10.1145\/2259016.2259050 10.1145\/2259016.2259050"},{"key":"e_1_3_1_55_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASE56229.2023.00118"},{"key":"e_1_3_1_56_1","doi-asserted-by":"crossref","unstructured":"Chenghang Shi Haofeng Li Yulei Sui Jie Lu Lian Li and Jingling Xue. 2024. PEARL: A Multi-Derivation Approach to Efficient CFL-Reachability Solving. IEEE Transactions on Software Engineering (2024) 1\u201319. https:\/\/doi.org\/10.1109\/TSE.2024.3437684 10.1109\/TSE.2024.3437684","DOI":"10.1109\/TSE.2024.3437684"},{"key":"e_1_3_1_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/3563339"},{"key":"e_1_3_1_58_1","first-page":"27","article-title":"IDEal: Efficient and Precise Alias-Aware Dataflow Analysis","volume":"1","author":"Sp\u00e4th Johannes","year":"2017","unstructured":"Johannes Sp\u00e4th, Karim Ali, and Eric Bodden. 2017. IDEal: Efficient and Precise Alias-Aware Dataflow Analysis. Proc. ACM Program. Lang. 1, OOPSLA, Article 99 (Oct. 2017), 27 pages. https:\/\/doi.org\/10.1145\/3133923 10.1145\/3133923","journal-title":"Proc. ACM Program. Lang"},{"key":"e_1_3_1_59_1","first-page":"29","article-title":"Context-, Flow-, and Field-sensitive Data-flow Analysis Using Synchronized Pushdown Systems","volume":"3","author":"Sp\u00e4th Johannes","year":"2019","unstructured":"Johannes Sp\u00e4th, Karim Ali, and Eric Bodden. 2019. Context-, Flow-, and Field-sensitive Data-flow Analysis Using Synchronized Pushdown Systems. Proceedings of the ACM SIGPLAN Symposium on Principles of Programming Languages 3, POPL, Article 48 (Jan. 2019), 29 pages. https:\/\/doi.org\/10.1145\/3290361 10.1145\/3290361","journal-title":"Proceedings of the ACM SIGPLAN Symposium on Principles of Programming Languages"},{"key":"e_1_3_1_60_1","volume-title":"30th European Conference on Object-Oriented Programming, ECOOP 2016, July 18-22, 2016, Rome, Italy (LIPIcs, Vol. 56)","author":"Sp\u00e4th Johannes","year":"2016","unstructured":"Johannes Sp\u00e4th, Lisa Nguyen Quang Do, Karim Ali, and Eric Bodden. 2016. Boomerang: Demand-Driven Flow-and Context-Sensitive Pointer Analysis for Java. In 30th European Conference on Object-Oriented Programming, ECOOP 2016, July 18-22, 2016, Rome, Italy (LIPIcs, Vol. 56), Shriram Krishnamurthi and Benjamin S. Lerner (Eds.). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, Rome, Italy, 22:1\u201322:26. https:\/\/doi.org\/10.4230\/LIPIcs.ECOOP.2016.22 10.4230\/LIPIcs.ECOOP.2016.22"},{"issue":"1","key":"e_1_3_1_61_1","article-title":"Boomerang: Demand-Driven Flow- and Context-Sensitive Pointer Analysis for Java (Artifact)","volume":"2","author":"Sp\u00e4th Johannes","year":"2016","unstructured":"Johannes Sp\u00e4th, Lisa Nguyen Quang Do, Karim Ali, and Eric Bodden. 2016. Boomerang: Demand-Driven Flow- and Context-Sensitive Pointer Analysis for Java (Artifact). Dagstuhl Artifacts Series 2, 1 (2016), 12:1\u201312:2. https:\/\/doi.org\/10.4230\/DARTS.2.1.12 10.4230\/DARTS.2.1.12","journal-title":"Dagstuhl Artifacts Series"},{"key":"e_1_3_1_62_1","doi-asserted-by":"crossref","first-page":"1808","DOI":"10.1145\/2480362.2480701","volume-title":"Proceedings of the 28th Annual ACM Symposium on Applied Computing (Coimbra, Portugal) (SAC \u201913)","author":"Spreitzenbarth Michael","year":"2013","unstructured":"Michael Spreitzenbarth, Felix Freiling, Florian Echtler, Thomas Schreck, and Johannes Hoffmann. 2013. Mobile-Sandbox: Having a Deeper Look into Android Applications. In Proceedings of the 28th Annual ACM Symposium on Applied Computing (Coimbra, Portugal) (SAC \u201913). Association for Computing Machinery, New York, NY, USA, 1808\u20131815. https:\/\/doi.org\/10.1145\/2480362.2480701 10.1145\/2480362.2480701"},{"key":"e_1_3_1_63_1","doi-asserted-by":"publisher","DOI":"10.1145\/1133255.1134027"},{"key":"e_1_3_1_64_1","doi-asserted-by":"crossref","unstructured":"Manu Sridharan Stephen J Fink and Rastislav Bodik. 2007. Thin slicing. In Proceedings of the 28th ACM SIGPLAN conference on programming language design and implementation. 112\u2013122. https:\/\/doi.org\/10.1145\/1250734.1250748 10.1145\/1250734.1250748","DOI":"10.1145\/1250734.1250748"},{"key":"e_1_3_1_65_1","doi-asserted-by":"publisher","DOI":"10.1145\/1103845.1094817"},{"key":"e_1_3_1_66_1","first-page":"210","volume-title":"Fundamental Approaches to Software Engineering - 16th International Conference, FASE 2013, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2013, Rome, Italy, March 16-24, 2013. Proceedings (Lecture Notes in Computer Science, Vol. 7793)","author":"Tripp Omer","year":"2013","unstructured":"Omer Tripp, Marco Pistoia, Patrick Cousot, Radhia Cousot, and Salvatore Guarnieri. 2013. Andromeda: Accurate and Scalable Security Analysis of Web Applications. In Fundamental Approaches to Software Engineering - 16th International Conference, FASE 2013, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2013, Rome, Italy, March 16-24, 2013. Proceedings (Lecture Notes in Computer Science, Vol. 7793), Vittorio Cortellessa and D\u00e1niel Varr\u00f3 (Eds.). Springer, Rome, Italy, 210\u2013225. https:\/\/doi.org\/10.1007\/978-3-642-37057-1_15 10.1007\/978-3-642-37057-1_15"},{"issue":"6","key":"e_1_3_1_67_1","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1145\/1543135.1542486","article-title":"TAJ: Effective Taint Analysis of Web Applications","volume":"44","author":"Tripp Omer","year":"2009","unstructured":"Omer Tripp, Marco Pistoia, Stephen J. Fink, Manu Sridharan, and Omri Weisman. 2009. TAJ: Effective Taint Analysis of Web Applications. SIGPLAN Not. 44, 6 (June 2009), 87\u201397. https:\/\/doi.org\/10.1145\/1543135.1542486 10.1145\/1543135.1542486","journal-title":"SIGPLAN Not"},{"key":"e_1_3_1_68_1","doi-asserted-by":"publisher","DOI":"10.1145\/3093337.3037744"},{"key":"e_1_3_1_69_1","first-page":"2488","volume-title":"Proceedings of the 45th International Conference on Software Engineering (Melbourne, Victoria, Australia) (ICSE \u201923)","author":"Wang Xizao","year":"2023","unstructured":"Xizao Wang, Zhiqiang Zuo, Lei Bu, and Jianhua Zhao. 2023. DStream: A Streaming-Based Highly Parallel IFDS Framework. In Proceedings of the 45th International Conference on Software Engineering (Melbourne, Victoria, Australia) (ICSE \u201923). IEEE Press, Melbourne, Victoria, Australia, 2488\u20132500. https:\/\/doi.org\/10.1109\/ICSE48619.2023.00208 10.1109\/ICSE48619.2023.00208"},{"key":"e_1_3_1_70_1","first-page":"171","volume-title":"Proceedings of the 30th International Conference on Software Engineering (Leipzig, Germany) (ICSE \u201908)","author":"Wassermann Gary","year":"2008","unstructured":"Gary Wassermann and Zhendong Su. 2008. Static Detection of Cross-Site Scripting Vulnerabilities. In Proceedings of the 30th International Conference on Software Engineering (Leipzig, Germany) (ICSE \u201908). Association for Computing Machinery, New York, NY, USA, 171\u2013180. https:\/\/doi.org\/10.1145\/1368088.1368112 10.1145\/1368088.1368112"},{"key":"e_1_3_1_71_1","first-page":"1329","volume-title":"Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security (Scottsdale, Arizona, USA) (CCS \u201914)","author":"Wei Fengguo","year":"2014","unstructured":"Fengguo Wei, Sankardas Roy, Xinming Ou, and Robby. 2014. Amandroid: A Precise and General Inter-Component Data Flow Analysis Framework for Security Vetting of Android Apps. In Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security (Scottsdale, Arizona, USA) (CCS \u201914). Association for Computing Machinery, New York, NY, USA, 1329\u20131341. https:\/\/doi.org\/10.1145\/2660267.2660357 10.1145\/2660267.2660357"},{"key":"e_1_3_1_72_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03013-0_6"},{"key":"e_1_3_1_73_1","doi-asserted-by":"crossref","unstructured":"Wei Yang Mukul Prasad and Tao Xie. 2018. EnMobile: Entity-Based Characterization and Analysis of Mobile Malware. In 2018 IEEE\/ACM 40th International Conference on Software Engineering (ICSE). 384\u2013394. https:\/\/doi.org\/10.1145\/3180155.3180223 10.1145\/3180155.3180223","DOI":"10.1145\/3180155.3180223"},{"key":"e_1_3_1_74_1","doi-asserted-by":"crossref","unstructured":"Zhi Yang Zhanhui Yuan Shuyuan Jin Xingyuan Chen Lei Sun Xuehui Du Wenfa Li and Hongqi Zhang. 2022. FSAFlow: Lightweight and Fast Dynamic Path Tracking and Control for Privacy Protection on Android Using Hybrid Analysis with State-Reduction Strategy. In 2022 IEEE Symposium on Security and Privacy (SP). 2114\u20132129. https:\/\/doi.org\/10.1109\/SP46214.2022.9833764 10.1109\/SP46214.2022.9833764","DOI":"10.1109\/SP46214.2022.9833764"},{"key":"e_1_3_1_75_1","doi-asserted-by":"crossref","unstructured":"Mihalis Yannakakis. 1990. Graph-theoretic methods in database theory. In Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems. 230\u2013242. https:\/\/doi.org\/10.1145\/298514.298576 10.1145\/298514.298576","DOI":"10.1145\/298514.298576"},{"key":"e_1_3_1_76_1","doi-asserted-by":"crossref","unstructured":"Qirun Zhang Michael R Lyu Hao Yuan and Zhendong Su. 2013. Fast algorithms for Dyck-CFL-reachability with applications to alias analysis. In Proceedings of the 34th ACM SIGPLAN conference on Programming language design and implementation. 435\u2013446. https:\/\/doi.org\/10.1145\/2491956.2462159 10.1145\/2491956.2462159","DOI":"10.1145\/2491956.2462159"},{"key":"e_1_3_1_77_1","doi-asserted-by":"crossref","unstructured":"Qirun Zhang and Zhendong Su. 2017. Context-sensitive data-dependence analysis via linear conjunctive language reachability. In Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages. 344\u2013358. https:\/\/doi.org\/10.1145\/3093333.3009848 10.1145\/3093333.3009848","DOI":"10.1145\/3009837.3009848"},{"key":"e_1_3_1_78_1","doi-asserted-by":"crossref","unstructured":"Xin Zheng and Radu Rugina. 2008. Demand-driven alias analysis for C. In Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages. 197\u2013208. https:\/\/doi.org\/10.1145\/1328897.1328464 10.1145\/1328897.1328464","DOI":"10.1145\/1328438.1328464"}],"container-title":["Proceedings of the ACM on Programming Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3689804","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3689804","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,4]],"date-time":"2026-02-04T09:04:56Z","timestamp":1770195896000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3689804"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,8]]},"references-count":77,"journal-issue":{"issue":"OOPSLA2","published-print":{"date-parts":[[2024,10,8]]}},"alternative-id":["10.1145\/3689804"],"URL":"https:\/\/doi.org\/10.1145\/3689804","relation":{},"ISSN":["2475-1421"],"issn-type":[{"value":"2475-1421","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,10,8]]},"assertion":[{"value":"2024-04-06","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-08-18","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-10-08","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}