Abstract
Practice has proven that softgoal interdependency graphs(SIGs) are a very useful tool for recording and reasoning about non-functional requirements [4], [6], [8]. Practical reuse and design of SIGs, however, rely on the capacity of manually identifying reusable structures, interdependencies, and eliminating harmful redundancies. In this paper, we tackle this shortcomings by firstly proposing a frame representation, that allows us to represent SIGs in terms of lattice-like generalization/specialization hierarchies that can be queried. Secondly, we introduce a closeness criteria that, in the absence of perfect matches, will allow querying for similar or ldquogood enoughrdquo approximations. This mechanism is particularly useful in the identification of softgoal interdependencies. Finally, we argue how the proposed strategy can be used to help identify conflicts in SIG graphs.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
