{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,12]],"date-time":"2026-09-12T01:35:44Z","timestamp":1789176944631,"version":"build-2803163510"},"publisher-location":"New York, NY, USA","reference-count":50,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,5,21]],"date-time":"2022-05-21T00:00:00Z","timestamp":1653091200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"ONR","award":["N00014-18-1-2037"],"award-info":[{"award-number":["N00014-18-1-2037"]}]},{"name":"NSF","award":["1823360"],"award-info":[{"award-number":["1823360"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,5,21]]},"DOI":"10.1145\/3510003.3510166","type":"proceedings-article","created":{"date-parts":[[2022,7,5]],"date-time":"2022-07-05T22:42:59Z","timestamp":1657060979000},"page":"2043-2055","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":23,"title":["Striking a balance"],"prefix":"10.1145","author":[{"given":"Akshay","family":"Utture","sequence":"first","affiliation":[{"name":"University of California"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shuyang","family":"Liu","sequence":"additional","affiliation":[{"name":"University of California"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christian Gram","family":"Kalhauge","sequence":"additional","affiliation":[{"name":"DTU, Denmark"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jens","family":"Palsberg","sequence":"additional","affiliation":[{"name":"University of California"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2022,7,5]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Application-Only Call Graph Construction. In ECOOP 2012 - Object-Oriented Programming, James Noble (Ed.). Springer Berlin Heidelberg","author":"Ali Karim","year":"2012","unstructured":"Karim Ali and Ond\u0159ej Lhot\u00e1k. 2012. Application-Only Call Graph Construction. In ECOOP 2012 - Object-Oriented Programming, James Noble (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg, 688--712."},{"key":"e_1_3_2_1_2_1","volume-title":"6th International Conference on Learning Representations, ICLR","author":"Allamanis Miltiadis","year":"2018","unstructured":"Miltiadis Allamanis, Marc Brockschmidt, and Mahmoud Khademi. 2018. Learning to Represent Programs with Graphs. In 6th International Conference on Learning Representations, ICLR 2018, Vancouver, BC, Canada, April 30 - May 3, 2018, Conference Track Proceedings. OpenReview.net. https:\/\/openreview.net\/forum?id=BJOFETxR-"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1321631.1321649"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3338906.3338919"},{"key":"e_1_3_2_1_5_1","first-page":"1","article-title":"Random Search for Hyper-parameter Optimization","volume":"13","author":"Bergstra James","year":"2012","unstructured":"James Bergstra and Yoshua Bengio. 2012. Random Search for Hyper-parameter Optimization. J. Mach. Learn. Res. 13, 1 (Feb. 2012), 281--305. http:\/\/dl.acm.org\/citation.cfm?id=2503308.2188395","journal-title":"J. Mach. Learn. Res."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1646353.1646374"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2491956.2462186"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2814270.2814293"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1640089.1640108"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00058655"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.2009.5070516"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.infsof.2018.07.002"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3468264.3468626"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2970276.2970347"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3194095.3194100"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3213846.3213860"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939754"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICST.2009.45"},{"key":"e_1_3_2_1_19_1","volume-title":"Proceedings of the Third International Conference on Document Analysis and Recognition (Volume 1) -","volume":"1","author":"Ho Tin Kam","year":"1995","unstructured":"Tin Kam Ho. 1995. Random Decision Forests. In Proceedings of the Third International Conference on Document Analysis and Recognition (Volume 1) - Volume 1 (ICDAR '95). IEEE Computer Society, USA, 278."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1052883.1052895"},{"key":"e_1_3_2_1_21_1","volume-title":"Formal Methods for Open Object-Based Distributed Systems, Gilles Barthe and Frank S","author":"Hubert Laurent","unstructured":"Laurent Hubert, Thomas Jensen, and David Pichardie. 2008. Semantic Foundations and Inference of Non-null Annotations. In Formal Methods for Open Object-Based Distributed Systems, Gilles Barthe and Frank S. de Boer (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 132--149."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/353171.353191"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3428247"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133924"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.2013.6606613"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3276516"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/1765871.1765924"},{"key":"e_1_3_2_1_28_1","volume-title":"Proceedings of the 2007 Conference on Emerging Artificial Intelligence Applications in Computer Engineering. IOS Press, NLD, 3--24","author":"Kotsiantis S. B.","year":"2007","unstructured":"S. B. Kotsiantis. 2007. Supervised Machine Learning: A Review of Classification Techniques. In Proceedings of the 2007 Conference on Emerging Artificial Intelligence Applications in Computer Engineering. IOS Press, NLD, 3--24."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1251535.1251542"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3236024.3236041"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2644805"},{"key":"e_1_3_2_1_32_1","volume-title":"Probabilistic call-graph construction. (Jul","author":"Lu Yi","year":"2020","unstructured":"Yi Lu, Daniel Wainwright, and Michael Reif. 2020. Probabilistic call-graph construction. (Jul 2020). US Patent No. 10,719,314 B2."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2786805.2786851"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/3382494.3410675"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3236454.3236501"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.5555\/1953048.2078195"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/3296979.3192417"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007512.1007514"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1368088.1368135"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/3188720"},{"key":"e_1_3_2_1_41_1","volume-title":"2011 IEEE 11th International Working Conference on Source Code Analysis and Manipulation. 35--44","author":"Sawin J.","unstructured":"J. Sawin and A. Rountev. 2011. Assumption Hierarchy for a CHA Call Graph Construction Algorithm. In 2011 IEEE 11th International Working Conference on Source Code Analysis and Manipulation. 35--44."},{"key":"e_1_3_2_1_42_1","unstructured":"Scikit-learn. [n.d.]. Feature importances with a forest of trees. https:\/\/scikitlearn.org\/stable\/auto_examples\/ensemble\/plot_forest_importances.html."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/3377811.3380441"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/2660267.2660339"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.5281\/zenodo.4839913"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.5281\/zenodo.5177161"},{"key":"e_1_3_2_1_47_1","unstructured":"WALA. 2015. IBM \"T.J. Watson Libraries for Analysis (WALA) \". http:\/\/wala.sourceforge.net."},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/3428205"},{"key":"e_1_3_2_1_49_1","volume-title":"Automated Classification of Static Code Analysis Alerts: A Case Study. In 2013 IEEE International Conference on Software Maintenance. 532--535","author":"Y\u00fcksel U.","unstructured":"U. Y\u00fcksel and H. S\u00f6zer. 2013. Automated Classification of Static Code Analysis Alerts: A Case Study. In 2013 IEEE International Conference on Software Maintenance. 532--535."},{"key":"e_1_3_2_1_50_1","first-page":"4","article-title":"Automatic Construction of Accurate Application Call Graph with Library Call Abstraction for Java","volume":"19","author":"Zhang Weilei","year":"2007","unstructured":"Weilei Zhang and Barbara G. Ryder. 2007. Automatic Construction of Accurate Application Call Graph with Library Call Abstraction for Java: Research Articles. J. Softw. Maint. Evol. 19, 4 (July 2007), 231--252.","journal-title":"Research Articles. J. Softw. Maint. Evol."}],"event":{"name":"ICSE '22: 44th International Conference on Software Engineering","location":"Pittsburgh Pennsylvania","acronym":"ICSE '22","sponsor":["SIGSOFT ACM Special Interest Group on Software Engineering","IEEE CS"]},"container-title":["Proceedings of the 44th International Conference on Software Engineering"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3510003.3510166","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3510003.3510166","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3510003.3510166","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:10:25Z","timestamp":1750183825000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3510003.3510166"}},"subtitle":["pruning false-positives from static call graphs"],"short-title":[],"issued":{"date-parts":[[2022,5,21]]},"references-count":50,"alternative-id":["10.1145\/3510003.3510166","10.1145\/3510003"],"URL":"https:\/\/doi.org\/10.1145\/3510003.3510166","relation":{},"subject":[],"published":{"date-parts":[[2022,5,21]]},"assertion":[{"value":"2022-07-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}