Heuristic algorithms for distributed query processing
DPDS '88 Proceedings of the first international symposium on Databases in parallel and distributed systems
Introduction to algorithms
Semi-proving: an integrated method based on global symbolic evaluation and metamorphic testing
ISSTA '02 Proceedings of the 2002 ACM SIGSOFT international symposium on Software testing and analysis
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Metamorphic Testing of Programs on Partial Differential Equations: A Case Study
COMPSAC '02 Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment
Exploiting Symmetries to Test Programs
ISSRE '03 Proceedings of the 14th International Symposium on Software Reliability Engineering
Towards a Metamorphic Testing Methodology for Service-Oriented Software Applications
QSIC '05 Proceedings of the Fifth International Conference on Quality Software
Prioritizing JUnit Test Cases: An Empirical Assessment and Cost-Benefits Analysis
Empirical Software Engineering
Heuristic algorithms for real-time data aggregation in wireless sensor networks
Proceedings of the 2006 international conference on Wireless communications and mobile computing
Approximation algorithms for combinatorial problems
Journal of Computer and System Sciences
Hi-index | 0.03 |
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.