Test case set reduction method based on program slice
A technology of test case sets and test cases, applied in software testing/debugging, error detection/correction, instruments, etc., can solve problems such as deletion and affecting the error detection ability of test case sets, so as to achieve simple calculation process and save test time and work The effect of small amount, space and time complexity
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment
[0020] Through the program slicing algorithm of inter-procedural function calls, an intra-procedural slicing algorithm is given on the basis of the slicing algorithm. Based on the above-mentioned program slicing algorithm and GRE algorithm, this embodiment proposes a test case set reduction method. The test case set reduction method is recorded as the GRE-R-T algorithm. The GRE-R-T algorithm combines the test requirement reduction and the test case set reduction. Combining, generating a test case set corresponding to the statement in the slice, and finally reducing the test case set according to the GRE-R-T method.
[0021] attached figure 1 The flow chart of the slice algorithm based on the function call program, as attached figure 1 As shown, the program slicing algorithm mainly includes the following steps:
[0022] Step 1: Add the key points of the slice to be obtained into the node set N, and add the variables corresponding to the key points into the variable set V; acc...
test Embodiment Ne
[0035] 3) According to the definition, find out the essential test case Nec(T) and add it to the reduced test case set T', and delete the satisfied test requirements; delete the redundancy from T according to the coverage of the test cases to the test requirements Test case Red(T), until there are no essential test cases and redundant test cases in T;
[0036] 4) Regarding the GRE-R-T algorithm, find out |R(t i )|The largest test case, find out |R(t according to the complementary relationship between the test case sets m )∪R(t n )|The largest two test cases, if|R(t i )|m )∪R(t n )|, choose t m and t n Join to T', otherwise choose t i ; and delete satisfied test requirements until all test requirements are satisfied.
[0037] The specific implementation of the GRE-R-T algorithm described in this embodiment is as follows:
[0038] First input: the relationship between test cases and test requirements TR[n][m]; matrix representation, the number of test case sets n=|T|, th...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com