{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T16:23:31Z","timestamp":1781022211082,"version":"3.54.1"},"reference-count":41,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,12]]},"DOI":"10.1109\/bigdata.2018.8622426","type":"proceedings-article","created":{"date-parts":[[2019,1,25]],"date-time":"2019-01-25T03:07:18Z","timestamp":1548385638000},"page":"4016-4025","source":"Crossref","is-referenced-by-count":10,"title":["Automatic Hierarchical Clustering of Static Call Graphs for Program Comprehension"],"prefix":"10.1109","author":[{"given":"Gharib","family":"Gharibi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rakan","family":"Alanazi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yugyung","family":"Lee","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","article-title":"Hierarchical Abstraction of Execution Traces for Program Comprehension","author":"yang","year":"2018","journal-title":"ICPC &#x2019;18 ICPC &#x2019;18 26th IEEE\/ACM International Confernece on Program Comprehension"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/2963094"},{"key":"ref33","year":"2018","journal-title":"PyCallGraph"},{"key":"ref32","year":"2018","journal-title":"Pyang"},{"key":"ref31","year":"2018","journal-title":"Network"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.1996.493405"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/1401827.1401830"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.2001.919096"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/1083246.1083254"},{"key":"ref34","year":"2018","journal-title":"Python Parser"},{"key":"ref10","year":"2018","journal-title":"Construct_call_graph"},{"key":"ref40","article-title":"Value-Flow-Based Demand-Driven Pointer Analysis for C and C++","author":"yulei","year":"2018","journal-title":"IEEE Transactions on Software Engineering"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ICPC.2007.39"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/CSMR.2007.54"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2009.28"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICPC.2012.6240488"},{"key":"ref15","year":"2018","journal-title":"Detectron Project"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.4068"},{"key":"ref17","article-title":"Hierarchical Abstraction of Execution Traces for Program Comprehension","author":"feng","year":"2018","journal-title":"ICPC&#x2019;18 26th IEEE\/ACM International Confernece on Program Comprehension"},{"key":"ref18","year":"2018","journal-title":"Flask &#x2013; Python templates"},{"key":"ref19","article-title":"Gprof2Dot-Convert Profiling Output to a Dot Graph","author":"fonseca","year":"2014","journal-title":"Google Code"},{"key":"ref28","article-title":"Drawing graphs with dot","author":"koutsofios","year":"1991","journal-title":"Technical Report 910904-59113-08TM"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1109\/TSE.1979.234183","article-title":"Constructing the Call Graph of a Program","volume":"se 5","author":"barbara","year":"1979","journal-title":"IEEE Transactions on Software Engineering"},{"key":"ref27","year":"2018","journal-title":"Keras &#x2013; Python Library"},{"key":"ref3","year":"2018"},{"key":"ref6","year":"2018","journal-title":"Call Map"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-23716-4_22"},{"key":"ref5","doi-asserted-by":"crossref","DOI":"10.1145\/2968220.2968226","article-title":"The Dynamic Call Graph Matrix","volume":"16","author":"burch","year":"2016","journal-title":"Proc of the 9th International Symposium on Visual Information Communication and Interaction - VINCI"},{"key":"ref8","article-title":"SimSight: a virtual machine based dynamic call graph generator","author":"chen","year":"2010","journal-title":"thesis"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/WPC.2003.1199207"},{"key":"ref2","article-title":"Lightweight Call-Graph Construction for Multilingual Software Analysis","author":"anne marie","year":"2018"},{"key":"ref9","year":"2018","journal-title":"Code2Graph"},{"key":"ref1","first-page":"265","article-title":"Tensorflow: a system for large-scale machine learning","volume":"16","author":"abadi","year":"2016","journal-title":"OSDI"},{"key":"ref20","article-title":"A Method of Hierarchical Reconfiguration of Flow Chart Reversing from C Source Code","author":"fujun","year":"2018"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/3238147.3240484"},{"key":"ref21","article-title":"Drawing graphs with Graphviz","author":"gansner","year":"2009","journal-title":"Technical report AT&T Bell Laboratories Murray Tech Rep Tech Rep"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/CSMR.2005.46"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/CSMR.2004.1281435"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/0001-6918(91)90009-O"},{"key":"ref26","first-page":"133","article-title":"Using tf-idf to determine word relevance in document queries","volume":"242","author":"juan","year":"2003","journal-title":"Proceedings of the First Instructional Conference on Machine Learning"},{"key":"ref25","author":"jain","year":"1998","journal-title":"Algorithms for clusering data"}],"event":{"name":"2018 IEEE International Conference on Big Data (Big Data)","location":"Seattle, WA, USA","start":{"date-parts":[[2018,12,10]]},"end":{"date-parts":[[2018,12,13]]}},"container-title":["2018 IEEE International Conference on Big Data (Big Data)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8610059\/8621858\/08622426.pdf?arnumber=8622426","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T23:12:09Z","timestamp":1643238729000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8622426\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12]]},"references-count":41,"URL":"https:\/\/doi.org\/10.1109\/bigdata.2018.8622426","relation":{},"subject":[],"published":{"date-parts":[[2018,12]]}}}