Abstract | ||
---|---|---|
For the analysis of highly configurable systems, analysis approaches need to take the inherent variability of these systems into account. The notion of presence conditions is central to such approaches. A presence condition specifies a subset of system configurations in which a certain artifact or a concern of interest is present (e.g., a defect associated with this subset). In this paper, we introduce and analyze the problem of presence-condition simplification. A key observation is that presence conditions often contain redundant information, which can be safely removed in the interest of simplicity and efficiency. We present a formalization of the problem, discuss application scenarios, compare different algorithms for solving the problem, and empirically evaluate the algorithms by means of a set of substantial case studies.
|
Year | DOI | Venue |
---|---|---|
2015 | 10.1109/ICSE.2015.39 | ICSE |
Keywords | Field | DocType |
presence-condition simplification,highly configurable systems analysis,systems variability,presence conditions notion,system configuration | Boolean function,Data structure,Algorithm design,Computer science,Cryptography,Configurable systems,Real-time computing,Mobile device,Distributed computing | Conference |
Volume | ISSN | ISBN |
1 | 0270-5257 | 978-1-4799-1934-5 |
Citations | PageRank | References |
16 | 0.53 | 39 |
Authors | ||
6 |
Name | Order | Citations | PageRank |
---|---|---|---|
Alexander von Rhein | 1 | 316 | 11.35 |
Alexander Grebhahn | 2 | 150 | 9.11 |
Sven Apel | 3 | 3980 | 184.13 |
Norbert Siegmund | 4 | 1002 | 51.87 |
Dirk Beyer | 5 | 1736 | 100.85 |
Thorsten Berger | 6 | 603 | 34.35 |