Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, Epiciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Abstract : Algorithms which seek global optima are computationally expensive. Alternatively, heuristic methods have been proposed to find approximate solutions. Because heuristic algorithms do not always deliver exact solutions it is difficult to verify the computed solutions. Such a problem is known as the oracle problem. In this paper, we propose to apply Metamorphic Testing (MT) in such situations because MT is designed to alleviate the oracle problem and can be automated. We demonstrate the failure detection capability of MT on testing a heuristic method, called the Greedy Algorithm (GA), applied to solve the set covering problem (SCP). The experimental results show that MT is an effective method to test GA.
https://hal.inria.fr/hal-01572541 Contributor : Hal IfipConnect in order to contact the contributor Submitted on : Monday, August 7, 2017 - 4:51:16 PM Last modification on : Monday, August 7, 2017 - 4:53:37 PM
A. C. Barus, T. y. Chen, D. Grant, F. -C. Kuo, M. F. Lau. Testing of Heuristic Methods: A Case Study of Greedy Algorithm. 3rd Central and East European Conference on Software Engineering Techniques (CEESET), Oct 2008, Brno, Czech Republic. pp.246-260, ⟨10.1007/978-3-642-22386-0_19⟩. ⟨hal-01572541⟩