Evolving feature model configurations in software product lines

The increasing complexity and cost of software-intensive systems has led developers to seek ways of reusing software components across development projects. One approach to increasing software reusability is to develop a software product-line (SPL), which is a software architecture that can be reconfigured and reused across projects. Rather than developing software from scratch for a new project, a new configuration of the SPL is produced. It is hard, however, to find a configuration of an SPL that meets an arbitrary requirement set and does not violate any configuration constraints in the SPL.Existing research has focused on techniques that produce a configuration of an SPL in a single step. Budgetary constraints or other restrictions, however, may require multi-step configuration processes. For example, an aircraft manufacturer may want to produce a series of configurations of a plane over a span of years without exceeding a yearly budget to add features.This paper provides three contributions to the study of multi-step configuration for SPLs. First, we present a formal model of multi-step SPL configuration and map this model to constraint satisfaction problems (CSPs). Second, we show how solutions to these SPL configuration problems can be automatically derived with a constraint solver by mapping them to CSPs. Moreover, we show how feature model changes can be mapped to our approach in a multi-step scenario by using feature model drift. Third, we present empirical results demonstrating that our CSP-based reasoning technique can scale to SPL models with hundreds of features and multiple configuration steps.     

Automated modeling of modular robotic configurations

This research presents an automated method to build kinematic and dynamic models for assembling modular components of modular robotic systems. By comparison with other approaches, the proposed method is applicable to any robotic configuration with serial, parallel, or hybrid structures. In addition, it is object oriented so that each modular component is an element with a submodel and the overall model can be assembled from submodels subject to the connection constraints.     

Consistency-based diagnosis of configuration knowledge bases

Configuration problems are a thriving application area for declarative knowledge representation that currently experiences a constant increase in size and complexity of knowledge bases. Automated support of the debugging process of such knowledge bases is a necessary prerequisite for effective development of configurators. We show that this task can be achieved by consistency-based diagnosis techniques. Based on the formal definition of consistency-based configuration we develop a framework suitable for diagnosing configuration knowledge bases. During the test phase of configurators, valid and invalid examples are used to test the correctness of the system. In case such examples lead to unintended results, debugging of the knowledge base is initiated. Starting from a clear definition of diagnosis in the configuration domain we develop an algorithm based on conflicts. Our framework is general enough for its adaptation to diagnosing customer requirements to identify unachievable conditions during configuration sessions.A prototype implementation using commercial constraint-based configurator libraries shows the feasibility of diagnosis within the tight time bounds of interactive debugging sessions. Finally, we discuss the usefulness of the outcomes of the diagnostic process in different scenarios.     

Object configurations in software engineering databases

We consider the logical organization of database support for software engineering applications, which has to cope with such requirements as the adequate support of object composition and versioning, the derivation of (consistent) configurations, and the provision of application-specific transactions. A new approach to the organization, manipulation and management of multiversion objects in CASE databases is described and investigated, which clearly distinguishes four relevant concepts: documents, versions, configurations and databases. The approach is formally made precise using the concept ofAND/OR graphs, which renders it possible to cast operations on any of the concepts in terms of graph operations. The levels of abstraction distinguished and maintained throughout the exposition give rise to an appropriate transaction concept: transactions involve graph operations on specific types of objects only; conflicts between transactions can thus be easily identified, and consistency of objects is easily maintained.     

A GRASP algorithm to solve the unicost set covering problem

The set covering problem (SCP) is a well-known combinatorial optimization problem. This paper presents a GRASP algorithm to solve a special SCP case known in the literature as the unicost set covering problem. The algorithm incorporates a local improvement procedure based on the heuristics to solve binary constraint satisfiability problems (SAT). The quality of the proposed algorithm is tested on a set of reference instances, comparing the obtained results with those found in the literature. Our algorithm improves the best-known solutions for many of these instances.     

模拟退火法进化玻耳兹曼机的实现策略

玻耳兹曼机是较新的并行约束网络结构,在优化技术中有着其他技术无法比拟的优势。用模拟退火法对玻耳兹曼机进行进化,改善其搜索性能,突出其优势。通过理论分析和实践,取得了较好的效果,得出了有意义的结论。     

动态Web Services的约束满足优化技术研究

Web Services合成是Web Services技术的重要方面,能够按要求提供选择新的服务。本文首先提出了Web Services服务约束的分类描述,进而分析了Web Services服务合成中如何按照服务约束指导服务选择,进而选择合适的服务集来满足客户的要求。该方法把动态Web Services合成转化为约束满足问题。     

Automated error analysis for the agilization of feature modeling

Software Product Lines (SPL) and agile methods share the common goal of rapidly developing high-quality software. Although they follow different approaches to achieve it, some synergies can be found between them by (i) applying agile techniques to SPL activities so SPL development becomes more agile; and (ii) tailoring agile methodologies to support the development of SPL. Both options require an intensive use of feature models, which are usually strongly affected by changes on requirements. Changing large-scale feature models as a consequence of changes on requirements is a well-known error-prone activity. Since one of the objectives of agile methods is a rapid response to changes in requirements, it is essential an automated error analysis support in order to make SPL development more agile and to produce error-free feature models.

As a contribution to find the intended synergies, this article sets the basis to provide an automated support to feature model error analysis by means of a framework which is organized in three levels: a feature model level, where the problem of error treatment is described; a diagnosis level, where an abstract solution that relies on Reiter’s theory of diagnosis is proposed; and an implementation level, where the abstract solution is implemented by using Constraint Satisfaction Problems (CSP).

To show an application of our proposal, a real case study is presented where the Feature-Driven Development (FDD) methodology is adapted to develop an SPL. Current proposals on error analysis are also studied and a comparison among them and our proposal is provided. Lastly, the support of new kinds of errors and different implementation levels for the proposed framework are proposed as the focus of our future work.     

软件配置管理系统XML数据模型及原型研究

配置管理是软件开发管理中的重要支持活动。配置库管理是软件配置管理的核心任务之一。由于分布式配置库模型和internet的出现,对配置库间数据交换和访问提出了新的需求。该文首先了介绍配置库模型的一般概念及其核心数据组成,并基于XML定义了青鸟配置库数据模型,为同构/异构配置库模型间的数据交换提供支持。随后介绍了青鸟网上配置管理系统(JBCM_WEB)原型,研究了基于XML配置数据互操作和B/S方式的应用。     

软件配置管理解决方案

从具体工程和实际工作出发，为软件配置管理工作的有效实施提出了一套解决方案，该方案实际应用效果良好，对软件配置管理实践有较强的指导和借鉴作用。     

浅析实现与测试网构软件的方法

本文阐述网构软件的构成及测试,并提出了具体的实现方式。概括了基于互联网服务的网构软件的实质,网构软件与传统软件间的差异,提出了在互联网上实现网构软件的趋势及实现网构软件的测试方法。     

Configuration for mass customization: how to extend product configuration towards requirements and process configuration

In order to develop mass customization, many companies use configuration software to customize their products. Although many studies already exist about Product Configuration, Requirements and Process Configuration have not been studied in detail. As all these three aspects must be considered for mass customization, the aim of this paper is to show how Product Configuration, when considered as a constraint satisfaction problem, can be extended upstream towards Requirements Configuration and downstream towards Process Configuration. Product Configuration basics are first reviewed thanks to a constraint based approach, and an analysis of industrial configuration situations is done in order to clarify mass customization needs in terms of configuration. Then upstream Requirements Configuration and downstream Process Configuration are defined and generic models are proposed. It is shown that the proposed elements allow a global and consistent flow of configuration activities. A detailed example illustrates the different configuration problems and a discussion terminates the paper.     

Automating the construction of domain-specific modeling languages for object-oriented frameworks

The extension of frameworks with domain-specific modeling languages (DSML) has proved to be an effective way of improving the productivity in software product-line engineering. However, developing and evolving a DSML is typically a difficult and time-consuming task because it requires to develop and maintain a code generator, which transforms application models into framework-based code. In this paper, we propose a new approach for extending object-oriented frameworks that aims to alleviate this problem. The approach is based on developing an additional aspect-oriented layer that encodes a DSML for building framework-based applications, eliminating the need of implementing a code generator. We further show how a language workbench is capable of automating the construction of DSMLs using the proposed layer.     

Automated analysis of feature models 20 years later: A literature review

Software product line engineering is about producing a set of related products that share more commonalities than variabilities. Feature models are widely used for variability and commonality management in software product lines. Feature models are information models where a set of products are represented as a set of features in a single model. The automated analysis of feature models deals with the computer-aided extraction of information from feature models. The literature on this topic has contributed with a set of operations, techniques, tools and empirical results which have not been surveyed until now. This paper provides a comprehensive literature review on the automated analysis of feature models 20 years after of their invention. This paper contributes by bringing together previously disparate streams of work to help shed light on this thriving area. We also present a conceptual framework to understand the different proposals as well as categorise future contributions. We finally discuss the different studies and propose some challenges to be faced in the future.     

Automated generation of computationally hard feature models using evolutionary algorithms

A feature model is a compact representation of the products of a software product line. The automated extraction of information from feature models is a thriving topic involving numerous analysis operations, techniques and tools. Performance evaluations in this domain mainly rely on the use of random feature models. However, these only provide a rough idea of the behaviour of the tools with average problems and are not sufficient to reveal their real strengths and weaknesses. In this article, we propose to model the problem of finding computationally hard feature models as an optimization problem and we solve it using a novel evolutionary algorithm for optimized feature models (ETHOM). Given a tool and an analysis operation, ETHOM generates input models of a predefined size maximizing aspects such as the execution time or the memory consumption of the tool when performing the operation over the model. This allows users and developers to know the performance of tools in pessimistic cases providing a better idea of their real power and revealing performance bugs. Experiments using ETHOM on a number of analyses and tools have successfully identified models producing much longer executions times and higher memory consumption than those obtained with random models of identical or even larger size.     

基于软件芯片的可重构远程故障诊断系统

提出了一种具有充分柔性与可重构性的远程故障诊断系统的结构模型,利用软件芯片技术对系统中的各功能模块进行封装,并描述了系统的运行原理。根据应用设备的不同要求,通过系统数据组织、诊断芯片适配和运行结构设计,可以快速重构出不同的诊断系统。     

软件工程质量管理的关键——配置管理

软件工程的质量管理是一个复杂的问题,配置管理是软件工程质量保证的基础,没有配置管理,就不可能有效地控制软件的质量。该文说明了配置管理的目标、关键和实施配置管理所需要注意的重要问题。     

Automatic Generation of Redundant Models for Permutation Constraint Satisfaction Problems

If we have two representations of a problem as constraint satisfaction problem (CSP) models, it has been shown that combining the models using channeling constraints can increase constraint propagation in tree search CSP solvers. Handcrafting two CSP models for a problem, however, is often time-consuming. In this paper, we propose model induction, a process which generates a second CSP model from an existing model using channeling constraints, and study its theoretical properties. The generated induced model is in a different viewpoint, i.e., set of variables. It is mutually redundant to and can be combined with the input model, so that the combined model contains more redundant information, which is useful to increase constraint propagation. We also propose two methods of combining CSP models, namely model intersection and model channeling. The two methods allow combining two mutually redundant models in the same and different viewpoints respectively. We exploit the applications of model induction, intersection, and channeling and identify three new classes of combined models, which contain different amounts of redundant information. We construct combined models of permutation CSPs and show in extensive benchmark results that the combined models are more robust and efficient to solve than the single models.     

约束编程及其在产品配置器中的应用

产品配置器技术是人工智能领域近十几年来发展起来的一个新的研究方向,而约束编程、约束满足问题等也是近三十年才发展起来的。本文介绍了产品配置器核心算法的最新发展,论述了约束编程在这一领域所做的贡献以及两者相结合的发展趋势。