QQ客服 官方微博 反馈留言

	TCA: An Efficient Two-Mode Meta-Heuristic Algorithm for Combinatorial Test Generation
	Lin, Jinkun ; Luo, Chuan ; Cai, Shaowei ; Su, Kaile ; Hao, Dan ; Zhang, Lu
	2015
关键词	INTERACTION TEST SUITES COVERING ARRAYS CONFIGURATION CHECKING LOCAL SEARCH TABU SEARCH SATISFIABILITY SYSTEM
英文摘要	Covering arrays (CAs) are often used as test suites for combinatorial interaction testing to discover interaction faults of real-world systems. Most real-world systems involve constraints, so improving algorithms for covering array generation (CAG) with constraints is beneficial. Two popular methods for constrained CAG are greedy construction and meta-heuristic search. Recently, a meta-heuristic framework called two-mode local search has shown great success in solving classic NP-hard problems. We are interested whether this method is also powerful in solving the constrained CAG problem. This work proposes a two-mode meta-heuristic framework for constrained CAG efficiently and presents a new meta-heuristic algorithm called TCA. Experiments show that TCA significantly outperforms state-of-the-art solvers on 3-way constrained CAG. Further experiments demonstrate that TCA also performs much better than its competitors on 2-way constrained CAG.; EI; CPCI-S(ISTP); jkunlin@gmail.com; chuanluosaber@gmail.com; shaoweicai.cs@gmail.com; k.su@griffith.edu.au; haod@sei.pku.edu.cn; zhanglu@sei.pku.edu.cn; 494-505
语种	英语
出处	30th IEEE/ACM International Conference on Automated Software Engineering Workshops (ASEW)
DOI标识	10.1109/ASE.2015.61
内容类型	其他
源URL	[http://ir.pku.edu.cn/handle/20.500.11897/436363]
专题	信息科学技术学院
推荐引用方式 GB/T 7714	Lin, Jinkun,Luo, Chuan,Cai, Shaowei,et al. TCA: An Efficient Two-Mode Meta-Heuristic Algorithm for Combinatorial Test Generation. 2015-01-01.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。