中国科学院软件研究所机构知识库
Advanced  
ISCAS OpenIR  > 软件所图书馆  > 期刊论文
Subject: Computer Science ; Engineering
Title:
automatic verification of optimization algorithms: a case study of a quadratic assignment problem solver
Author: Merkel Robert ; Wang Daoming ; Lin Huimin ; Chen Tsong Yueh
Keyword: Computer software selection and evaluation ; Optimization ; Verification
Source: International Journal of Software Engineering and Knowledge Engineering
Issued Date: 2011
Volume: 21, Issue:2, Pages:289-307
Indexed Type: EI ; SCI
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
Sponsorship: National Natural Science Foundation of China60721061; Australian Research Council (ARC)LX0776490
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.
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.
Language: 英语
WOS ID: WOS:000293093800007
Citation statistics:
Content Type: 期刊论文
URI: http://ir.iscas.ac.cn/handle/311060/16011
Appears in Collections:软件所图书馆_期刊论文

Files in This Item:

There are no files associated with this item.


Recommended Citation:
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-01-01,21(2):289-307.
Service
Recommend this item
Sava as my favorate item
Show this item's statistics
Export Endnote File
Google Scholar
Similar articles in Google Scholar
[Merkel Robert]'s Articles
[Wang Daoming]'s Articles
[Lin Huimin]'s Articles
CSDL cross search
Similar articles in CSDL Cross Search
[Merkel Robert]‘s Articles
[Wang Daoming]‘s Articles
[Lin Huimin]‘s Articles
Related Copyright Policies
Null
Social Bookmarking
Add to CiteULike Add to Connotea Add to Del.icio.us Add to Digg Add to Reddit
所有评论 (0)
暂无评论
 
评注功能仅针对注册用户开放,请您登录
您对该条目有什么异议,请填写以下表单,管理员会尽快联系您。
内 容:
Email:  *
单位:
验证码:   刷新
您在IR的使用过程中有什么好的想法或者建议可以反馈给我们。
标 题:
 *
内 容:
Email:  *
验证码:   刷新

Items in IR are protected by copyright, with all rights reserved, unless otherwise indicated.

 

 

Valid XHTML 1.0!
Copyright © 2007-2022  中国科学院软件研究所 - Feedback
Powered by CSpace