by Alexander Egyed, David S. Wile
Abstract:
The desirability of maintaining multiple stakeholders interests during the software design process argues for leaving choices undecided as long as possible. Yet, any form of underspecification, either missing information or undecided choices, must be resolved before automated analysis tools can be used. This paper demonstrates how Constraint Satisfaction Problem Solution Techniques (CSTs) can be used to automatically reduce the space of choices for ambiguities by incorporating the local effects of constraints, ultimately with more global consequences. As constraints typical of those encountered during the software design process, we use UML consistency and well-formedness rules. It is somewhat surprising that CSTs are suitable for the software modeling domain since the constraints may relate many ambiguities during their evaluation, encountering a well-known problem with CSTs called the k-consistency problem. This paper demonstrates that our CST-based approach is computationally scalable and effective-as evidenced by empirical experiments based on dozens of industrial models.
Reference:
Support for Managing Design-Time Decisions. (Alexander Egyed, David S. Wile), In IEEE Transactions on Software Engineering, volume 32, 2006.
Bibtex Entry:
@Article{dblp:journals/tse/EgyedW06,
author = {Alexander Egyed and David S. Wile},
title = {Support for Managing Design-Time Decisions.},
journal = {IEEE Transactions on Software Engineering},
year = {2006},
volume = {32},
number = {5},
pages = {299-314},
abstract = {The desirability of maintaining multiple stakeholders interests
during the software design process argues for leaving choices undecided
as long as possible. Yet, any form of underspecification, either
missing information or undecided choices, must be resolved before
automated analysis tools can be used. This paper demonstrates how
Constraint Satisfaction Problem Solution Techniques (CSTs) can be
used to automatically reduce the space of choices for ambiguities
by incorporating the local effects of constraints, ultimately with
more global consequences. As constraints typical of those encountered
during the software design process, we use UML consistency and well-formedness
rules. It is somewhat surprising that CSTs are suitable for the software
modeling domain since the constraints may relate many ambiguities
during their evaluation, encountering a well-known problem with CSTs
called the k-consistency problem. This paper demonstrates that our
CST-based approach is computationally scalable and effective-as evidenced
by empirical experiments based on dozens of industrial models.},
bibsource = {dblp computer science bibliography, https://dblp.org},
biburl = {https://dblp.org/rec/bib/journals/tse/EgyedW06},
file = {:Journals\\TSE 2006 - Support for Managing Design-Time Decisions\\Support for Managing Design-Time Decisions-preprint.pdf:PDF},
keywords = {},
url = {http://doi.ieeecomputersociety.org/10.1109/TSE.2006.48},
}