Mapping Extended Feature Models to Constraint Logic Programming over Finite Domains

Karataş, Ahmet; Oğuztüzün, Halit; Doğru, Ali H.

doi:10.1007/978-3-642-15579-6_20

Cited by 39 publications

(35 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Previously exact techniques have been applied only to single-objective SPL models (e.g., [3,22]), and it was assumed that approximate techniques were required for multiobjective models (e.g., Sayyad et al [31]). …”

Section: Discussionmentioning

confidence: 99%

See 1 more Smart Citation

Comparison of exact and approximate multi-objective optimization for software product lines

Olaechea

Rayside

Guo

et al. 2014

Proceedings of the 18th International Software Product Line Conference - Volume 1

View full text Add to dashboard Cite

Software product lines (SPLs) allow stakeholders to manage product variants in a systematical way and derive variants by selecting features. Finding a desirable variant is often difficult, due to the huge configuration space and usually conflicting objectives (e.g., lower cost and higher performance). This scenario can be characterized as a multi-objective optimization problem applied to SPLs. We address the problem using an exact and an approximate algorithm and compare their accuracy, time consumption, scalability, parameter setting requirements on five case studies with increasing complexity. Our empirical results show that (1) it is feasible to use exact techniques for small SPL multi-objective optimization problems, and (2) approximate methods can be used for large problems but require substantial effort to find the best parameter setting for acceptable approximation which can be ameliorated with known good parameter ranges. Finally, we discuss the tradeoff between accuracy and time consumption when using exact and approximate techniques for SPL multi-objective optimization and guide stakeholders to choose one or the other in practice.

show abstract

Section: Discussionmentioning

confidence: 99%

“…For example, Benavides et al [3] used Constraint Satisfaction Programming (CSP) to optimize resource constraints. Karatas et al [22] further introduced a mapping from attributed feature models to constraint logic programming over finite domains.…”

Section: Exact Optimization For Spl Configurationmentioning

confidence: 99%

Comparison of exact and approximate multi-objective optimization for software product lines

Olaechea

Rayside

Guo

et al. 2014

Proceedings of the 18th International Software Product Line Conference - Volume 1

View full text Add to dashboard Cite

show abstract

“…In addition, the authors propose a number of analysis operations on the extended feature model, however, they do not provide quality-aware analysis. Karataş et al (2010) propose a quality language to express extended feature model. They address feature-attribute and attribute-attribute constraints.…”

Section: Related Workmentioning

confidence: 99%

Quality-aware analysis in product line engineering with the orthogonal variability model

et al. 2011

View full text Add to dashboard Cite

Software product line engineering (SPLE) is about producing a set of similar products in a certain domain. A variability model documents the variability amongst products in a product line. The specification of variability can be extended with quality information, such as measurable quality attributes (e.g., CPU and memory consumption) and constraints on these attributes (e.g., memory consumption should be in a range of values). However, the wrong use of constraints may cause anomalies in the specification which must be detected (e.g., the model could represent no products). Furthermore, based on such quality information it is possible to carry out quality-aware analyses, i.e., the product line engineer may want to verify whether it is possible to build a product that satisfies a desired quality. The challenge for quality-aware specification and analysis is three-fold. First, there should be a way to specify quality information in variability models. Second, it should be possible to detect anomalies in the variability specification associated with quality information. Third, there should be mechanisms to verify the variability model to extract useful information, such as the possibility to build a product that fulfils certain quality conditions (e.g., is there any product that requires less than 512MB of memory?). In this article, we present an approach for quality-aware analysis in software product lines using the orthogonal variability model (OVM) to represent variability. We propose to map variability represented in the OVM associated with quality information to a constraint satisfaction problem and to use an off-the-shelf constraint programming solver to automatically perform the verification task. To illustrate our approach, we use a product line in the automotive domain which is an example that was created in a national project by a leading car company. We have developed a prototype tool named FaMa-OVM, which works as a proof of concepts. We were able to identify void models, dead and false optional elements, and check whether the product line example satisfies quality conditions.

show abstract

“…However, as stated by Benavides et al in [7] it is still a challenge to include attributes in cross-tree relationships for analyses on feature models. In this article, which is an extended version of [36], we address this challenge and propose a mapping that will enable the automated analysis of feature models that include such relationships.…”

Section: Introductionmentioning

confidence: 99%

From extended feature models to constraint logic programming

Karataş

Oğuztüzün

Doğru

2013

Science of Computer Programming

Self Cite

View full text Add to dashboard Cite

a b s t r a c tSince feature models for realistic product families may be quite complicated, the automated analysis of feature models is desirable. Although several approaches reported in the literature address this issue, complex cross-tree relationships involving attributes in extended feature models have not been handled. In this article, we introduce a mapping from extended feature models to constraint logic programming over finite domains. This mapping is used to translate into constraint logic programs; basic, cardinality-based and extended feature models, which can include complex cross-tree relationships involving attributes. This translation enables the use of off-the-shelf constraint solvers for the automated analysis of extended feature models involving such complex relationships. We also present the performance results of some well-known analysis operations on an example translated model.

show abstract

Mapping Extended Feature Models to Constraint Logic Programming over Finite Domains

Cited by 39 publications

References 11 publications

Comparison of exact and approximate multi-objective optimization for software product lines

Comparison of exact and approximate multi-objective optimization for software product lines

Quality-aware analysis in product line engineering with the orthogonal variability model

From extended feature models to constraint logic programming

Contact Info

Product

Resources

About