Identifying Counterexamples Without Variability in Software Product Line Model Checking

Product detection based on state abstraction technologies in the software product line(SPL)is more complex when compared to a single system.This variability constitutes a new complexity,and the counterexample may be valid for some products but spurious for others.In this paper,we found that spurious products are primarily due to the failure states,which correspond to the spurious counterexamples.The violated products correspond to the real counterexamples.Hence,identifying counterexamples is a critical problem in detecting violated products.In our approach,we obtain the violated products through the genuine counterexamples,which have no failure state,to avoid the tedious computation of identifying spurious products dealt with by the existing algorithm.This can be executed in parallel to improve the efficiency further.Experimental results showthat our approach performswell,varying with the growth of the system scale.By analyzing counterexamples in the abstract model,we observed that spurious products occur in the failure state.The approach helps in identifying whether a counterexample is spurious or genuine.The approach also helps to check whether a failure state exists in the counterexample.The performance evaluation shows that the proposed approach helps significantly in improving the efficiency of abstraction-based SPL model checking.

Conversion of Object Oriented System into Software Product Line with Delta Modeling Abstract Behavioral Specification

This article contains a system conversion from object oriented design into Software Product Line (SPL) using delta modeling of Abstract Behavioral Specification (ABS). ABS is a modeling language which targets system with high level of variety and supports SPL development with delta modeling. The case study of this thesis is a digital library system called Library Automation and Digital Archive (LONTAR). Originally, LONTAR only uses SOAP-based web service. With ABS, LONTAR will be converted into SPL and implement another web service called REST. The motivation of this conversion of LONTAR from object oriented into SPL is because it is easier to develop system with ABS than using regular object oriented. Product definition in ABS is relatively easier than creating a new subclass and do customization to make it works well.

Binary Oriented Feature Selection for Valid Product Derivation in Software Product Line

Software Product Line(SPL)is a group of software-intensive systems that share common and variable resources for developing a particular system.The feature model is a tree-type structure used to manage SPL’s common and variable features with their different relations and problem of Crosstree Constraints(CTC).CTC problems exist in groups of common and variable features among the sub-tree of feature models more diverse in Internet of Things(IoT)devices because different Internet devices and protocols are communicated.Therefore,managing the CTC problem to achieve valid product configuration in IoT-based SPL is more complex,time-consuming,and hard.However,the CTC problem needs to be considered in previously proposed approaches such as Commonality VariabilityModeling of Features(COVAMOF)andGenarch+tool;therefore,invalid products are generated.This research has proposed a novel approach Binary Oriented Feature Selection Crosstree Constraints(BOFS-CTC),to find all possible valid products by selecting the features according to cardinality constraints and cross-tree constraint problems in the featuremodel of SPL.BOFS-CTC removes the invalid products at the early stage of feature selection for the product configuration.Furthermore,this research developed the BOFS-CTC algorithm and applied it to,IoT-based feature models.The findings of this research are that no relationship constraints and CTC violations occur and drive the valid feature product configurations for the application development by removing the invalid product configurations.The accuracy of BOFS-CTC is measured by the integration sampling technique,where different valid product configurations are compared with the product configurations derived by BOFS-CTC and found 100%correct.Using BOFS-CTC eliminates the testing cost and development effort of invalid SPL products.

Learning to Support Derivation of Adaptable Products in Software Product Lines

Software product line engineering is a large scale development paradigm based on mass production. It consists in building a common platform from which a set of products can be derived. Under the constraints of continuous evolution and costs optimization, the derivation process must be able to answer customers’ requirements and provide adequate products in a short time without defects. However, this purpose cannot be achieved if the customer must wait for the change is implemented in the common platform. In this paper, we describe our work which proposes a framework to manage derivation of adaptable products. An adaptable product is obtained by deriving the most similar product from the common platform and changing it to support the new requirements. The aim of the framework is to give quick response to the customers need while the new requirements are being implemented in the common platform. The framework includes tools for processing natural language requirements, computing the similarity between products on the basis of their requirements, and the product adaptation effort measuring.

基于GRoundTram的软件产品线设计模型的同步方法

领域设计模型与应用系统设计模型是软件产品线开发与定制阶段的重要产物。在产品线的生命周期中,为了保证这两个模型之间的一致性,需要采用自动化或半自动化的手段实现模型之间的同步。针对该问题,提出了一种基于GRoundTram的软件产品线设计模型的同步方法,称为SPLSync-GRoundTram。该方法将领域设计模型与应用系统设计模型之间的同步问题转换为基于图的模型双向变换问题,并使用GRoundTram实现自动化的同步操作。给出了该模型同步方法的具体操作步骤,并通过一个"网上书城"的设计模型实例展示其有效性。

A Feature Model Based Framework for Refactoring Software Product Line Architecture

Software product line （SPL） is an approach used to develop a range of software products with a high degree of similarity. In this approach, a feature model is usually used to keep track of similarities and differences. Over time, as modifications are made to the SPL, inconsistencies with the feature model could arise. The first approach to dealing with these inconsistencies is refactoring. Refactoring consists of small steps which, when accumulated, may lead to large-scale changes in the SPL, resulting in features being added to or eliminated from the SPL. In this paper, we propose a framework for refactoring SPLs, which helps keep SPLs consistent with the feature model. After some introductory remarks, we describe a formal model for representing the feature model. We express various refactoring patterns applicable to the feature model and the SPL formally, and then introduce an algorithm for finding them in the SPL. In the end, we use a real-world case study of an SPL to illustrate the applicability of the framework introduced in the paper.

Ant Colony Optimization for Feature Selection in Software Product Lines

Software product lines(SPLs) are important software engineering techniques for creating a collection of similar software systems. Software products can be derived from SPLs quickly. The process of software product derivation can be modeled as feature selection optimization with resource constraints, which is a nondeterministic polynomial-time hard(NP-hard) problem. In this paper, we present an approach that using ant colony optimization to get an approximation solution of the problem in polynomial time. We evaluate our approach by comparing it to two important approximation techniques. One is filtered Cartesian flattening and modified heuristic(FCF+M-HEU) algorithm, the other is genetic algorithm for optimized feature selection(GAFES). The experimental results show that our approach performs 6% worse than FCF+M-HEU with reducing much running time. Meanwhile, it performs 10% better than GAFES with taking more time.

Efficient software product-line model checking using induction and a SAT solver

Software product line （SPL） engineering is increasingly being adopted in safety-critical systems. It is highly desirable to rigorously show that these systems are designed correctly. However, formal analysis for SPLs is more difficult than for single systems because an SPL may contain a large number of individual systems. In this paper, we propose an efficient model-checking technique for SPLs using induction and a SAT （Boolean satisfiability problem） solver. We show how an induction-based verification method can be adapted to the SPLs, with the help of a SAT solver. To combat the state space explosion problem, a novel technique that exploits the distinguishing characteristics of SPLs, called feature cube enlargement, is proposed to reduce the verification efforts. The incremental SAT mechanism is applied to further improve the efficiency. The correctness of our technique is proved. Experimental results show dramatic improvement of our technique over the existing binary decision diagram （BDD）-based techniques.

Model-Driven Derivation of Domain Functional Requirements from Use Cases

Domain analysis is essential to core assets development in software product line engineering. Most existing approaches, however, depend on domain experts’ experience to analyze the commonality and variability of systems in a domain, which remains a manual and intensive process. This paper addresses the issue by proposing a model-driven approach to automating the domain requirements derivation process. The paper focuses on the match between the use cases of existing individual products and the domain functional requirements of a product line. By introducing a set of linguistic description dimensions to differentiate the sub-variations in a use case, the use case template is extended to model variability. To this end, a transformation process is formulated to sustain and deduce the information in use cases, and to match it to domain functional requirements. This paper also presents a prototype which implements the derivation as a model transformation described in a graphical model transformation language MOLA. This approach complements existing domain analysis techniques with less manual operation cost and more efficiency by automating the domain functional requirements development.

大型机器人冲压生产线多软件联合仿真

为快速设计研制大型机器人冲压生产线并满足运动学、动力学、刚度等方面的设计要求,提出基于接口技术的多软件联合仿真策略:利用Dynaform软件模拟板料冲压成形过程、捕获动态负载曲线,并加载到压机上用于逼近真实载荷;利用ANSYS软件对关键部件作柔性化处理并导入ADAMS中替换相应的刚体,建立刚柔耦合的冲压线虚拟样机。以加工汽车侧围板为例,建立冲压线中主压机的运动学和动力学数学模型,提出系统能耗指标和安全-效率平衡系数两个综合性能评价指标。将刚柔耦合虚拟样机的仿真结果与理论计算结果及多刚体虚拟样机的仿真结果进行对比分析。结果表明,刚柔耦合的虚拟样机能够提高仿真精度、更真实地反映加工过程,为冲压线的整体设计、关键参数选择及现场安装调试提供理论依据。

软件产品线可变性建模技术系统综述

软件产品线是实现大规模的软件复用、保证高质量的新产品开发的最佳实践．软件产品线的关键问题是如何进行可变性管理，并基于可变性管理实现软件核心资产的复用．软件产品线可变性建模是可变性管理的关键技术，实现产品家族成员的共性和可变性的描述．可变性建模涉及软件开发的全生命周期，在领域_Y-程和应用工程中，尤其是在产品构建过程中，起到重要的作用．从众多的建模技术中选择合适的建模技术是十分困难的，在软件产品线领域中开展了可变性建模技术的系统综述．按照系统综述的方法对可变性建模技术进行了系统总结，根据系统综述规则＇选取了从1990年～2011年发表的论文进行综述．讨论了系统综述的研究成果，从可变性建模方法分类、重要可变性建模技术对比等方面进行深入的探讨，为建模人员和研究人员对可变性建模技术的选择和研究提供支持．最后分析了可变性建模技术的研究趋势，并对可变性建模技术有待深入的研究难点和发展趋势进行了展望．

一种基于UML的软件产品线可变性建模方法

将UML引入到软件产品线开发中,在产品线可变性分析的基础上,提出了一种基于UML的产品线可变性建模方法。该方法不仅支持可选、多选一等可变点类型的描述,还支持软件产品线可变性的约束建模。在此基础上,还通过一个手机应用软件的产品线可变性建模实例验证了该方法的有效性。

基于UML用例图的软件产品线需求建模方法

软件产品线方法是一种面向特定领域的、大规模、大粒度的软件复用技术。明确建模和描述软件产品线需求是软件产品线开发的关键问题之一。而传统的UML用例图等方法不足以完整描述产品线需求,特别是其变化性。通过分析软件产品线开发过程和软件产品线需求建模的特殊性,采用扩展UML用例图标签的方法,实现对软件产品线需求的明确描述。以网络图书销售软件产品线为例,进行具体说明。

基于模型对比和组合的软件产品线领域需求建模

软件产品线作为系统化的软件复用方式,可以提高软件的开发效率和质量.软件产品线变化性建模是软件产品线的关键技术,通过建立变化性模型以记录软件产品线成员产品的共性和变化性.目前的软件产品线变化性建模方法大都通过领域专家进行分析建立,这种方法过度依赖于领域专家的分析能力,在系统规模较小的情况下,变化性分析比较容易,但是如果系统规模变大,则系统的规模对于变化性分析的影响会越来越大.文中提出一种半自动的软件产品线领域需求建模方法,基于关注点分离的思路,利用特征模型表示软件产品线中系列产品的不同方面的特征信息,通过特征模型的对比和组合实现领域需求模型的构建.为有效地实现特征模型对比与组合,文中提出一种基于标记和结构的特征模型对比方法,同时,文中实现了基于约束的特征模型组合.基于公开的特征模型,文中对提出的方法进行了验证,实验结果表明,文中提出的领域需求建模方法能够在一定准确率的情况下有效地实现领域需求模型的构建.

一种面向产品线的特征依赖建模方法

特征依赖建模是描述特征间相互约束的模型,是软件产品线开发中的一项关键活动。引入了特征局部依赖和全局依赖关系,在对特征依赖关系分析的基础上,提出了一种特征依赖建模方法,该方法不仅支持分解、泛化等特征局部依赖描述,还支持配置依赖、运行依赖和影响依赖等全局依赖建模。通过一个空调控制系统的产品线特征依赖建模实例验证了该方法的有效性。

一种用UML对软件产品线建模的方法

采用UML Profile扩展机制实现了产品线的差异建模,并用UML的OCL约束在元模型层和模型层的模型实现了产品线的通用约束和特定产品线的特定约束,最后给出了从产品线模型生成产品库的算法。

软件架构模型及机组作业计划中的任务分配法

针对鞍钢新轧钢集团股份有限公司冷轧薄板厂CIMS工程的实际情况 ,介绍了CIMS工程环境下软件功能设计和机组作业计划中的任务分配方法。应用着色Petri网建立了冷轧生产线的软件架构模型 ,完整地描述了冷轧生产线的生产活动流程过程及相应的软件功能。对机组作业计划功能软件 ,以机组与生产任务的最佳匹配、机组的负荷平衡为性能指标 ,采用了实时最小负荷分配规则 。

基于特征切片的软件产品线模型检测

特征模型是一种描述软件产品线中共性和可变性特征的通用形式。特征模型象征着所有可能的应用程序配置空间,是实现个性化产品定制的基础。随着软件产品线的规模和复杂程度的增加,如何有效支持以用户需求为基础以及根据特定需求和利益相关者的目标进行个性定制开发是亟待解决的实际问题。提出一种根据用户需求对特征模型进行切片,进一步结合三值逻辑对行为模型进行抽象,最后利用模型检测技术对软件产品线进行验证的方法。实验结果证实了该方法的有效性。

基于双格的软件产品线模型检测

软件产品线在保留每个产品的可变性前提下通过最大化产品间的共性实现资源的再利用,从而提高生产效率和节约生产成本。近年来,基于特征的状态迁移系统应用于软件产品线的建模和验证中。然而现有的方法不能很好地支持软件产品线中存在的信息不确定和不一致的情况。为此,首先提出一种基于双格的特征迁移系统,用于软件产品线的行为建模,采用投影的方法定义产品的行为模型;然后采用动作计算树逻辑描述系统的时序属性,并且给出它在新系统上的语义,用于支持基于双格的模型检测;最后,采用多值模型检测工具χchek对方法的有效性进行实验分析。

面向软件密集型系统的体系结构可变性建模

软件体系结构提供了软件系统的高层抽象,对于软件密集型系统的开发具有重要意义,基于体系结构层次的可变性管理可以有效地实现软件的定制和演化。目前体系结构层次的可变性建模并没有得到足够的关注,在分析出领域体系结构后,无法很好地实现体系结构的建模,而且体系结构层次可变性建模方法并没有很好地对可变性的复杂依赖关系进行建模。提出了一种基于多视图的体系结构可变性建模方法,基于UML Profile扩展机制,定义了可变性的构造型、标记值和相关的约束,并利用基于分离的可变性建模方法,定义可变点交互视图对系统中存在的依赖进行建模。基于可变性视图和依赖视图分离的可变性建模方法,实现了复杂依赖关系的有效管理,提高了可变性建模的效果。以船舶故障预测与健康管理系统作为研究案例,对该方法进行了验证,结果表明该方法能够有效地实现软件密集型系统的建模。