{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:18:10Z","timestamp":1750220290352,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":44,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,4,25]],"date-time":"2022-04-25T00:00:00Z","timestamp":1650844800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,4,25]]},"DOI":"10.1145\/3477314.3507126","type":"proceedings-article","created":{"date-parts":[[2022,5,7]],"date-time":"2022-05-07T00:37:36Z","timestamp":1651883856000},"page":"1837-1844","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["A lightweight approach for sound call graph approximation"],"prefix":"10.1145","author":[{"given":"Aharon","family":"Abadi","sequence":"first","affiliation":[{"name":"WhiteSource, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bar","family":"Makovitzki","sequence":"additional","affiliation":[{"name":"The Open University of Israel, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ron","family":"Shemer","sequence":"additional","affiliation":[{"name":"WhiteSource, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shmuel","family":"Tyszberowicz","sequence":"additional","affiliation":[{"name":"Afeka Academic College of Engineering, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,5,6]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Tyszberowicz","author":"Abadi Aharon","year":"2021","unstructured":"Aharon Abadi, Bar Makovitzki, Ron Shemer, and Shmuel S. Tyszberowicz. 2021. NoCFG: A Lightweight Approach for Sound Call Graph Approximation. CoRR abs\/2105.03099 (2021)."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Ole Agesen. 1994. Constraint-Based Type Inference and Parametric Polymorphism. In SAS. 78--100.","DOI":"10.1007\/3-540-58485-4_34"},{"key":"e_1_3_2_1_3_1","volume-title":"Ullman","author":"Aho Alfred V.","year":"1986","unstructured":"Alfred V. Aho, Ravi Sethi, and Jeffrey D. Ullman. 1986. Compilers: Principles, Techniques, and Tools. Addison-Wesley."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Karim Ali and Ondrej Lhot\u00e1k. 2012. Application-Only Call Graph Construction See [30] 688--712.","DOI":"10.1007\/978-3-642-31057-7_30"},{"key":"e_1_3_2_1_5_1","unstructured":"Lars Ole Andersen. 1992. Self-applicable C Program Specialization. In PEPM. 54--61."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/236338.236371"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/32.54302"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-24559-6_34"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/512950.512973"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-49538-X_5"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Greg DeFouw David Grove and Craig Chambers. 1998. Fast Interprocedural Class Analysis. In POPL. ACM 222--236.","DOI":"10.1145\/268946.268965"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"Asger Feldthaus Todd D. Millstein Anders M\u00f8ller Max Sch\u00e4fer and Frank Tip. 2011. Tool-supported refactoring for JavaScript. In OOPSLA. ACM 119--138.","DOI":"10.1145\/2048066.2048078"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"Asger Feldthaus and Anders M\u00f8ller. 2013. Semi-automatic rename refactoring for JavaScript. In OOPSLA. ACM 323--338.","DOI":"10.1145\/2509136.2509520"},{"volume-title":"Efficient construction of approximate call graphs for JavaScript IDE services","author":"Feldthaus Asger","key":"e_1_3_2_1_14_1","unstructured":"Asger Feldthaus, Max Sch\u00e4fer, Manu Sridharan, Julian Dolby, and Frank Tip. 2013. Efficient construction of approximate call graphs for JavaScript IDE services. In ICSE. IEEE, 752--761."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Diego Garbervetsky Edgardo Zoppi and Benjamin Livshits. 2017. Toward full elasticity in distributed static analysis: the case of callgraph analysis. In ESEC\/FSE. ACM 442--453.","DOI":"10.1145\/3106237.3106261"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"Gharib Gharibi Rashmi Tripathi and Yugyung Lee. 2018. Code2graph: automatic generation of static call graphs for Python source code. In ASE. ACM 880--883.","DOI":"10.1145\/3238147.3240484"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"David Grove Greg DeFouw Jeffrey Dean and Craig Chambers. 1997. Call Graph Construction in Object-oriented Languages. In OOPSLA. ACM 108--124.","DOI":"10.1145\/263698.264352"},{"volume-title":"Modern Compiler Design","author":"Grune Dick","key":"e_1_3_2_1_18_1","unstructured":"Dick Grune, Henri E. Bal, Ceriel J. H. Jacobs, and Koen Langendoen. 2002. Modern Compiler Design. Wiley."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"Nevin Heintze. 1994. Set-Based Analysis of ML Programs. In LISP and Functional Programming. 306--317.","DOI":"10.1145\/182590.182495"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","unstructured":"Michael Hind and Anthony Pioli. 2000. Which pointer analysis should I use?. In ISSTA. ACM 113--123.","DOI":"10.1145\/347324.348916"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6423(00)00014-9"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"Kazuaki Ishizaki et al. 2000. A study of devirtualization techniques for a Java Just-In-Time compiler See [36] 294--310.","DOI":"10.1145\/353171.353191"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1529282.1529711"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"crossref","unstructured":"Simon Holm Jensen Peter A. Jonsson and Anders M\u00f8ller. 2012. Remedying the eval that men do. In ISSTA. ACM 34--44.","DOI":"10.1145\/2338965.2336758"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03237-0_17"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16612-9_23"},{"key":"e_1_3_2_1_27_1","first-page":"35","article-title":"The Soot framework for Java program analysis: a retrospective","volume":"15","author":"Lam Patrick","year":"2011","unstructured":"Patrick Lam, Eric Bodden, Ondrej Lhot\u00e1k, and Laurie Hendren. 2011. The Soot framework for Java program analysis: a retrospective. In CETUS, Vol. 15. 35.","journal-title":"CETUS"},{"key":"e_1_3_2_1_28_1","first-page":"707","article-title":"Binary codes capable of correcting deletions, insertions, and reversals","volume":"10","author":"Levenshtein Vladimir I","year":"1966","unstructured":"Vladimir I Levenshtein. 1966. Binary codes capable of correcting deletions, insertions, and reversals. Soviet Physics Doklady 10, 8 (1966), 707--710.","journal-title":"Soviet Physics Doklady"},{"volume-title":"Empirical Study of Python Call Graph","author":"Yu Li.","key":"e_1_3_2_1_29_1","unstructured":"Yu Li. 2019. Empirical Study of Python Call Graph. In ASE. IEEE Press, 1274--1276."},{"key":"e_1_3_2_1_30_1","volume-title":"LNCS","volume":"7313","author":"Ed James Noble","year":"2012","unstructured":"James Noble (Ed.). 2012. ECOOP. LNCS, Vol. 7313. Springer."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/2.660187"},{"key":"e_1_3_2_1_32_1","volume-title":"Schwartzbach","author":"Palsberg Jens","year":"1991","unstructured":"Jens Palsberg and Michael I. Schwartzbach. 1991. Object-Oriented Type Inference. (1991), 146--161."},{"key":"e_1_3_2_1_33_1","volume-title":"Schwartzbach","author":"Palsberg Jens","year":"1994","unstructured":"Jens Palsberg and Michael I. Schwartzbach. 1994. Object-oriented type systems. Wiley."},{"key":"e_1_3_2_1_34_1","volume-title":"Serena Elisa Ponta, and Antonino Sabetta","author":"Plate Henrik","year":"2015","unstructured":"Henrik Plate, Serena Elisa Ponta, and Antonino Sabetta. 2015. Impact assessment for vulnerabilities in open-source software libraries. In ICSME. IEEE Computer Society, 411--420."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"crossref","unstructured":"Michael Reif Michael Eichberg Ben Hermann Johannes Lerch and Mira Mezini. 2016. Call graph construction for Java libraries. In FSE. ACM 474--486.","DOI":"10.1145\/2950290.2950312"},{"key":"e_1_3_2_1_36_1","unstructured":"Mary Beth Rosson and Doug Lea (Eds.). 2000. OOPSLA. ACM."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1979.234183"},{"volume-title":"PyCG: Practical Call Graph Generation in Python","author":"Salis Vitalis","key":"e_1_3_2_1_38_1","unstructured":"Vitalis Salis, Thodoris Sotiropoulos, Panos Louridas, Diomidis Spinellis, and Dimitris Mitropoulos. 2021. PyCG: Practical Call Graph Generation in Python. In ICSE. IEEE, 1646--1657."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"crossref","unstructured":"Olin Shivers. 1991. The semantics of Scheme control-flow analysis. In PEPM. 190--198.","DOI":"10.1145\/115865.115884"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"crossref","unstructured":"Manu Sridharan Julian Dolby Satish Chandra Max Sch\u00e4fer and Frank Tip. 2012. Correlation Tracking for Points-To Analysis of JavaScript See [30] 435--458.","DOI":"10.1007\/978-3-642-31057-7_20"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/161494.161517"},{"volume-title":"Points-to Analysis in Almost Linear Time","author":"Steensgaard Bjarne","key":"e_1_3_2_1_44_1","unstructured":"Bjarne Steensgaard. 1996. Points-to Analysis in Almost Linear Time. In POPL. ACM Press, 32--41."},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"crossref","unstructured":"Vijay Sundaresan Laurie J. Hendren Chrislain Razafimahefa Raja Vall\u00e9e-Rai Patrick Lam Etienne Gagnon and Charles Godin. 2000. Practical virtual method call resolution for Java See [36] 264--280.","DOI":"10.1145\/353171.353189"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"crossref","unstructured":"Frank Tip and Jens Palsberg. 2000. Scalable propagation-based call graph construction algorithms See [36] 281--293.","DOI":"10.1145\/354222.353190"}],"event":{"name":"SAC '22: The 37th ACM\/SIGAPP Symposium on Applied Computing","sponsor":["SIGAPP ACM Special Interest Group on Applied Computing"],"location":"Virtual Event","acronym":"SAC '22"},"container-title":["Proceedings of the 37th ACM\/SIGAPP Symposium on Applied Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3477314.3507126","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3477314.3507126","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:31:29Z","timestamp":1750188689000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3477314.3507126"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,25]]},"references-count":44,"alternative-id":["10.1145\/3477314.3507126","10.1145\/3477314"],"URL":"https:\/\/doi.org\/10.1145\/3477314.3507126","relation":{},"subject":[],"published":{"date-parts":[[2022,4,25]]},"assertion":[{"value":"2022-05-06","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}