{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,8]],"date-time":"2026-03-08T02:50:51Z","timestamp":1772938251468,"version":"3.50.1"},"reference-count":60,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100004895","name":"European Union Project within the framework of the Artificial Intelligence National Laboratory","doi-asserted-by":"publisher","award":["RRF-2.3.1-21-2022-00004"],"award-info":[{"award-number":["RRF-2.3.1-21-2022-00004"]}],"id":[{"id":"10.13039\/501100004895","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Ministry of Innovation and Technology of Hungary from the National Research, Development and Innovation Fund, financed under the TKP2021-NVA Funding Scheme","award":["TKP2021-NVA-09"],"award-info":[{"award-number":["TKP2021-NVA-09"]}]},{"name":"University of Szeged Open Access","award":["5913"],"award-info":[{"award-number":["5913"]}]},{"name":"Bolyai J\u00e1nos Scholarship of the Hungarian Academy of Sciences"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2023]]},"DOI":"10.1109\/access.2023.3255984","type":"journal-article","created":{"date-parts":[[2023,3,10]],"date-time":"2023-03-10T18:28:37Z","timestamp":1678472917000},"page":"25266-25284","source":"Crossref","is-referenced-by-count":7,"title":["Is JavaScript Call Graph Extraction Solved Yet? A Comparative Study of Static and Dynamic Tools"],"prefix":"10.1109","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3002-8624","authenticated-orcid":false,"given":"G\u00e1bor","family":"Antal","sequence":"first","affiliation":[{"name":"Department of Software Engineering, University of Szeged, Szeged, Hungary"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4592-6504","authenticated-orcid":false,"given":"P\u00e9ter","family":"Heged\u0171s","sequence":"additional","affiliation":[{"name":"Department of Software Engineering, University of Szeged, Szeged, Hungary"}]},{"given":"Zolt\u00e1n","family":"Herczeg","sequence":"additional","affiliation":[{"name":"Department of Software Engineering, University of Szeged, Szeged, Hungary"}]},{"given":"G\u00e1bor","family":"L\u00f3ki","sequence":"additional","affiliation":[{"name":"Department of Software Engineering, University of Szeged, Szeged, Hungary"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8897-7403","authenticated-orcid":false,"given":"Rudolf","family":"Ferenc","sequence":"additional","affiliation":[{"name":"Department of Software Engineering, University of Szeged, Szeged, Hungary"}]}],"member":"263","reference":[{"key":"ref1","volume-title":"ACG","year":"2022"},{"key":"ref2","volume-title":"Build Approximate Call Graphs for JavaScript","year":"2022"},{"key":"ref3","volume-title":"Code2Flow: Pretty Good Call Graphs for Dynamic Languages","year":"2022"},{"key":"ref4","volume-title":"Google Colsure Compiler","year":"2022"},{"key":"ref5","volume-title":"GraalVM JavaScript: A High Performance Implementation of the JavaScript Programming Language","year":"2022"},{"key":"ref6","volume-title":"IBM WALA","year":"2022"},{"key":"ref7","volume-title":"The JavaScript Explorer Callgraph Tool","year":"2022"},{"key":"ref8","volume-title":"NodeJS Callgraph","year":"2022"},{"key":"ref9","volume-title":"NodeProf","year":"2022"},{"key":"ref10","volume-title":"NPM Callgraph","year":"2022"},{"key":"ref11","volume-title":"Partial List of Publications That Rely on the WALA Infrastructure\u2014WalaWiki","year":"2022"},{"key":"ref12","volume-title":"Rhino is an Open-Source Implementation of JavaScript Written Entirely in Java","year":"2022"},{"key":"ref13","volume-title":"SunSpider 1.0.2 Benchmark","year":"2022"},{"key":"ref14","volume-title":"TAJS (Type Analyzer for JavaScript)","year":"2022"},{"key":"ref15","volume-title":"The State of the Octoverse","year":"2022"},{"key":"ref16","volume-title":"V8 JavaScript Engine","year":"2022"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.aml.2007.01.006"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.5220\/0005209202710278"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-014-0365-y"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31057-7_30"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/SCAM.2018.00028"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.3390\/technologies9010003"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-15-293"},{"key":"ref24","volume-title":"UglifyJS: JavaScript Parser\/Mangler\/Compressor\/Beautifier Toolkit","author":"Bazon","year":"2022"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.2012.6227173"},{"key":"ref26","volume-title":"Closure: The Definitive Guide: Google Tools to Add Power to Your JavaScript","author":"Bolin","year":"2010"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.pmcj.2017.02.001"},{"key":"ref28","article-title":"Evaluation of static JavaScript call graph algorithms","author":"Dijkstra","year":"2014"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/974043.974067"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87479-9_40"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15585-7_7"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ICSM.2001.972777"},{"key":"ref33","first-page":"398","article-title":"Interprocedural data flow analysis","volume-title":"Information Processing","author":"Allen","year":"1974"},{"key":"ref34","volume-title":"FaceBook: Flow: A Static Type Checker for JavaScript","year":"2022"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/2076021.2048078"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.2013.6606621"},{"key":"ref37","volume-title":"WALA\u2014The TJ Watson Libraries for Analysis","author":"Fink","year":"2022"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/872726.806987"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.5220\/0007752904720479"},{"key":"ref40","first-page":"286","article-title":"Towards the efficient use of dynamic call graph generators of node.js applications","volume-title":"Proc. Int. Conf. Eval. Novel Approaches Softw. Eng.","author":"Herczeg"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775126"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03237-0_17"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/2635868.2635904"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/s11416-011-0151-y"},{"key":"ref45","first-page":"96","article-title":"SAFE: Formal specification and implementation of a scalable analysis framework for ECMAScript","volume-title":"Proc. 19th Int. Workshop Found. Object-Oriented Lang.","author":"Lee"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1145\/1251535.1251542"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1145\/2491411.2491417"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1002\/stvr.1640"},{"key":"ref49","author":"Miller","year":"2009","journal-title":"Levenshtein Distance: Information Theory, Computer Science, String (Computer Science), String Metric, Damerau? Levenshtein Distance, Spell Checker, Hamming Distance"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/ICST.2013.23"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1145\/279310.279314"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1145\/3460319.3464836"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.2015.51"},{"key":"ref54","volume-title":"Debugging from a call graph","author":"Rao","year":"2009"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1145\/3324884.3418931"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/icse43902.2021.00146"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.2003.1201189"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1145\/3178372.3179527"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1145\/2483760.2483788"},{"key":"ref60","article-title":"An empirical study of Java dynamic call graph extractors","author":"Xie","year":"2002"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/10005208\/10066273.pdf?arnumber=10066273","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,14]],"date-time":"2024-03-14T05:41:45Z","timestamp":1710394905000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10066273\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"references-count":60,"URL":"https:\/\/doi.org\/10.1109\/access.2023.3255984","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]}}}