A Weighted Call Graph Approachfor Finding Relevant Components in Source Code

Cited 0 time in webofscience Cited 3 time in scopus
  • Hit : 617
  • Download : 712
DC FieldValueLanguage
dc.contributor.authorAhn, Shin-Young-
dc.contributor.authorKang, Sungwon-
dc.contributor.authorBaik, Jong-Moon-
dc.contributor.authorChoi, Ho-Jin-
dc.date.accessioned2010-04-08T08:02:53Z-
dc.date.available2010-04-08T08:02:53Z-
dc.date.issued2009-
dc.identifier.citation10th ACIS International Conference on Software Engineering, Artificial Intelligences, Networking and Parallel/Distributed Computingen
dc.identifier.isbn978-0-7695-3642-2-
dc.identifier.urihttp://hdl.handle.net/10203/17588-
dc.description.abstractTo 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.isoen_USen
dc.publisherIEEEen
dc.subjectSoftware Understandingen
dc.subjectOpen Sourceen
dc.subjectRequirementen
dc.subjectFeatureen
dc.subjectRecovering Traceabilityen
dc.titleA Weighted Call Graph Approachfor Finding Relevant Components in Source Codeen
dc.typeArticleen
dc.identifier.doi10.1109/SNPD.2009.86-

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0