A Weighted Call Graph Approach for Finding Relevant Components in Source Code

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 348
  • Download : 362
To reuse open source code it is necessary to understand how the software is implemented and how the software architecture is designed. However, it is not an easy task because open source typically does not have the design document which maps features to source code components. In this paper, we propose a method to find the components relevant to a feature in open source code. Our solution is a static approach to recover the relationship between the software manual and the source code and it is based on information retrieval technique. In our approach, we build and analyze a weighted call graph using the similarity values obtained from the vector space information retrieval. Experimental application shows that our method is more robust and is less influenced by cut level than the method of Zhao et al.[3].
Publisher
IEEE
Issue Date
2009
Keywords

Open Source; Requirement; Feature; Recovering Traceability; Software Understanding

Citation

10th ACIS International Conference on Software Engineering, pp.539-544

URI
http://hdl.handle.net/10203/18782
Appears in Collection
CS-Conference Papers(학술회의논문)
Files in This Item
A Weighted Call Graph Approach for Finding Relevant Components in Source Code.pdf(504.44 kB)Download

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0