Institutional Repository
| automatic verification of optimization algorithms: a case study of a quadratic assignment problem solver | |
| Merkel Robert; Wang Daoming; Lin Huimin; Chen Tsong Yueh | |
| 2011 | |
| Source | International Journal of Software Engineering and Knowledge Engineering
 |
| ISSN | 0218-1940 |
| Volume | 21Issue:2Pages:289-307 |
| English Abstract | 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. |
| Indexed Type | EI ; SCI |
| Keyword | Computer Software Selection And Evaluation Optimization Verification |
| Department | (1) Faculty of Information Technology Monash University Clayton VIC 3800 Australia; (2) Institute of Software Chinese Academy of Sciences 4 South Fourth Street Zhong Guan Cun Beijing 10090 China; (3) Centre for Software Analysis and Testing Swinburne University of Technology John Street Hawthorn 3122 Australia |
| Subject | Computer Science ; Engineering |
| Sponsorship | National Natural Science Foundation of China60721061; Australian Research Council (ARC)LX0776490 |
| Language | 英语 |
| WOS ID | WOS:000293093800007 |
| Citation statistics | |
| Content Type | 期刊论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/16011 |
| Collection | 中国科学院软件研究所 |
| Recommended Citation 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. |
| Files in This Item: | There are no files associated with this item. | |||||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment