Title :
Querying Software Interdependence Graphs
Author :
Cysneiros, Luiz Marcio ; Breitman, Karin K. ; López, Claudia ; Astudillo, Hernán
Author_Institution :
Sch. of Inf. Technol., York Univ., Toronto, ON, Canada
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.
Keywords :
formal specification; query processing; software reusability; systems analysis; closeness criteria; design; frame representation; lattice-like generalization; nonfunctional requirements; practical reuse; softgoal interdependency graphs; software interdependence graph querying; specialization hierarchies; Application software; Conferences; Context-aware services; Head; Information systems; Information technology; Laboratories; Software quality; Software tools; Tail;
Conference_Titel :
Software Engineering Workshop, 2008. SEW '08. 32nd Annual IEEE
Conference_Location :
Kassandra
Print_ISBN :
978-0-7695-3617-0
DOI :
10.1109/SEW.2008.28