Bibliographic Details
| Title: |
Topology structure and centrality in a java source code. |
| Authors: |
Ying, Long, Ding, De-wu |
| Source: |
2012 IEEE International Conference on Granular Computing; 1/ 1/2012, p787-789, 3p |
| Abstract: |
Call graph plays a very important role in program analysis, and it has been widely used in software engineering (e.g., program understanding, compiling optimization, regression test, etc). In the present paper, we studied the source code structure of a Java program from a call graph perspective. We check the basal network properties of the call graph. By comparing several familiar centrality measures (betweenness, closeness, eccentricity, HITS-Authority and PageRank) and applying them to the call graph, we also give the centrality analysis of the call graph. [ABSTRACT FROM PUBLISHER] |
|
Copyright of 2012 IEEE International Conference on Granular Computing is the property of IEEE and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Complementary Index |
Full Text Finder