{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T01:13:23Z","timestamp":1780708403100,"version":"3.54.1"},"reference-count":56,"publisher":"Association for Computing Machinery (ACM)","issue":"POPL","license":[{"start":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T00:00:00Z","timestamp":1641945600000},"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":[[2022,1,16]]},"abstract":"<jats:p>\n            In this paper, we challenge the commonly-accepted wisdom in static analysis that object sensitivity is superior to call-site sensitivity for object-oriented programs. In static analysis of object-oriented programs, object sensitivity has been established as the dominant flavor of context sensitivity thanks to its outstanding precision. On the other hand, call-site sensitivity has been regarded as unsuitable and its use in practice has been constantly discouraged for object-oriented programs. In this paper, however, we claim that call-site sensitivity is generally a superior context abstraction because it is practically possible to transform object sensitivity into more precise call-site sensitivity. Our key insight is that the previously known superiority of object sensitivity holds only in the traditional\n            <jats:italic>k<\/jats:italic>\n            -limited setting, where the analysis is enforced to keep the most recent\n            <jats:italic>k<\/jats:italic>\n            context elements. However, it no longer holds in a recently-proposed, more general setting with context tunneling. With context tunneling, where the analysis is free to choose an arbitrary\n            <jats:italic>k<\/jats:italic>\n            -length subsequence of context strings, we show that call-site sensitivity can simulate object sensitivity almost completely, but not vice versa. To support the claim, we present a technique, called Obj2CFA, for transforming arbitrary context-tunneled object sensitivity into more precise, context-tunneled call-site-sensitivity. We implemented Obj2CFA in Doop and used it to derive a new call-site-sensitive analysis from a state-of-the-art object-sensitive pointer analysis. Experimental results confirm that the resulting call-site sensitivity outperforms object sensitivity in precision and scalability for real-world Java programs. Remarkably, our results show that even 1-call-site sensitivity can be more precise than the conventional 3-object-sensitive analysis.\n          <\/jats:p>","DOI":"10.1145\/3498720","type":"journal-article","created":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T17:03:12Z","timestamp":1642006992000},"page":"1-29","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":16,"title":["Return of CFA: call-site sensitivity can be superior to object sensitivity even for object-oriented programs"],"prefix":"10.1145","volume":"6","author":[{"given":"Minseok","family":"Jeon","sequence":"first","affiliation":[{"name":"Korea University, South Korea"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hakjoo","family":"Oh","sequence":"additional","affiliation":[{"name":"Korea University, South Korea"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2022,1,12]]},"reference":[{"key":"e_1_2_2_1_1","volume-title":"Learning a Static Analyzer from Data","author":"Bielik Pavol","unstructured":"Pavol Bielik , Veselin Raychev , and Martin Vechev . 2017. Learning a Static Analyzer from Data . In Computer Aided Verification, Rupak Majumdar and Viktor Kun\u010dak (Eds.). Springer International Publishing , Cham . 233\u2013253. isbn:978-3-319-63387-9 Pavol Bielik, Veselin Raychev, and Martin Vechev. 2017. Learning a Static Analyzer from Data. In Computer Aided Verification, Rupak Majumdar and Viktor Kun\u010dak (Eds.). Springer International Publishing, Cham. 233\u2013253. isbn:978-3-319-63387-9"},{"key":"e_1_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1167473.1167488"},{"key":"e_1_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1640089.1640108"},{"key":"e_1_2_2_4_1","volume-title":"Finding Fix Locations for CFL-Reachability Analyses via Minimum Cuts","author":"Dan Andrei Marian","unstructured":"Andrei Marian Dan , Manu Sridharan , Satish Chandra , Jean-Baptiste Jeannin , and Martin Vechev . 2017. Finding Fix Locations for CFL-Reachability Analyses via Minimum Cuts . In Computer Aided Verification, Rupak Majumdar and Viktor Kun\u010dak (Eds.). Springer International Publishing , Cham . 521\u2013541. isbn:978-3-319-63390-9 Andrei Marian Dan, Manu Sridharan, Satish Chandra, Jean-Baptiste Jeannin, and Martin Vechev. 2017. Finding Fix Locations for CFL-Reachability Analyses via Minimum Cuts. In Computer Aided Verification, Rupak Majumdar and Viktor Kun\u010dak (Eds.). Springer International Publishing, Cham. 521\u2013541. isbn:978-3-319-63390-9"},{"key":"e_1_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2635868.2635869"},{"key":"e_1_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1348250.1348255"},{"key":"e_1_2_2_7_1","volume-title":"Information Flow Analysis of Android Applications in DroidSafe. In 22nd Annual Network and Distributed System Security Symposium, NDSS 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 . The Internet Society. https:\/\/www.ndss-symposium.org\/ndss2015\/information-flow-analysis-android-applications-droidsafe 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. The Internet Society. https:\/\/www.ndss-symposium.org\/ndss2015\/information-flow-analysis-android-applications-droidsafe"},{"key":"e_1_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2837614.2837663"},{"key":"e_1_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3385412.3386016"},{"key":"e_1_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.2019.00027"},{"key":"e_1_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.2017.54"},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293607"},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3276510"},{"key":"e_1_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3428247"},{"key":"e_1_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133924"},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2491956.2462191"},{"key":"e_1_2_2_17_1","volume-title":"Khedker and Bageshri Karkare","author":"Uday","year":"2008","unstructured":"Uday P. Khedker and Bageshri Karkare . 2008 . Efficiency, Precision, Simplicity , and Generality in Interprocedural Data Flow Analysis: Resurrecting the Classical Call Strings Method. In Compiler Construction, Laurie Hendren (Ed.). Springer Berlin Heidelberg , Berlin, Heidelberg. 213\u2013228. isbn:978-3-540-78791-4 Uday P. Khedker and Bageshri Karkare. 2008. Efficiency, Precision, Simplicity, and Generality in Interprocedural Data Flow Analysis: Resurrecting the Classical Call Strings Method. In Compiler Construction, Laurie Hendren (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg. 213\u2013228. isbn:978-3-540-78791-4"},{"key":"e_1_2_2_18_1","volume-title":"Liveness-Based Pointer Analysis","author":"Khedker Uday P.","unstructured":"Uday P. Khedker , Alan Mycroft , and Prashant Singh Rawat . 2012. Liveness-Based Pointer Analysis . In Static Analysis, Antoine Min\u00e9 and David Schmidt (Eds.). Springer Berlin Heidelberg , Berlin, Heidelberg . 265\u2013282. isbn:978-3-642-33125-1 Uday P. Khedker, Alan Mycroft, and Prashant Singh Rawat. 2012. Liveness-Based Pointer Analysis. In Static Analysis, Antoine Min\u00e9 and David Schmidt (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg. 265\u2013282. isbn:978-3-642-33125-1"},{"key":"e_1_2_2_19_1","volume-title":"Context-Sensitive Points-to Analysis: Is It Worth It? In Compiler Construction","author":"Lhot\u00e1k Ond\u0159ej","unstructured":"Ond\u0159ej Lhot\u00e1k and Laurie Hendren . 2006. Context-Sensitive Points-to Analysis: Is It Worth It? In Compiler Construction , Alan Mycroft and Andreas Zeller (Eds.). Springer Berlin Heidelberg , Berlin, Heidelberg . 47\u201364. isbn:978-3-540-33051-6 Ond\u0159ej Lhot\u00e1k and Laurie Hendren. 2006. Context-Sensitive Points-to Analysis: Is It Worth It? In Compiler Construction, Alan Mycroft and Andreas Zeller (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg. 47\u201364. isbn:978-3-540-33051-6"},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1391984.1391987"},{"key":"e_1_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3276511"},{"key":"e_1_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3236024.3236041"},{"key":"e_1_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3381915"},{"key":"e_1_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1108792.1108797"},{"key":"e_1_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993498.1993567"},{"key":"e_1_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1926385.1926391"},{"key":"e_1_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3360574"},{"key":"e_1_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806596.1806631"},{"key":"e_1_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/566172.566174"},{"key":"e_1_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1044834.1044835"},{"key":"e_1_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1133981.1134018"},{"key":"e_1_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2594291.2594318"},{"key":"e_1_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2814270.2814309"},{"key":"e_1_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.5555\/1953048.2078195"},{"key":"e_1_2_2_35_1","volume-title":"Data-Driven Disjunctive Abstraction","author":"Peleg Hila","unstructured":"Hila Peleg , Sharon Shoham , and Eran Yahav . 2016. D^3 : Data-Driven Disjunctive Abstraction . In Verification, Model Checking, and Abstract Interpretation, Barbara Jobstmann and K. Rustan M. Leino (Eds.). Springer Berlin Heidelberg , Berlin, Heidelberg . 185\u2013205. isbn:978-3-662-49122-5 Hila Peleg, Sharon Shoham, and Eran Yahav. 2016. D^3: Data-Driven Disjunctive Abstraction. In Verification, Model Checking, and Abstract Interpretation, Barbara Jobstmann and K. Rustan M. Leino (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg. 185\u2013205. isbn:978-3-662-49122-5"},{"key":"e_1_2_2_36_1","volume-title":"Two approaches to interprocedural data flow analysis","author":"Sharir Micha","unstructured":"Micha Sharir and Amir Pnueli . 1981. Two approaches to interprocedural data flow analysis . Prentice-Hall , Englewood Cliffs, NJ . 189\u2013234. Micha Sharir and Amir Pnueli. 1981. Two approaches to interprocedural data flow analysis. Prentice-Hall, Englewood Cliffs, NJ. 189\u2013234."},{"key":"e_1_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/53990.54007"},{"key":"e_1_2_2_38_1","volume-title":"Fast Numerical Program Analysis with Reinforcement Learning","author":"Singh Gagandeep","unstructured":"Gagandeep Singh , Markus P\u00fcschel , and Martin Vechev . 2018. Fast Numerical Program Analysis with Reinforcement Learning . In Computer Aided Verification, Hana Chockler and Georg Weissenbacher (Eds.). Springer International Publishing , Cham . 211\u2013229. isbn:978-3-319-96145-3 Gagandeep Singh, Markus P\u00fcschel, and Martin Vechev. 2018. Fast Numerical Program Analysis with Reinforcement Learning. In Computer Aided Verification, Hana Chockler and Georg Weissenbacher (Eds.). Springer International Publishing, Cham. 211\u2013229. isbn:978-3-319-96145-3"},{"key":"e_1_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1561\/2500000014"},{"key":"e_1_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/1926385.1926390"},{"key":"e_1_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2594291.2594320"},{"key":"e_1_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ECOOP.2016.22"},{"key":"e_1_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/1133981.1134027"},{"key":"e_1_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31057-7_20"},{"key":"e_1_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/1094811.1094817"},{"key":"e_1_2_2_46_1","volume-title":"Making k-Object-Sensitive Pointer Analysis More Precise with Still k-Limiting","author":"Tan Tian","unstructured":"Tian Tan , Yue Li , and Jingling Xue . 2016. Making k-Object-Sensitive Pointer Analysis More Precise with Still k-Limiting . In Static Analysis, Xavier Rival (Ed.). Springer Berlin Heidelberg , Berlin, Heidelberg . 489\u2013510. isbn:978-3-662-53413-7 Tian Tan, Yue Li, and Jingling Xue. 2016. Making k-Object-Sensitive Pointer Analysis More Precise with Still k-Limiting. In Static Analysis, Xavier Rival (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg. 489\u2013510. isbn:978-3-662-53413-7"},{"key":"e_1_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/3062341.3062360"},{"key":"e_1_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/3302516.3307359"},{"key":"e_1_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/3062341.3062359"},{"key":"e_1_2_2_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/1542476.1542486"},{"key":"e_1_2_2_51_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ECOOP.2015.712"},{"key":"e_1_2_2_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/996841.996859"},{"key":"e_1_2_2_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390630.1390658"},{"key":"e_1_2_2_54_1","volume-title":"Scaling CFL-Reachability-Based Points-To Analysis Using Context-Sensitive Must-Not-Alias Analysis. In ECOOP 2009 \u2013 Object-Oriented Programming, Sophia Drossopoulou (Ed.). Springer Berlin Heidelberg","author":"Xu Guoqing","year":"2009","unstructured":"Guoqing Xu , Atanas Rountev , and Manu Sridharan . 2009 . Scaling CFL-Reachability-Based Points-To Analysis Using Context-Sensitive Must-Not-Alias Analysis. In ECOOP 2009 \u2013 Object-Oriented Programming, Sophia Drossopoulou (Ed.). Springer Berlin Heidelberg , Berlin, Heidelberg. 98\u2013122. isbn:978-3-642-03013-0 Guoqing Xu, Atanas Rountev, and Manu Sridharan. 2009. Scaling CFL-Reachability-Based Points-To Analysis Using Context-Sensitive Must-Not-Alias Analysis. In ECOOP 2009 \u2013 Object-Oriented Programming, Sophia Drossopoulou (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg. 98\u2013122. isbn:978-3-642-03013-0"},{"key":"e_1_2_2_55_1","volume-title":"VFix: Value-Flow-Guided Precise Program Repair for Null Pointer Dereferences. In 2019 IEEE\/ACM 41st International Conference on Software Engineering (ICSE). 512\u2013523","author":"Xu X.","unstructured":"X. Xu , Y. Sui , H. Yan , and J. Xue . 2019 . VFix: Value-Flow-Guided Precise Program Repair for Null Pointer Dereferences. In 2019 IEEE\/ACM 41st International Conference on Software Engineering (ICSE). 512\u2013523 . X. Xu, Y. Sui, H. Yan, and J. Xue. 2019. VFix: Value-Flow-Guided Precise Program Repair for Null Pointer Dereferences. In 2019 IEEE\/ACM 41st International Conference on Software Engineering (ICSE). 512\u2013523."},{"key":"e_1_2_2_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/2594291.2594327"}],"container-title":["Proceedings of the ACM on Programming Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3498720","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3498720","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:30:29Z","timestamp":1750188629000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3498720"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,12]]},"references-count":56,"journal-issue":{"issue":"POPL","published-print":{"date-parts":[[2022,1,16]]}},"alternative-id":["10.1145\/3498720"],"URL":"https:\/\/doi.org\/10.1145\/3498720","relation":{},"ISSN":["2475-1421"],"issn-type":[{"value":"2475-1421","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,1,12]]},"assertion":[{"value":"2022-01-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}