A Dirty Data Propagation Path Discovery Method Based on Complex Network

A complex network and discovery method technology, applied in software testing/debugging, etc., can solve problems such as unsupported binary program discovery

Active Publication Date: 2017-09-01
BEIJING INSTITUTE OF TECHNOLOGYGY
View PDF5 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

And the existing dirty data propagation technologies are all based on source code, and do not support the discovery of binary programs

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
  • A Dirty Data Propagation Path Discovery Method Based on Complex Network
  • A Dirty Data Propagation Path Discovery Method Based on Complex Network
  • A Dirty Data Propagation Path Discovery Method Based on Complex Network

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0025] The present invention will be further described in detail below in conjunction with the accompanying drawings.

[0026] The embodiment of the present invention is roughly divided into three parts: one is to decompile the binary file to obtain a processable source code or an analyzable intermediate language, which is completed using the IDA plug-in Hex-Rays; the other is to decompile the decompiled result Analyze and give the call relationship diagram of the function. This part is completed using the GNU compiler tool chain, Addr2line tool, and Graphviz tool; the third is to generate a complex network diagram with key nodes based on the relationship diagram, using graph theory and complex network Knowledge to find out the propagation path of dirty data.

[0027] Combine below figure 1 Describe the workflow of the present invention in detail:

[0028] 1. Decompile

[0029] After comparing multiple decompilation tools, the present invention decides to use IDA plug-in He...

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 provides a method for discovering dirty data propagation paths based on complex networks, which can translate binary programs without source codes, process the obtained results, and mine and generate useful information. Step 1: Decompile the binary file and get the intermediate code of C language. After testing a simple C language program, get the intermediate language code; Step 2: Capture the function call path and resolve the function address into a function Name, process and simplify, and generate a matrix format; finally generate a function call relationship graph; the third step: analyze the function call relationship graph, obtain node, edge, weight information, calculate node degree, and establish a complex network with key nodes Figure; the fourth step: According to the non-uniform characteristics of the power law distribution of the complex network graph, find out the points related to the construction of dirty data and the points with high calling frequency.

Description

technical field [0001] The invention relates to a method for discovering a dirty data propagation path based on a complex network, and belongs to the technical field of software security. Background technique [0002] In the research methods based on complex networks, there are many concepts and methods that can be used to reflect the relevant statistical characteristics of the network, the most important of which is the degree distribution of nodes. In a software network, the degree of a node can be extended to the number of times the class is called by other classes in the software. So, intuitively, the more a class is called, the more important it is. However, software networks are generally weighted and directed networks, and it is not accurate to measure the importance of classes only from the "degree". For example, for a class with a special function, its degree is not great, but if it is removed from the software, it may directly cause the software to be inoperable....

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 Patents(China)
IPC IPC(8): G06F11/36
Inventor 胡昌振赵小林郝刚薛静锋马锐
Owner BEIJING INSTITUTE OF TECHNOLOGYGY
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap