Abstract

Abtract-The recovery of requirements traceability links assists multiple software development activities, including analyzing impact of changes, validating requirements, maintenance and evolution of software. Poor communication and time pressure problems often have resulted in organizations being unsuccessful in implementing traceability practices. A number of solutions for automatic recovery of links across software artifacts have been developed, including the application of textual analysis and information retrieval techniques. Link recovery with information retrieval has seen some success, but there is a need for methods that further enable the automatic generation of links. We investigate the requirements traceability recovery problem as an optimization problem; we study it as a multi-objective search in which we assign one-to-many relationships between each requirement to a code element by considering the semantic similarity between the textual content of requirements and the source code. We adapt the Non-dominated Sorting Genetic Algorithm, NSGA-II, to seek the optimal solution between two objective functions based on textual similarity using the similarity measures of Jaccard similarity and term frequency (TF-idf) combined with cosine similarity. Our IR-based NSGA-II returned values on average above 75% for both precision and recall for the recovered links. High precision and recall are positive results for our approach to requirements traceability recovery.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.