Font Size: a A A

The Study Of Test Case Secletion Algorithm Based On Requirement Priority In Regression Testing

Posted on:2013-03-07Degree:MasterType:Thesis
Country:ChinaCandidate:D W WangFull Text:PDF
GTID:2248330377456709Subject:Computer technology
Abstract/Summary:PDF Full Text Request
Program testing is essential to ensure program quality and reliability. According to thedevelopment stages of a program, testing can be classified into unit testing, integration testing,system testing, and acceptance testing. Furthermore, regression testing is executed if the programis modified during the development stages or the maintenance stage. Existent test cases arereused in regression testing. The optimal test case selection problem is to select the minimalnumber of test cases satisfying a required coverage criterion.Effective and efficient program testing is an important task in software testing. If theprogram being tested is complicated, selecting test cases using coverage criteria is an effectiveand systematic way to test and locate the bugs of the program. When a coverage criterion isselected, the minimal number of test cases is required to minimize the testingeffort.However, applying the optimal path set selection method to a complicatedprocedure-oriented program, the path set derived may not be optimal in some stages. Andexisting test case set selection methods in regression testing can not ensure that the test case setderived is optimal. And the optimal test case selection problem in object-oriented programtesting is rarely discussed.To solving the above problems, the foollowing work has been done in this thesis.First, in the light of the complicated procedure-oriented program testing, referring a kind ofthe optimal path set selection method based on zero-one integer-programming, the optimalrepresentative set selection problem and the optimal path set selection method in regressiontesting are researched.Then, the object-oriented program testing is discussed in this thesis. In view of that theamount of the concurrent path in the concurrent object-oriented program is very large, theoptimal test case selection problem of the concurrent object-oriented program testing is alsodiscussed in this thesis. Referring a kind of "two-step plus bottom-up" method, theobject-oriented program testing is reseached in this thesis. And this thesis discusses how to apply zero-one optimal path set selection method to concurrent object-oriented program testing.
Keywords/Search Tags:Regression testing, Greedy Algorithm, Optimal test case selection, Coverage criteria
PDF Full Text Request
Related items