automatic verification of optimization algorithms: a case study of a quadratic assignment problem solver
文献类型：期刊论文
| 作者 | Merkel Robert ; Wang Daoming ; Lin Huimin ; Chen Tsong Yueh |
| 刊名 | International Journal of Software Engineering and Knowledge Engineering
 |
| 出版日期 | 2011 |
| 卷号 | 21期号:2页码:289-307 |
| 关键词 | Computer software selection and evaluation Optimization Verification |
| ISSN号 | 0218-1940 |
| 中文摘要 | Metamorphic testing is a technique for the verification of software output without a complete testing oracle. Mathematical optimization, implemented in software, is a problem for which verification can often be challenging. In this paper, we apply metamorphic testing to one such optimization problem, the quadratic assignment problem (QAP). From simple observations of the properties of the QAP, we describe how to derive a number of metamorphic relations useful for verifying the correctness of a QAP solver. We then compare the effectiveness of these metamorphic relations, in "killing" mutant versions of an exact QAP solver, to a simulated oracle. We show that metamorphic testing can be as effective as the simulated oracle for killing mutants. We examine the relative effectiveness of different metamorphic relations, both singly and in combination, and conclude that combining metamorphic relations can be significantly more effective than using a single relation. © 2011 World Scientific Publishing Company. |
| 英文摘要 | Metamorphic testing is a technique for the verification of software output without a complete testing oracle. Mathematical optimization, implemented in software, is a problem for which verification can often be challenging. In this paper, we apply metamorphic testing to one such optimization problem, the quadratic assignment problem (QAP). From simple observations of the properties of the QAP, we describe how to derive a number of metamorphic relations useful for verifying the correctness of a QAP solver. We then compare the effectiveness of these metamorphic relations, in "killing" mutant versions of an exact QAP solver, to a simulated oracle. We show that metamorphic testing can be as effective as the simulated oracle for killing mutants. We examine the relative effectiveness of different metamorphic relations, both singly and in combination, and conclude that combining metamorphic relations can be significantly more effective than using a single relation. © 2011 World Scientific Publishing Company. |
| 学科主题 | Computer Science ; Engineering |
| 收录类别 | EI ; SCI |
| 资助信息 | National Natural Science Foundation of China60721061; Australian Research Council (ARC)LX0776490 |
| 语种 | 英语 |
| WOS记录号 | WOS:000293093800007 |
| 公开日期 | 2013-10-08 |
| 源URL | [http://ir.iscas.ac.cn/handle/311060/16011]  |
| 专题 | 软件研究所_软件所图书馆_期刊论文 |
| 推荐引用方式 GB/T 7714 | Merkel Robert,Wang Daoming,Lin Huimin,et al. automatic verification of optimization algorithms: a case study of a quadratic assignment problem solver[J]. International Journal of Software Engineering and Knowledge Engineering,2011,21(2):289-307. |
| APA | Merkel Robert,Wang Daoming,Lin Huimin,&Chen Tsong Yueh.(2011).automatic verification of optimization algorithms: a case study of a quadratic assignment problem solver.International Journal of Software Engineering and Knowledge Engineering,21(2),289-307. |
| MLA | Merkel Robert,et al."automatic verification of optimization algorithms: a case study of a quadratic assignment problem solver".International Journal of Software Engineering and Knowledge Engineering 21.2(2011):289-307. |
入库方式： OAI收割
来源：软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。