Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Fault confirmation method and system thereof

A fault and fault point technology, applied in the field of fault confirmation method and its system, can solve the problems of long execution time, unlimited testing, high false alarm rate, etc., and achieve the effect of solving massive false alarms at a small cost

Active Publication Date: 2015-02-18
BEIJING UNIV OF POSTS & TELECOMM
View PDF5 Cites 19 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

(3) The false alarm rate is high
This method has no direction in the detection process and has no restrictions on the input, which will cause unlimited testing or require a long execution time, and its detection efficiency is relatively low

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Fault confirmation method and system thereof
  • Fault confirmation method and system thereof
  • Fault confirmation method and system thereof

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0062] In this embodiment, when detecting a fault point, adding a constraint judgment statement before the suspected fault statement is equivalent to adding a node on the control flow graph, so that the constraint condition of reaching this node is the condition for the occurrence of the fault. Then the fault confirmation is transformed into the problem of judging whether this node has a reachable path, as long as it is proved that this node is reachable, the fault problem is confirmed.

[0063] The control flow graph CFG is a directed graph G=(N, E, nentry, nexit). Among them, N is a node set, and each statement in the program corresponds to a node in the graph; the edge set E={|n1, n2∈N and after n1 is executed, n2} may be executed immediately.

[0064] In this embodiment, the division by zero fault is taken as an example, and the initial procedure is as follows:

[0065]

[0066] When performing fault detection, just add a conditional judgment statement if(j==0){} before...

Embodiment 2

[0072] This embodiment takes path-related faults as an example, and the initial procedure is as follows:

[0073]

[0074]

[0075] image 3 shows the fault point control flow diagram of the second embodiment of the fault confirmation method of the present invention; Figure 4 A schematic diagram showing a fault confirmation mode of the second embodiment of the fault confirmation method of the present invention.

[0076] refer to image 3 , if the program is executed according to the true branch of line 15 of the code, before the line 18 judges the terminator of the string, arg is added 1 twice, and there is no judgment whether the string ends. If the string ends at the first arg++, the incremental skip terminator points to invalid memory because the end judgment operation has not passed.

[0077] In the above cases, the fault is related to the path of program execution, so the entire path where the fault occurs is taken as the condition for fault confirmation. Such ...

Embodiment 3

[0079] Figure 5 A structural diagram showing a set of fault points in the third embodiment of the fault confirmation method of the present invention; Figure 6 A structural diagram of the troubleshooting unreachable path and nodes of the third embodiment of the fault confirmation method of the present invention; Figure 7 It shows the execution process diagram of a fault confirmation method of the third embodiment of the fault confirmation method of the present invention.

[0080] In this embodiment, multiple faults can be confirmed at the same time. Firstly, in the program preprocessing, use the selected failure mode set to analyze all the suspected fault location sets, and then generate the connected path set of the fault point set according to the control flow graph, and eliminate the disconnected fault points, such as Figure 5 shown.

[0081] In the execution process, the inaccessible nodes and branches without calling relationship are excluded through the calling rel...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention relates to a fault confirmation method and a system thereof. The fault confirmation method comprises the following steps: S1, matching doubt fault points in the static analysis process by using a preset fault mode, screening the doubt fault points, and marking the doubt fault points in a control flow diagram of a tested program; S2, adding fault triggering conditions at the doubt fault points to form fault nodes, establishing a fault route, and adding newly generated fault nodes into the control flow diagram, and marking; S3, calculating the weight of each doubt fault point at each node according to preset route selection strategy; S4, traversing the control flow diagram, selecting a fault route according to the weight of each fault point at a present node, extracting a constraint of each node of the selected route to instruct dynamically executed valuing, and confirming each doubt fault point. According to the method, the route selection strategy and a dynamic symbol execution technique are combined in the execution process, and the program is instructed to efficiently cover fault condition nodes, so that the fault confirmation efficiency is improved.

Description

technical field [0001] The invention relates to the technical field of software testing, in particular to a fault confirmation method and system based on static analysis technology, virtual machine technology and dynamic symbol execution technology. Background technique [0002] The rapid development and wide application of information technologies such as computers, network communications, and software have promoted the modern society to move towards an information society, and a large number of faults and hidden dangers in operating systems and software have also made the current information security situation increasingly severe. Malicious attacks An attacker can exploit these security holes to elevate privileges, access unauthorized resources, and even destroy sensitive data. Software security loopholes have become one of the root causes of many system security problems, so how to find security loopholes in software is very important. [0003] Program Static Analysis (P...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Applications(China)
IPC IPC(8): G06F11/36
Inventor 金大海甄涛宫云战王雅文黄俊飞
Owner BEIJING UNIV OF POSTS & TELECOMM
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

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