计算机科学
可扩展性
启发式
软件产品线
相似性(几何)
产品(数学)
组合爆炸
软件
过程(计算)
集合(抽象数据类型)
优先次序
测试用例
数据挖掘
软件工程
机器学习
软件开发
人工智能
程序设计语言
数据库
几何学
图像(数学)
数学
组合数学
回归分析
管理科学
经济
作者
Christopher Henard,Mike Papadakis,Gilles Perrouin,Jacques Klein,Patrick Heymans,Yves Le Traon
标识
DOI:10.1109/tse.2014.2327020
摘要
Large Software Product Lines (SPLs) are common in industry, thus introducing the need of practical solutions to test them. To this end, t-wise can help to drastically reduce the number of product configurations to test. Current t-wise approaches for SPLs are restricted to small values of t. In addition, these techniques fail at providing means to finely control the configuration process. In view of this, means for automatically generating and prioritizing product configurations for large SPLs are required. This paper proposes (a) a search-based approach capable of generating product configurations for large SPLs, forming a scalable and flexible alternative to current techniques and (b) prioritization algorithms for any set of product configurations. Both these techniques employ a similarity heuristic. The ability of the proposed techniques is assessed in an empirical study through a comparison with state of the art tools. The comparison focuses on both the product configuration generation and the prioritization aspects. The results demonstrate that existing t-wise tools and prioritization techniques fail to handle large SPLs. On the contrary, the proposed techniques are both effective and scalable. Additionally, the experiments show that the similarity heuristic can be used as a viable alternative to t-wise.
科研通智能强力驱动
Strongly Powered by AbleSci AI