ETRI-Knowledge Sharing Plaform

ENGLISH

성과물

논문 검색
구분 SCI
연도 ~ 키워드

상세정보

학술대회 A Weighted Call Graph Approach for Finding Relevant Components in Source Code
Cited 3 time in scopus Download 0 time Share share facebook twitter linkedin kakaostory
저자
안신영, 강성원, 백종문, 최호진
발행일
200905
출처
ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD) 2009, pp.539-544
DOI
https://dx.doi.org/10.1109/SNPD.2009.86
초록
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]. © 2009 IEEE.
키워드
Feature, Open source, Recovering traceability, Requirement, Software understanding
KSP 제안 키워드
Call Graph, Design document, Graph approach, Information retrieval(IR), Open source code, Relevant components, similarity values, software architecture, vector space