Font Size: a A A

Strategies To Accelerate Branch Bound Algorithm In Automatic Test Case Generation

Posted on:2016-05-12Degree:MasterType:Thesis
Country:ChinaCandidate:W XiongFull Text:PDF
GTID:2298330467992586Subject:Computer Science and Technology
Abstract/Summary:PDF Full Text Request
The most common method to ensure the quality of software is software testing. Software testing can be divided into unit testing, integration testing, system testing, and acceptance testing according to when it happens. Unit testing happens at the beginning of test phase, it’s the base of other kinds of testing. Unit testing is a software testing method by which individual units of source code, sets of one or more computer program modules together with associated control datum, and operating procedures are tested to determine if they are fit for use. Unit testing has an advantage in finding defects and faults early, and it costs little. So, it’s important to have a good strategy of unit testing. For a long time, the unit testing was accomplished by the developers or testers manually. This process has high risk and low efficiency. Automatic testing is a useful way to improve it.This article focuses on automatic test case generation in automatic unit testing. In path-oriented automatic testing, it’s a challenge to generate test case which satisfies constraints in the path. This article proposes five strategies:determine the intervals of variables based on inverse function, choose original value of variables by special information of variables, dynamic sorting of variables, binary rollback, and salutatory back-track to accelerate automatic test case generation.When applying these methods to CTS(Code test system), experiments show that these approaches can achieve a high code coverage and save time when applying them to some source code.
Keywords/Search Tags:software testing, unit testing, test case generation, branch bound algorithm
PDF Full Text Request
Related items