{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,18]],"date-time":"2026-08-18T01:47:23Z","timestamp":1787017643076,"version":"build-2736575974"},"reference-count":106,"publisher":"Association for Computing Machinery (ACM)","issue":"PLDI","license":[{"start":{"date-parts":[[2024,6,20]],"date-time":"2024-06-20T00:00:00Z","timestamp":1718841600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. ACM Program. Lang."],"published-print":{"date-parts":[[2024,6,20]]},"abstract":"<jats:p>\n                    This paper presents a scalable path- and context-sensitive data dependence analysis. The key is to address the aliasing-path-explosion problem when enforcing a path-sensitive memory model. Specifically, our approach decomposes the computational efforts of disjunctive reasoning into 1) a context- and semi-path-sensitive analysis that concisely summarizes data dependence as the symbolic and storeless value-flow graphs, and 2) a demand-driven phase that resolves transitive data dependence over the graphs, piggybacking the computation of fully path-sensitive pointer information with the resolution of data dependence of interest. We have applied the approach to two clients, namely thin slicing and value-flow bug finding. Using a suite of 16\n                    <jats:inline-formula>\n                      <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" display=\"inline\" overflow=\"scroll\">\n                        <mml:mi mathvariant=\"normal\">C<\/mml:mi>\n                        <mml:mo>\/<\/mml:mo>\n                        <mml:mi mathvariant=\"normal\">C<\/mml:mi>\n                        <mml:mo>+<\/mml:mo>\n                        <mml:mo>+<\/mml:mo>\n                      <\/mml:math>\n                    <\/jats:inline-formula>\n                    programs ranging from 13 KLoC to 8 MLoC, we compare our techniques against a diverse group of state-of-the-art analyses, illustrating the significant precision and scalability advantages of our approach.\n                  <\/jats:p>","DOI":"10.1145\/3656400","type":"journal-article","created":{"date-parts":[[2024,6,20]],"date-time":"2024-06-20T12:27:20Z","timestamp":1718886440000},"page":"567-592","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["Falcon: A Fused Approach to Path-Sensitive Sparse Data Dependence Analysis"],"prefix":"10.1145","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0342-9518","authenticated-orcid":false,"given":"Peisen","family":"Yao","sequence":"first","affiliation":[{"name":"The State Key Laboratory of Blockchain and Data Security, Zhejiang University, Hangzhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7664-2718","authenticated-orcid":false,"given":"Jinguo","family":"Zhou","sequence":"additional","affiliation":[{"name":"Ant Group, Shenzhen, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8174-7277","authenticated-orcid":false,"given":"Xiao","family":"Xiao","sequence":"additional","affiliation":[{"name":"Ant Group, Hangzhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8297-8998","authenticated-orcid":false,"given":"Qingkai","family":"Shi","sequence":"additional","affiliation":[{"name":"The State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4648-3795","authenticated-orcid":false,"given":"Rongxin","family":"Wu","sequence":"additional","affiliation":[{"name":"The Xiamen Key Laboratory of Intelligent Storage and Computing, School of Informatics, Xiamen University, Xiamen, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6417-1034","authenticated-orcid":false,"given":"Charles","family":"Zhang","sequence":"additional","affiliation":[{"name":"The Hong Kong University of Science and Technology, Hong Kong, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2024,6,20]]},"reference":[{"key":"e_1_3_1_2_2","doi-asserted-by":"publisher","DOI":"10.1145\/2814270.2814285"},{"key":"e_1_3_1_3_2","unstructured":"Robert S Arnold. 1996. Software Change Impact Analysis. (1996)."},{"key":"e_1_3_1_4_2","doi-asserted-by":"publisher","DOI":"10.1145\/1368088.1368118"},{"key":"e_1_3_1_5_2","doi-asserted-by":"publisher","DOI":"10.1145\/503272.503274"},{"key":"e_1_3_1_6_2","doi-asserted-by":"publisher","DOI":"10.1145\/1646353.1646374"},{"key":"e_1_3_1_7_2","doi-asserted-by":"publisher","DOI":"10.1145\/2491956.2462186"},{"key":"e_1_3_1_8_2","volume-title":"Proceedings of the 8th USENIX Conference on Operating Systems Design and Implementation (OSDI\u201908)","author":"Cadar Cristian","year":"2008","unstructured":"Cristian Cadar, Daniel Dunbar, Dawson R Engler, et al. 2008. KLEE: Unassisted and Automatic Generation of High-Coverage Tests for Complex Systems Programs.. In Proceedings of the 8th USENIX Conference on Operating Systems Design and Implementation (OSDI\u201908). Berkeley, CA, USA."},{"key":"e_1_3_1_9_2","article-title":"Compositional shape analysis by means of bi-abduction","volume":"6","author":"Calcagno Cristiano","year":"2011","unstructured":"Cristiano Calcagno, Dino Distefano, Peter W O\u2019hearn, and Hongseok Yang. 2011. Compositional shape analysis by means of bi-abduction. J. ACM 58, 6, Article 26 (Dec. 2011).","journal-title":"J. ACM 58"},{"key":"e_1_3_1_10_2","doi-asserted-by":"publisher","DOI":"10.1145\/1542476.1542517"},{"key":"e_1_3_1_11_2","article-title":"Optimal Dyck Reachability for Datadependence and Alias Analysis","volume":"2","author":"Chatterjee Krishnendu","year":"2017","unstructured":"Krishnendu Chatterjee, Bhavya Choudhary, and Andreas Pavlogiannis. 2017. Optimal Dyck Reachability for Datadependence and Alias Analysis. Proc. ACM Program. Lang. 2, POPL, Article 30 (Dec. 2017).","journal-title":"Proc. ACM Program. Lang."},{"key":"e_1_3_1_12_2","doi-asserted-by":"publisher","DOI":"10.1145\/292540.292554"},{"key":"e_1_3_1_13_2","doi-asserted-by":"publisher","DOI":"10.1145\/1250734.1250789"},{"key":"e_1_3_1_14_2","doi-asserted-by":"publisher","DOI":"10.1145\/115372.115320"},{"key":"e_1_3_1_15_2","doi-asserted-by":"publisher","DOI":"10.1145\/512529.512538"},{"key":"e_1_3_1_16_2","volume-title":"Proceedings of the Theory and Practice of Software, 14th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS\u201908\/ETAPS\u201908)","author":"Moura Leonardo De","year":"2008","unstructured":"Leonardo De Moura and Nikolaj Bj\u00f8rner. 2008. Z3: An efficient SMT solver. In Proceedings of the Theory and Practice of Software, 14th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS\u201908\/ETAPS\u201908). Berlin, Heidelberg."},{"key":"e_1_3_1_17_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11957-6_14"},{"key":"e_1_3_1_18_2","doi-asserted-by":"crossref","unstructured":"Isil Dillig Thomas Dillig and Alex Aiken. 2011. Precise reasoning for programs using containers. In Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages. ACM.","DOI":"10.1145\/1926385.1926407"},{"key":"e_1_3_1_19_2","doi-asserted-by":"publisher","DOI":"10.1145\/1993498.1993565"},{"key":"e_1_3_1_20_2","doi-asserted-by":"publisher","DOI":"10.1145\/178243.178264"},{"key":"e_1_3_1_21_2","doi-asserted-by":"publisher","DOI":"10.1145\/2814270.2814284"},{"key":"e_1_3_1_22_2","doi-asserted-by":"publisher","DOI":"10.1145\/1146238.1146254"},{"key":"e_1_3_1_23_2","doi-asserted-by":"publisher","DOI":"10.1145\/1348250.1348255"},{"key":"e_1_3_1_24_2","unstructured":"Pritam M. Gharat Uday P. Khedker and Alan Mycroft. 2016. Flow- and Context-Sensitive Points-To Analysis Using Generalized Points-To Graphs. In Static Analysis - 23rd International Symposium SAS 2016 Edinburgh UK September 8-10 2016 Proceedings (Lecture Notes in Computer Science Vol. 9837) Xavier Rival (Ed.)."},{"key":"e_1_3_1_25_2","doi-asserted-by":"publisher","DOI":"10.1145\/3133926"},{"key":"e_1_3_1_26_2","doi-asserted-by":"publisher","DOI":"10.1145\/506315.506316"},{"key":"e_1_3_1_27_2","unstructured":"Bhargav S. Gulavani Supratik Chakraborty Ganesan Ramalingam and Aditya V. Nori. 2009. Bottom-Up Shape Analysis. In Static Analysis 16th International Symposium SAS 2009 Los Angeles CA USA August 9-11 2009. Proceedings (Lecture Notes in Computer Science Vol. 5673) Jens Palsberg and Zhendong Su (Eds.)."},{"key":"e_1_3_1_28_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2005.02.005"},{"key":"e_1_3_1_29_2","doi-asserted-by":"publisher","DOI":"10.1145\/1181775.1181785"},{"key":"e_1_3_1_30_2","doi-asserted-by":"crossref","unstructured":"Ben Hardekopf and Calvin Lin. 2009. Semi-sparse flow-sensitive pointer analysis. In Proceedings of the 36th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages POPL 2009 Savannah GA USA January 21-23 2009 Zhong Shao and Benjamin C. Pierce (Eds.).","DOI":"10.1145\/1480881.1480911"},{"key":"e_1_3_1_31_2","doi-asserted-by":"crossref","unstructured":"Ben Hardekopf and Calvin Lin. 2011. Flow-sensitive pointer analysis for millions of lines of code. In Proceedings of the CGO 2011 The 9th International Symposium on Code Generation and Optimization Chamonix France April 2-6 2011.","DOI":"10.1109\/CGO.2011.5764696"},{"key":"e_1_3_1_32_2","doi-asserted-by":"publisher","DOI":"10.1145\/3088515.3088519"},{"key":"e_1_3_1_33_2","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2022.3162236"},{"key":"e_1_3_1_34_2","doi-asserted-by":"publisher","DOI":"10.1145\/378795.378802"},{"key":"e_1_3_1_35_2","doi-asserted-by":"publisher","DOI":"10.1145\/77606.77608"},{"key":"e_1_3_1_36_2","doi-asserted-by":"publisher","DOI":"10.1109\/SP46214.2022.9833751"},{"key":"e_1_3_1_37_2","doi-asserted-by":"publisher","DOI":"10.1145\/3293607"},{"key":"e_1_3_1_38_2","doi-asserted-by":"publisher","DOI":"10.1145\/3276510"},{"key":"e_1_3_1_39_2","doi-asserted-by":"publisher","DOI":"10.1145\/3428247"},{"key":"e_1_3_1_40_2","doi-asserted-by":"publisher","DOI":"10.1145\/3133924"},{"key":"e_1_3_1_41_2","doi-asserted-by":"publisher","DOI":"10.1145\/1375581.1375613"},{"key":"e_1_3_1_42_2","doi-asserted-by":"publisher","DOI":"10.1145\/2931098"},{"key":"e_1_3_1_43_2","doi-asserted-by":"publisher","DOI":"10.1145\/2491956.2462191"},{"key":"e_1_3_1_44_2","doi-asserted-by":"publisher","DOI":"10.1145\/3338906.3338934"},{"key":"e_1_3_1_45_2","doi-asserted-by":"publisher","DOI":"10.1145\/1250734.1250766"},{"key":"e_1_3_1_46_2","doi-asserted-by":"publisher","DOI":"10.1145\/1926385.1926389"},{"key":"e_1_3_1_47_2","doi-asserted-by":"publisher","DOI":"10.1145\/1391984.1391987"},{"key":"e_1_3_1_48_2","doi-asserted-by":"publisher","DOI":"10.1145\/3009837.3009881"},{"key":"e_1_3_1_49_2","doi-asserted-by":"publisher","DOI":"10.1145\/2025113.2025160"},{"key":"e_1_3_1_50_2","doi-asserted-by":"publisher","DOI":"10.1145\/2491894.2466483"},{"key":"e_1_3_1_51_2","doi-asserted-by":"publisher","DOI":"10.1145\/3276511"},{"key":"e_1_3_1_52_2","doi-asserted-by":"publisher","DOI":"10.1145\/3236024.3236041"},{"key":"e_1_3_1_53_2","unstructured":"Yue Li Tian Tan Yifei Zhang and Jingling Xue. 2016. Program tailoring: Slicing by sequential criteria. In 30th European Conference on Object-Oriented Programming (ECOOP 2016) (Leibniz International Proceedings in Informatics (LIPIcs) Vol. 56) Shriram Krishnamurthi and Benjamin S. Lerner (Eds.). Dagstuhl Germany."},{"key":"e_1_3_1_54_2","doi-asserted-by":"publisher","DOI":"10.5555\/647170.718290"},{"key":"e_1_3_1_55_2","doi-asserted-by":"publisher","DOI":"10.1145\/940071.940114"},{"key":"e_1_3_1_56_2","unstructured":"Jingbo Lu Dongjie He and Jingling Xue. 2021. Selective Context-Sensitivity for k-CFA with CFL-Reachability. In Static Analysis - 28th International Symposium SAS 2021 Chicago IL USA October 17-19 2021 Proceedings (Lecture Notes in Computer Science Vol. 12913) Cezara Dragoi Suvam Mukherjee and Kedar S. Namjoshi (Eds.)."},{"key":"e_1_3_1_57_2","article-title":"Precision-Preserving yet Fast Object-Sensitive Pointer Analysis with Partial Context Sensitivity","volume":"3","author":"Jingbo Lu","year":"2019","unstructured":"Jingbo Lu and Jingling Xue. 2019. Precision-Preserving yet Fast Object-Sensitive Pointer Analysis with Partial Context Sensitivity. Proc. ACM Program. Lang. 3, OOPSLA, Article 148 (Oct. 2019).","journal-title":"Proc. ACM Program. Lang."},{"key":"e_1_3_1_58_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-37051-9_4"},{"key":"e_1_3_1_59_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-10936-7_13"},{"key":"e_1_3_1_60_2","doi-asserted-by":"publisher","DOI":"10.1145\/1029894.1029907"},{"key":"e_1_3_1_61_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31987-0_2"},{"key":"e_1_3_1_62_2","doi-asserted-by":"publisher","DOI":"10.1145\/113445.113447"},{"key":"e_1_3_1_63_2","doi-asserted-by":"publisher","DOI":"10.1145\/2491411.2501854"},{"issue":"1","key":"e_1_3_1_64_2","article-title":"Precise call graphs for C programs with function pointers. Automated Software Engg","volume":"11","author":"Milanova Ana","year":"2004","unstructured":"Ana Milanova, Atanas Rountev, and Barbara G Ryder. 2004. Precise call graphs for C programs with function pointers. Automated Software Engg. 11, 1 (Jan. 2004).","journal-title":"(Jan. 2004)"},{"key":"e_1_3_1_65_2","doi-asserted-by":"crossref","unstructured":"Mahdi Soltan Mohammadi Kazem Cheshmi Maryam Mehri Dehnavi Anand Venkat Tomofumi Yuki and Michelle Mills Strout. 2018. Extending Index-Array Properties for Data Dependence Analysis (LCPC \u201914).","DOI":"10.1007\/978-3-030-34627-0_7"},{"key":"e_1_3_1_66_2","doi-asserted-by":"publisher","DOI":"10.1145\/3314221.3314646"},{"key":"e_1_3_1_67_2","doi-asserted-by":"publisher","DOI":"10.5555\/998675.999453"},{"key":"e_1_3_1_68_2","doi-asserted-by":"publisher","DOI":"10.1145\/93542.93578"},{"key":"e_1_3_1_69_2","doi-asserted-by":"crossref","unstructured":"Alex Pothen and Sivan Toledo. 2004. Elimination Structures in Scientific Computing.","DOI":"10.1201\/9781420035179.ch59"},{"issue":"11","key":"e_1_3_1_70_2","article-title":"Program analysis via graph reachability","volume":"40","author":"Reps Thomas","year":"1998","unstructured":"Thomas Reps. 1998. Program analysis via graph reachability. Information and software technology 40, 11 (1998).","journal-title":"Information and software technology"},{"key":"e_1_3_1_71_2","doi-asserted-by":"publisher","DOI":"10.1145\/514188.514190"},{"key":"e_1_3_1_72_2","volume-title":"Proceedings of the 7th ACM SIGPLAN International Conference on Principles and Practice of Declarative Programming (PPDP \u201905)","author":"and Diptikalyan Saha","year":"2005","unstructured":"Diptikalyan Saha and CR Ramakrishnan. 2005. Incremental and demand-driven points-to analysis using logic programming. In Proceedings of the 7th ACM SIGPLAN International Conference on Principles and Practice of Declarative Programming (PPDP \u201905). New York, NY, USA."},{"key":"e_1_3_1_73_2","doi-asserted-by":"publisher","DOI":"10.1007\/11823230_2"},{"key":"e_1_3_1_74_2","doi-asserted-by":"publisher","DOI":"10.1145\/2259016.2259050"},{"key":"e_1_3_1_75_2","doi-asserted-by":"publisher","DOI":"10.1145\/3192366.3192418"},{"key":"e_1_3_1_76_2","doi-asserted-by":"publisher","DOI":"10.1145\/3485540"},{"key":"e_1_3_1_77_2","doi-asserted-by":"publisher","DOI":"10.1145\/2594291.2594320"},{"key":"e_1_3_1_78_2","doi-asserted-by":"publisher","DOI":"10.1145\/3290361"},{"key":"e_1_3_1_79_2","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.)."},{"key":"e_1_3_1_80_2","doi-asserted-by":"publisher","DOI":"10.1145\/1133981.1134027"},{"key":"e_1_3_1_81_2","doi-asserted-by":"publisher","DOI":"10.1145\/1250734.1250748"},{"key":"e_1_3_1_82_2","doi-asserted-by":"publisher","DOI":"10.1145\/1094811.1094817"},{"key":"e_1_3_1_83_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2014.54"},{"key":"e_1_3_1_84_2","doi-asserted-by":"publisher","DOI":"10.1145\/2854038.2854043"},{"key":"e_1_3_1_85_2","volume-title":"Proceedings of the 2016 24th ACM SIGSOFT International Symposium on Foundations of Software Engineering (FSE 2016)","author":"and Yulei Sui","year":"2016","unstructured":"Yulei Sui and Jingling Xue. 2016. On-demand strong update analysis via value-flow refinement. In Proceedings of the 2016 24th ACM SIGSOFT International Symposium on Foundations of Software Engineering (FSE 2016). New York, NY, USA."},{"key":"e_1_3_1_86_2","volume-title":"Proceedings of the 25th International Conference on Compiler Construction (CC 2016)","author":"and Yulei Sui","year":"2016","unstructured":"Yulei Sui and Jingling Xue. 2016. SVF: interprocedural static value-flow analysis in LLVM. In Proceedings of the 25th International Conference on Compiler Construction (CC 2016). New York, NY, USA."},{"key":"e_1_3_1_87_2","unstructured":"Y. Sui and J. Xue. 2018. Value-Flow-Based Demand-Driven Pointer Analysis for C and C++. IEEE Transactions on Software Engineering (2018)."},{"key":"e_1_3_1_88_2","doi-asserted-by":"crossref","unstructured":"Yulei Sui Ding Ye and Jingling Xue. 2012. Static memory leak detection using full-sparse value-flow analysis. In International Symposium on Software Testing and Analysis ISSTA 2012 Minneapolis MN USA July 15-20 2012 Mats Per Erik Heimdahl and Zhendong Su (Eds.).","DOI":"10.1145\/2338965.2336784"},{"key":"e_1_3_1_89_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25318-8_14"},{"key":"e_1_3_1_90_2","doi-asserted-by":"publisher","DOI":"10.1002\/spe.2214"},{"key":"e_1_3_1_91_2","doi-asserted-by":"publisher","DOI":"10.1145\/2676726.2676997"},{"key":"e_1_3_1_92_2","doi-asserted-by":"crossref","unstructured":"Wensheng Tang Yikun Hu Gang Fan Peisen Yao Rongxin Wu Guangyuan Bai Pengcheng Wang and Charles Zhang. 2021. Transcode: Detecting Status Code Mapping Errors in Large-Scale Systems. In 36th IEEE\/ACM International Conference on Automated Software Engineering ASE 2021 Melbourne Australia November 15-19 2021. IEEE 829\u2013841.","DOI":"10.1109\/ASE51524.2021.9678823"},{"key":"e_1_3_1_93_2","doi-asserted-by":"publisher","DOI":"10.1145\/1542476.1542486"},{"key":"e_1_3_1_94_2","volume-title":"Proceedings of the 35th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL \u201908)","author":"and Christopher Unkel","year":"2008","unstructured":"Christopher Unkel and Monica S Lam. 2008. Automatic inference of stationary fields: a generalization of java\u2019s final fields. In Proceedings of the 35th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL \u201908). New York, NY, USA."},{"key":"e_1_3_1_95_2","doi-asserted-by":"publisher","DOI":"10.1145\/3527312"},{"key":"e_1_3_1_96_2","unstructured":"Wei Wang Clark W. Barrett and Thomas Wies. 2017. Partitioned Memory Models for Program Analysis. In Verification Model Checking and Abstract Interpretation - 18th International Conference VMCAI 2017 Paris France January 15-17 2017 Proceedings (Lecture Notes in Computer Science Vol. 10145) Ahmed Bouajjani and David Monniaux (Eds.)."},{"key":"e_1_3_1_97_2","doi-asserted-by":"publisher","DOI":"10.1145\/207110.207111"},{"key":"e_1_3_1_98_2","volume-title":"Proceedings of the 32Nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL \u201905)","author":"and Yichen Xie","year":"2005","unstructured":"Yichen Xie and Alex Aiken. 2005. Scalable error detection using boolean satisfiability. In Proceedings of the 32Nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL \u201905). New York, NY, USA."},{"key":"e_1_3_1_99_2","doi-asserted-by":"publisher","DOI":"10.1145\/2001420.2001440"},{"key":"e_1_3_1_100_2","doi-asserted-by":"publisher","DOI":"10.1145\/3180155.3180178"},{"key":"e_1_3_1_101_2","unstructured":"Sen Ye Yulei Sui and Jingling Xue. 2014. Region-Based Selective Flow-Sensitive Pointer Analysis. In Static Analysis - 21st International Symposium SAS 2014 Munich Germany September 11-13 2014. Proceedings (Lecture Notes in Computer Science Vol. 8723) Markus M\u00fcller-Olm and Helmut Seidl (Eds.)."},{"key":"e_1_3_1_102_2","doi-asserted-by":"publisher","DOI":"10.1145\/1772954.1772985"},{"key":"e_1_3_1_103_2","article-title":"An Efficient Algorithm for Unit Propagation","volume":"96","author":"and Hantao Zhang","year":"1996","unstructured":"Hantao Zhang and Mark E Stickely. 1996. An Efficient Algorithm for Unit Propagation. Proc. of AI-MATH 96 (1996).","journal-title":"Proc. of AI-MATH"},{"key":"e_1_3_1_104_2","doi-asserted-by":"publisher","DOI":"10.1145\/2491956.2462159"},{"key":"e_1_3_1_105_2","volume-title":"Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages (POPL 2017)","author":"and Qirun Zhang","year":"2017","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 (POPL 2017). New York, NY, USA."},{"key":"e_1_3_1_106_2","doi-asserted-by":"publisher","DOI":"10.1145\/3178372.3179517"},{"key":"e_1_3_1_107_2","volume-title":"Proceedings of the 35th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL \u201908)","author":"and Xin Zheng","year":"2008","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 (POPL \u201908). New York, NY, USA."}],"container-title":["Proceedings of the ACM on Programming Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3656400","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3656400","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T16:40:47Z","timestamp":1751647247000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3656400"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,20]]},"references-count":106,"journal-issue":{"issue":"PLDI","published-print":{"date-parts":[[2024,6,20]]}},"alternative-id":["10.1145\/3656400"],"URL":"https:\/\/doi.org\/10.1145\/3656400","relation":{},"ISSN":["2475-1421"],"issn-type":[{"value":"2475-1421","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,6,20]]},"assertion":[{"value":"2024-06-20","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}