Symbolic execution scheduling method and system for vulnerability path priorities
A technology of symbolic execution and scheduling method, applied in the field of power information security, can solve problems such as memory exhaustion, computer occupation, path explosion, etc., to achieve the effect of efficient discovery, efficient vulnerability paths, and reduced calculation amount
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0050] The embodiment of the present invention provides a vulnerability path priority symbolic execution scheduling method, which can be applied to the field of electric power information security technology, such as figure 1 shown, including the following steps:
[0051] Step S1: Obtain the readable text of the reverse compilation of the binary program to be exploited for vulnerabilities, and divide the readable text into multiple fragments, wherein each fragment contains at least one basic block.
[0052] In the embodiment of the present invention, a segment is divided based on a function, a function is divided into a segment, and a basic block is the smallest division unit. In a basic block, there is only one program execution entry and exit, and there is no branch.
[0053] Step S2: Calculate the complexity of each basic block, and calculate the complexity of the segment according to the complexity of each basic block.
[0054] In the embodiment of the present invention, ...
Embodiment 2
[0079] The embodiment of the present invention provides a symbolic execution scheduling system with vulnerability path priority, such as figure 2 shown, including:
[0080] Text acquisition module 1 is used to reverse compile the binary program to be exploited into readable text, and divide the readable text into multiple segments, wherein each segment contains at least one basic block; this module implements the The method described in step S1 will not be repeated here.
[0081] The segment complexity calculation module 2 is configured to calculate the segment complexity according to the complexity of each basic block; this module executes the method described in step S2 in Embodiment 2, which will not be repeated here.
[0082] The complexity calculation module 3 of the program execution path is used to calculate the complexity of the program execution path by using the complexity of the segments passed by the program execution path; this module executes the method describ...
Embodiment 3
[0087] An embodiment of the present invention provides a terminal, such as image 3 As shown, it includes: at least one processor 401 , such as a CPU (Central Processing Unit, central processing unit), at least one communication interface 403 , memory 404 , and at least one communication bus 402 . Wherein, the communication bus 402 is used to realize connection and communication between these components. Wherein, the communication interface 403 may include a display screen (Display) and a keyboard (Keyboard), and the optional communication interface 403 may also include a standard wired interface and a wireless interface. The memory 404 may be a high-speed RAM memory (Ramdom Access Memory, volatile random access memory), or a non-volatile memory (non-volatile memory), such as at least one disk memory. Optionally, the memory 404 may also be at least one storage device located away from the aforementioned processor 401 . Wherein, the processor 401 may execute the method for sc...
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