Metamorphic testing of stochastic optimisation

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 375
  • Download : 0
Testing stochastic optimisation algorithms presents an unique challenge because of two reasons. First, these algorithms are non-testable programs, i.e. if the test oracle was known, there wouldn't have been the need for those algorithms in the first place. Second, their performance can vary depending on the problem instances they are used to solve. This paper applies the statistical metamorphic testing approach to stochastic optimisation algorithms and investigates the impact that different problem instances have on testing optimisation algorithms. The paper presents an empirical evaluation of the approach using instances of Next Release Problem (NRP). The effectiveness of the testing method is evaluated using mutation testing. The result shows that, despite the challenges from the stochastic nature of the optimisation algorithm, metamorphic testing can be effective in testing them. © 2010 IEEE.
Publisher
University of Nebraska Lincoln
Issue Date
2010-04-06
Language
English
Citation

3rd International Conference on Software Testing, Verification, and Validation Workshops, ICSTW 2010, pp.192 - 201

DOI
10.1109/ICSTW.2010.26
URI
http://hdl.handle.net/10203/224164
Appears in Collection
CS-Conference Papers(학술회의논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0