Improving Software Requirements Prioritization through the Lens of Constraint Solving

• URL: http://arxiv.org/abs/2306.12391v1
• Date: Wed, 21 Jun 2023 17:24:24 GMT
• Title: Improving Software Requirements Prioritization through the Lens of Constraint Solving
• Authors: Jonathan Winton and Francis Palma
• Abstract summary: This paper presents an interactive method to requirements prioritization that leverages the pairwise comparisons and a constraint solver. We evaluate the proposed method using the requirements from a real healthcare project.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Requirements prioritization is a critical activity during the early software development process, which produces a set of key requirements to implement. The prioritization process offers a parity among the requirements based on multiple characteristics, including end-users' preferences, cost to implement, and technical dependencies. This paper presents an interactive method to requirements prioritization that leverages the pairwise comparisons and a constraint solver. Our method employs an interactive accumulation of knowledge from the requirements analyst when the relative priority among the requirements cannot be determined based on the existing knowledge from the requirements documents. The final ranking of the requirements is produced via the constraint solver and interactive pairwise comparisons. We evaluate the proposed method using the requirements from a real healthcare project. The proposed prioritization method relying on a constraint solver outperforms state-of-the-art interactive prioritization methods in terms of effectiveness and robustness to analyst's errors.

Related papers

• Prioritizing Software Requirements Using Large Language Models [3.9422957660677476]
  This article focuses on requirements engineering, typically seen as the initial phase of software development. The challenge of identifying requirements and satisfying all stakeholders within time and budget constraints remains significant. This study introduces a web-based software tool utilizing AI agents and prompt engineering to automate task prioritization.
  arXiv  Detail & Related papers  (2024-04-05T15:20:56Z)
• Choosing a Suitable Requirement Prioritization Method: A Survey [1.4155748588033552]
  Powerful requirements prioritization techniques are of paramount importance to finish the implementation on time and within budget. We propose a novel classification that can classify the prioritization techniques under two major classes: relative and exact prioritization techniques class. An overview of fifteen different requirements prioritization techniques are presented and organized according to the proposed classification criteria's.
  arXiv  Detail & Related papers  (2024-02-20T17:05:16Z)
• Assisted Requirements Selection by Clustering [0.0]
  It is a complex multi-criteria decision process that has been focused by many research works because a balance between business profits and investment is needed. This work studies the combination of the qualitative MoSCoW method and cluster analysis for requirements selection.
  arXiv  Detail & Related papers  (2024-01-23T10:33:44Z)
• Conjunctive Query Based Constraint Solving For Feature Model Configuration [79.14348940034351]
  We show how to apply conjunctive queries to solve constraint satisfaction problems. This approach allows the application of a wide-spread database technology to solve configuration tasks.
  arXiv  Detail & Related papers  (2023-04-26T10:08:07Z)
• Online Learning under Budget and ROI Constraints via Weak Adaptivity [57.097119428915796]
  Existing primal-dual algorithms for constrained online learning problems rely on two fundamental assumptions. We show how such assumptions can be circumvented by endowing standard primal-dual templates with weakly adaptive regret minimizers. We prove the first best-of-both-worlds no-regret guarantees which hold in absence of the two aforementioned assumptions.
  arXiv  Detail & Related papers  (2023-02-02T16:30:33Z)
• Algorithm for Constrained Markov Decision Process with Linear Convergence [55.41644538483948]
  An agent aims to maximize the expected accumulated discounted reward subject to multiple constraints on its costs. A new dual approach is proposed with the integration of two ingredients: entropy regularized policy and Vaidya's dual. The proposed approach is shown to converge (with linear rate) to the global optimum.
  arXiv  Detail & Related papers  (2022-06-03T16:26:38Z)
• Outlier-Robust Sparse Estimation via Non-Convex Optimization [73.18654719887205]
  We explore the connection between high-dimensional statistics and non-robust optimization in the presence of sparsity constraints. We develop novel and simple optimization formulations for these problems. As a corollary, we obtain that any first-order method that efficiently converges to station yields an efficient algorithm for these tasks.
  arXiv  Detail & Related papers  (2021-09-23T17:38:24Z)
• AI Techniques for Software Requirements Prioritization [91.3755431537592]
  The prioritization approaches discussed in this paper are based on different Artificial Intelligence (AI) techniques that can help to improve the overall quality of requirements prioritization processes.
  arXiv  Detail & Related papers  (2021-08-02T12:43:00Z)
• Not All Requirements Prioritization Criteria Are Equal at All Times: A Quantitative Analysis [2.3569088511882335]
  This study investigates which requirements prioritization criteria are most important to use in industry. We extracted 32,139 requirements prioritization decisions based on eight requirements prioritization criteria for 11,110 requirements. The results show that not all requirements prioritization criteria are equally important, and this change depending on how far a requirement has reached in the development process.
  arXiv  Detail & Related papers  (2021-04-13T09:02:47Z)
• Towards Utility-based Prioritization of Requirements in Open Source Environments [51.65930505153647]
  We show how utility-based prioritization approaches can be used to support contributors in conventional and open source Requirements Engineering scenarios. As an example, we show how dependencies can be taken into account in utility-based prioritization processes.
  arXiv  Detail & Related papers  (2021-02-17T09:05:54Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.