Higher order variation testing method based on statement dominance relation and two-stage genetic algorithm
A genetic algorithm and sentence technology, applied in the field of computer software testing, can solve problems such as the inability of mutation sentences to play a role and the ineffectiveness of high-order mutations
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0033] Embodiments of the present invention will be described in detail below in conjunction with specific drawings and examples.
[0034] Step 1. High-order mutation sentence selection method based on sentence dominance relationship
[0035] 1.1 Basic concepts
[0036] Control flow graph (Control flow graph, CFG) is a graphical representation of program control structure, which is a directed graph G=(N,E,s,e) with the following structure, where the elements of N are called nodes of G , a certain statement of the corresponding program is not general; the element e of E ij =(n i ,n j ) is called the edge of G, which means from the statement n i to statement n j There is control flow. The control flow graph of each program also contains a unique entry node s and exit node e.
[0037] A path P refers to a sequence of nodes n 1 ,n 2 ,...,n l , satisfying the slave node n i to n i+1 There are edges, i=1,2,...,l-1. When program G takes X as input, the path traversed is ...
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