Please use this identifier to cite or link to this item: https://hdl.handle.net/2440/58664
Citations
Scopus Web of Science® Altmetric
?
?
Type: Conference paper
Title: Towards optimising non-functional requirements
Author: Burgess, C.
Krishna, A.
Jiang, L.
Citation: Proceedings of the Ninth International Conference on Quality Software (QSIC), 2009: pp.269-277
Publisher: IEEE
Publisher Place: USA
Issue Date: 2009
Series/Report no.: International Conference on Quality Software
ISBN: 9780769538280
ISSN: 1550-6002
Conference Name: International Conference on Quality Software (9th : 2009 : Korea)
Editor: Choi, B.J.
Statement of
Responsibility: 
Christopher Burgess, Aneesh Krishna and Li Jiang
Abstract: Non-functional requirements are an important, and often critical, aspect of any software system. However, determining the degree to which any particular software system meets such requirements and incorporating such considerations into the software design process is a difficult challenge. This paper presents a modification of the NFR framework that allows for the discovery of a set of system functionalities that optimally satisfice a given set of non-functional requirements. This new technique introduces an adaptation of softgoal interdependency graphs, denoted softgoal interdependency ruleset graphs, in which label propagation can be done consistently. This facilitates the use of optimisation algorithms to determine the best set of bottom-level operationalizing softgoals that optimally satisfice the highest-level NFR softgoals. The proposed method also introduces the capacity to incorporate both qualitative and quantitative information. © 2009 IEEE.
Keywords: Requirements engineering, non-functional requirements, NFR framework, softgoal interdependency ruleset graphs
Rights: © 2009 IEEE
DOI: 10.1109/QSIC.2009.42
Published version: http://dx.doi.org/10.1109/qsic.2009.42
Appears in Collections:Aurora harvest
Computer Science publications

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.