Querying Software Interdependence Graphs. Cysneiros, L. M., Breitman, K. K., Lopez, C., & Astudillo, H. In 2008 32nd Annual IEEE Software Engineering Workshop, pages 108–112, October, 2008. ISSN: 1550-6215![Querying Software Interdependence Graphs [link]](https://bibbase.org/img/filetypes/link.svg "link")
Paper doi abstract bibtex 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.
@inproceedings{cysneiros_querying_2008,
title = {Querying {Software} {Interdependence} {Graphs}},
url = {https://ieeexplore.ieee.org/abstract/document/5328411?casa_token=_Jj6V6_-8ToAAAAA:PBjHC0lW0zEGLq-y_XwZ_4M69Ljm-0mhHhyEwdiOtMCpfnZ53pkySZgrkFQwSQQ4XLz7ZlkT-Is},
doi = {10.1109/SEW.2008.28},
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.},
urldate = {2024-09-23},
booktitle = {2008 32nd {Annual} {IEEE} {Software} {Engineering} {Workshop}},
author = {Cysneiros, Luiz Marcio and Breitman, Karin K. and Lopez, Claudia and Astudillo, Hernán},
month = oct,
year = {2008},
note = {ISSN: 1550-6215},
keywords = {Application software, Conferences, Context-aware services, Head, Information systems, Information technology, Laboratories, Software quality, Software tools, Tail},
pages = {108--112},
file = {IEEE Xplore Abstract Record:/Users/ra79rew/Zotero/storage/YYWQMQMG/5328411.html:text/html},
}
Downloads: 0
{"_id":"mScAGsafsnv69DzTb","bibbaseid":"cysneiros-breitman-lopez-astudillo-queryingsoftwareinterdependencegraphs-2008","author_short":["Cysneiros, L. M.","Breitman, K. K.","Lopez, C.","Astudillo, H."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","title":"Querying Software Interdependence Graphs","url":"https://ieeexplore.ieee.org/abstract/document/5328411?casa_token=_Jj6V6_-8ToAAAAA:PBjHC0lW0zEGLq-y_XwZ_4M69Ljm-0mhHhyEwdiOtMCpfnZ53pkySZgrkFQwSQQ4XLz7ZlkT-Is","doi":"10.1109/SEW.2008.28","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.","urldate":"2024-09-23","booktitle":"2008 32nd Annual IEEE Software Engineering Workshop","author":[{"propositions":[],"lastnames":["Cysneiros"],"firstnames":["Luiz","Marcio"],"suffixes":[]},{"propositions":[],"lastnames":["Breitman"],"firstnames":["Karin","K."],"suffixes":[]},{"propositions":[],"lastnames":["Lopez"],"firstnames":["Claudia"],"suffixes":[]},{"propositions":[],"lastnames":["Astudillo"],"firstnames":["Hernán"],"suffixes":[]}],"month":"October","year":"2008","note":"ISSN: 1550-6215","keywords":"Application software, Conferences, Context-aware services, Head, Information systems, Information technology, Laboratories, Software quality, Software tools, Tail","pages":"108–112","file":"IEEE Xplore Abstract Record:/Users/ra79rew/Zotero/storage/YYWQMQMG/5328411.html:text/html","bibtex":"@inproceedings{cysneiros_querying_2008,\n\ttitle = {Querying {Software} {Interdependence} {Graphs}},\n\turl = {https://ieeexplore.ieee.org/abstract/document/5328411?casa_token=_Jj6V6_-8ToAAAAA:PBjHC0lW0zEGLq-y_XwZ_4M69Ljm-0mhHhyEwdiOtMCpfnZ53pkySZgrkFQwSQQ4XLz7ZlkT-Is},\n\tdoi = {10.1109/SEW.2008.28},\n\tabstract = {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.},\n\turldate = {2024-09-23},\n\tbooktitle = {2008 32nd {Annual} {IEEE} {Software} {Engineering} {Workshop}},\n\tauthor = {Cysneiros, Luiz Marcio and Breitman, Karin K. and Lopez, Claudia and Astudillo, Hernán},\n\tmonth = oct,\n\tyear = {2008},\n\tnote = {ISSN: 1550-6215},\n\tkeywords = {Application software, Conferences, Context-aware services, Head, Information systems, Information technology, Laboratories, Software quality, Software tools, Tail},\n\tpages = {108--112},\n\tfile = {IEEE Xplore Abstract Record:/Users/ra79rew/Zotero/storage/YYWQMQMG/5328411.html:text/html},\n}\n\n","author_short":["Cysneiros, L. M.","Breitman, K. K.","Lopez, C.","Astudillo, H."],"key":"cysneiros_querying_2008","id":"cysneiros_querying_2008","bibbaseid":"cysneiros-breitman-lopez-astudillo-queryingsoftwareinterdependencegraphs-2008","role":"author","urls":{"Paper":"https://ieeexplore.ieee.org/abstract/document/5328411?casa_token=_Jj6V6_-8ToAAAAA:PBjHC0lW0zEGLq-y_XwZ_4M69Ljm-0mhHhyEwdiOtMCpfnZ53pkySZgrkFQwSQQ4XLz7ZlkT-Is"},"keyword":["Application software","Conferences","Context-aware services","Head","Information systems","Information technology","Laboratories","Software quality","Software tools","Tail"],"metadata":{"authorlinks":{}},"downloads":0,"html":""},"bibtype":"inproceedings","biburl":"https://bibbase.org/network/files/Sp5SGWtwMfzGNt9ek","dataSources":["cBmZY7557wCZxHeRB"],"keywords":["application software","conferences","context-aware services","head","information systems","information technology","laboratories","software quality","software tools","tail"],"search_terms":["querying","software","interdependence","graphs","cysneiros","breitman","lopez","astudillo"],"title":"Querying Software Interdependence Graphs","year":2008}