skip to main content
10.1145/2430475.2430483acmotherconferencesArticle/Chapter ViewAbstractPublication PagesinternetwareConference Proceedingsconference-collections
short-paper

A learning strategy for software testing optimization based on dynamic programming

Published:30 October 2012Publication History

ABSTRACT

The optimization of software testing is one of the essential problems. In this paper, a stochastic Markov Decision Process (MDP) model of software testing is proposed, and the process of software testing is described as a reinforcement learning problem. A learning strategy based on the policy iteration of dynamic programming is presented to obtain the optimal testing profile. The case study indicates that, compared with random testing strategy, our learning strategy can significantly reduce the testing cost to detect and remove a certain number of software defects.

References

  1. Cai KY. Optimal software testing and adaptive software testing in the context of software cybernetics. Information and Software Technology, 2002, 44(4):841--855.Google ScholarGoogle ScholarCross RefCross Ref
  2. Gao Y, Zhou RY, Wang H, Cao ZX. Study on an Average Reward Reinforcement Learning Algorithm. Chinese Journal of Computers, 2007, 30(8): 1372--1378.Google ScholarGoogle Scholar
  3. Sutton RS, Barto G A. Reinforcement learning. MIT Press, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Walton GH, Poore JH. Measuring complexity and coverage of software specifications. Information and Software Technology, 2000, 42(12):859--872.Google ScholarGoogle ScholarCross RefCross Ref
  5. Frankl PG, Hamlet RG, Littlewood B, Strigini L. Evaluating testing methods by delivered reliability. IEEE Trans. on Software Engineering, 1998, 24(6):586--601. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Berman O, Cutler M. Resource allocation during tests for optimally reliable software. Computers and Operations Research, 2004, 31(11):1847--1865. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Dai YS, Xie M, Poh KL, Yang B. Optimal testing-resource allocation with genetic algorithm for modular software systems. The Journal of Systems and Software, 2003, 66(1):47--55. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Tal O, McCollin C, Bendell A. An optimal statistical testing policy for software reliability demonstration of safety-critical systems. European Journal of Operational Research, 2002, 137(3):544--557.Google ScholarGoogle ScholarCross RefCross Ref
  9. Sahinoglu M, Mayrhauser VA, Hajjar A, Chen T, Anderson C. On the efficiency of a compound Poisson stooping-rule for mixed strategy testing. In: Proc. of the 4th Int'l High-Assurance Systems Engineering Symposium (HASE). 1999. 249--256.Google ScholarGoogle Scholar
  10. Sahinoglu M. An empirical Bayesian stopping rule in testing and verification of behavioral models. IEEE Trans. on Instrumentation and Measurement, 2003, 52(5):1428--1442.Google ScholarGoogle ScholarCross RefCross Ref
  11. Rajgopal J, Mazumdar M. Modular operational test plans for inferences on software reliability based on a Markov model. IEEE Trans. on Software Engineering, 2002, 28(4):358--363. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Cai KY, Li YC, Ning WY. Optimal software testing in the setting of controlled Markov chains. European Journal of Operational Research, 2005, 162(2):552--579.Google ScholarGoogle ScholarCross RefCross Ref
  13. Zhang DP, Nie CH, Xu BW. Cross-Entropy method based on Markov Decision Process for optimal software testing. Journal of Software, 2008, 19(10):2770--2779.Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. A learning strategy for software testing optimization based on dynamic programming

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Other conferences
        Internetware '12: Proceedings of the Fourth Asia-Pacific Symposium on Internetware
        October 2012
        204 pages
        ISBN:9781450318884
        DOI:10.1145/2430475

        Copyright © 2012 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 30 October 2012

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • short-paper

        Acceptance Rates

        Overall Acceptance Rate55of111submissions,50%

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader