Please use this identifier to cite or link to this item:
http://repository.iiitd.edu.in/xmlui/handle/123456789/118| Title: | SANAYOJAN : a framework for traceability link recovery between use-cases in software requirement specification and regulatory documents |
| Authors: | Jain, Ritika Sureka, Ashish (Advisor) |
| Keywords: | Mining Software Repositories Requirements Engineering Traceability Link Recovery Text Mining Natural Language Processing Regulatory Compliance |
| Issue Date: | 19-Feb-2014 |
| Abstract: | User requirement speci cation (URS) documents written in the form of free-form natural lan- guage text contain system use-case descriptions as one of the elements in the URS. For few application domains, some of the system use-cases in URS de ne services and functionality which needs to comply with regulations pertaining to the application domain. In this paper, we present a multi-step approach to automatically extract system use-cases from URS and construct traceability links between system-uses and appropriate regulations in the regulatory documents. We de ne lexicon-based, syntactic and semantic features to discriminate system use-cases from other elements in the URS. We investigate the application of ve semantic similarity methods implemented in the SEMILAR semantic similarity toolkit to compute similarity between a given system use-case with regulations in a regulatory document. We conduct a series of experiments on real-world data obtained from software projects of a large global Information Technology (IT) services company to validate the proposed approach. Experimental results demonstrate e ec- tiveness (accuracy of 83:3% for system use-case extraction and 72% for constructing traceability links) and limitations of the proposed approach. |
| URI: | https://repository.iiitd.edu.in/jspui/handle/123456789/118 |
| Appears in Collections: | Year-2014 |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| MT12047.pdf | 1.09 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.