Detection method for security flaws in loop write-only memory of binary program

Abstract

The invention aims at providing a detection method for security flaws in a loop write-only memory of a binary program, comprising the following steps of: step 1, obtaining loop structure abstract information of a binary program, related to the potential security flaws in the binary program; step 2, generating test data according to the loop structure abstract information; and step 3, performing loop write-only memory security flaw detection on the binary program according to the test data. According to the method provided by the embodiment of the invention, when generating the test data, a process of traversing all the paths of the binary program loop structure is not needed, and the test data can be obtained just according to the generated loop structure abstract information. Since the loop structure abstract information is related to the potential security flaws of the binary program, the generated test data are targeted more, and the calculation overhead for detecting the security flaws is reduced greatly.

Description

technical field [0001] The invention relates to the field of computer software security analysis, in particular to a detection method for a binary program loop write memory security loophole. Background technique [0002] Buffer overflow vulnerabilities in binary programs usually occur in complex loop structures. When the code of a binary program contains nested loops, there is often complex code-to-code interaction, and such code may be more prone to potential security holes. For example, a binary program writes a memory security vulnerability cyclically. This security vulnerability refers to a memory access violation caused by not considering the boundary of the memory interval when the memory is cyclically written. [0003] At present, static analysis techniques are usually used to detect loopholes in binary programs that write memory security loops. Its working principle is to use static symbolic execution technology to generate test data, traverse all paths of the bin...

AI Technical Summary

Problems solved by technology

[0004] Unrolling loops is computationally expensive for real applications

The number of paths of the binary program loop structure may be very large. For example, if the number of iterations of a single loop depends on some unbounded inputs, the feasible paths of the binary program loop structure may also grow infinitely. Therefore, the loop structure in the binary program is Bottlenecks for Static Analysis

Images