Journal
INTERNATIONAL JOURNAL OF SOFTWARE ENGINEERING AND KNOWLEDGE ENGINEERING
Volume 21, Issue 2, Pages 289-307Publisher
WORLD SCIENTIFIC PUBL CO PTE LTD
DOI: 10.1142/S021819401100527X
Keywords
Metamorphic testing; metamorphic relation; software testing; testing oracle; quadratic assignment problem
Categories
Funding
- National Natural Science Foundation of China [60721061]
- Australian Research Council (ARC) [LX0776490]
- Australian Research Council [LX0776490] Funding Source: Australian Research Council
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available