Enhancing Performance of Random Testing through Markov Chain Monte Carlo Methods

  • Authors:

  • Bo Zhou;Hiroyuki Okamura;Tadashi Dohi

  • Affiliations:

  • University of California, Riverside;Hiroshima University, Higashi-Hiroshima;Hiroshima University, Higashi-Hiroshima

  • Venue:
  • IEEE Transactions on Computers
  • Year:
  • 2013

Quantified Score

Hi-index 14.98

Visualization

Abstract

In this paper, we propose a probabilistic approach to finding failure-causing inputs based on Bayesian estimation. According to our probabilistic insights of software testing, the test case generation algorithms are developed by Markov chain Monte Carlo (MCMC) methods. Dissimilar to existing random testing schemes such as adaptive random testing, our approach can also utilize the prior knowledge on software testing. In experiments, we compare effectiveness of our MCMC-based random testing with both ordinary random testing and adaptive random testing in real program sources. These results indicate the possibility that MCMC-based random testing can drastically improve the effectiveness of software testing.