摘要: Combinatorial testing aims at covering the interactions of parameters in a system under test, while some combinations may be forbidden by given constraints (forbidden tuples). In this paper, we illustrate that such forbidden tuple... 展开
作者 | Akihisa Yamada Armin Biere Cyrille Artho Takashi Kitamura Eun-Hye Choi | ||
---|---|---|---|
作者单位 | |||
文集名称 | 2016 31st IEEE/ACM international conference on automated software engineering | ||
出版年 | 2016 | ||
出版社/出版地 | Institute of Electrical and Electronics Engineers / Piscataway | ||
会议名称 | IEEE/ ACM International Conference on Automated Software Engineering | ||
开始页/总页数 | 614 / 11 | ||
会议日期/会议地点 | 20160903-07 / Singapore | 会议年/会议届次 | 2016 / 31st |
中图分类号 | TP311.5-53 | ||
关键词 | Linux Browsers Approximation algorithms Software testing Software algorithms Software | ||
馆藏号 | N2017010600004184 |