Harman, M;
Krinke, J;
Medina-Bulo, I;
Palomo-Lozano, F;
Ren, J;
Yoo, S;
(2014)
Exact Scalable Sensitivity Analysis for the Next Release Problem.
ACM TRANSACTIONS ON SOFTWARE ENGINEERING AND METHODOLOGY
, 23
(2)
, Article ARTN 19. 10.1145/2537853.
![[thumbnail of a19-harman.pdf]](https://discovery.ucl.ac.uk/style/images/fileicons/application_pdf.png) Preview |
PDF
a19-harman.pdf Download (16MB) |
Abstract
The nature of the requirements analysis problem, based as it is on uncertain and often inaccurate estimates of costs and effort, makes sensitivity analysis important. Sensitivity analysis allows the decision maker to identify those requirements and budgets that are particularly sensitive to misestimation. However, finding scalable sensitivity analysis techniques is not easy because the underlying optimization problem is NP-hard. This article introduces an approach to sensitivity analysis based on exact optimization. We implemented this approach as a tool, OATSAC, which allowed us to experimentally evaluate the scalability and applicability of Requirements Sensitivity Analysis (RSA). Our results show that OATSAC scales sufficiently well for practical applications in Requirements Sensitivity Analysis. We also show how the sensitivity analysis can yield insights into difficult and otherwise obscure interactions between budgets, requirements costs, and estimate inaccuracies using a real-world case study.
| Type: | Article |
|---|---|
| Title: | Exact Scalable Sensitivity Analysis for the Next Release Problem |
| Open access status: | An open access version is available from UCL Discovery |
| DOI: | 10.1145/2537853 |
| Publisher version: | http://dx.doi.org/10.1145/2537853 |
| Language: | English |
| Additional information: | Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the owner/author(s). Copyright is held by the author/owner(s). |
| Keywords: | Algorithms, Next release problem, sensitivity analysis, requirement engineering |
| UCL classification: | UCL UCL > Provost and Vice Provost Offices > UCL BEAMS UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science > Dept of Computer Science |
| URI: | https://discovery.ucl.ac.uk/id/eprint/1428945 |
Archive Staff Only
 |
View Item |
