An automatic reasoning mechanism for NFR goal models

Publication Type:
Conference Proceeding
Citation:
Proceedings - 5th International Conference on Theoretical Aspects of Software Engineering, TASE 2011, 2011, pp. 52 - 59
Issue Date:
2011-11-04
Metrics:
Full metadata record
Files in This Item:
Filename Description Size
Thumbnail2011001659OK.pdf Published version942.84 kB
Adobe PDF
Software requirements, especially non-functional requirements, are considered as vital prerequisites for producing software of high quality. As widely accepted, non-functional goal modeling like the NFR Framework usually employs tree modeling style, and presents an interactive process for the analysis of nonfunctional requirements. However, there still exist some problems during the identification of satisficing status. This paper based on the popular NFR goal model reasoning manners, clearly distinguishes the closed world assumption and the open world assumption, and proposes an automatic reasoning mechanism for NFR goal models in order to identify the satisficing statuses of the goal tree roots according to leaves' contributions. Under a specific assumption, goals' satisficing statuses will be transformed to affect satisficing statuses of their parents. Then parents'satisficing statuses will be inferred according to the reasoning rules derived from different decomposition relationships. By alternately adopting these two steps, goal tree root's satisficingstatus can be identified layer by layer. An illustrative example is used to show how our proposed formal approach works. © 2011 IEEE.
Please use this identifier to cite or link to this item: