DC Field | Value | Language |
---|---|---|
dc.contributor.author | Ahn, Shin-Young | - |
dc.contributor.author | Kang, Sungwon | - |
dc.contributor.author | Baik, Jong-Moon | - |
dc.contributor.author | Choi, Ho-Jin | - |
dc.date.accessioned | 2010-04-08T08:02:53Z | - |
dc.date.available | 2010-04-08T08:02:53Z | - |
dc.date.issued | 2009 | - |
dc.identifier.citation | 10th ACIS International Conference on Software Engineering, Artificial Intelligences, Networking and Parallel/Distributed Computing | en |
dc.identifier.isbn | 978-0-7695-3642-2 | - |
dc.identifier.uri | http://hdl.handle.net/10203/17588 | - |
dc.description.abstract | 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]. | en |
dc.language.iso | en_US | en |
dc.publisher | IEEE | en |
dc.subject | Software Understanding | en |
dc.subject | Open Source | en |
dc.subject | Requirement | en |
dc.subject | Feature | en |
dc.subject | Recovering Traceability | en |
dc.title | A Weighted Call Graph Approachfor Finding Relevant Components in Source Code | en |
dc.type | Article | en |
dc.identifier.doi | 10.1109/SNPD.2009.86 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.