CN111291373B - Method, apparatus and computer-readable storage medium for analyzing data pollution propagation - Google Patents
Method, apparatus and computer-readable storage medium for analyzing data pollution propagation Download PDFInfo
- Publication number
- CN111291373B CN111291373B CN202010078574.6A CN202010078574A CN111291373B CN 111291373 B CN111291373 B CN 111291373B CN 202010078574 A CN202010078574 A CN 202010078574A CN 111291373 B CN111291373 B CN 111291373B
- Authority
- CN
- China
- Prior art keywords
- data
- node
- nodes
- pollution
- variables
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/50—Monitoring users, programs or devices to maintain the integrity of platforms, e.g. of processors, firmware or operating systems
- G06F21/55—Detecting local intrusion or implementing counter-measures
- G06F21/56—Computer malware detection or handling, e.g. anti-virus arrangements
- G06F21/562—Static detection
- G06F21/563—Static detection by source code analysis
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2221/00—Indexing scheme relating to security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F2221/03—Indexing scheme relating to G06F21/50, monitoring users, programs or devices to maintain the integrity of platforms
- G06F2221/033—Test or assess software
Landscapes
- Engineering & Computer Science (AREA)
- Computer Security & Cryptography (AREA)
- Computer Hardware Design (AREA)
- General Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Health & Medical Sciences (AREA)
- General Health & Medical Sciences (AREA)
- Virology (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The present invention relates to a method, apparatus and computer-readable storage medium for analyzing data pollution propagation. The method comprises the following steps: step 1: collecting global variables and local variables in all classes so as to obtain data information of all variables; and 2, step: and analyzing the data information one by one to form an association relation among the data information. The invention solves the problem that the existing data pollution transmission is only described theoretically and has no specific implementation mode, so that the data transmission process is completely expressed, any node can be searched, the node can be quickly positioned, and the source of the data can be quickly traced.
Description
Technical Field
The present invention relates to the technical field of source code security detection, and in particular, to a method, apparatus, and computer-readable storage medium for analyzing data pollution propagation.
Background
At present, data flow analysis is the most important analysis method for software source code security detection tools. Data flow analysis mainly analyzes security problems caused by improper use of data in a program propagation process or data pollution. Data pollution propagation theory has been long-standing, but the representation and storage of data streams is very difficult due to the complexity and diversity of data propagation. Firstly, there are various programming languages in reality, including high-level languages, script-type languages, object-oriented languages, and process-oriented languages, and the definitions of the basic data types in each language are different. Secondly, the data is processed differently in the transmission process, and the most basic processing to the data is shown as "+" or "buffer. The second is to process the data with different functions, which can be the one that refers to the third party or the one that is self-defined. But during the analysis it is determined whether this function cleaned the data and if so, the contamination is propagated to this end. If there is no clean up, it is determined whether the propagation is to continue down.
Disclosure of Invention
The object of the invention is to provide a method, a device and a computer-readable storage medium for analyzing data pollution propagation, which allow a complete representation of the flow of data propagation.
Specifically, how to completely express the flow of data propagation is the key point for analyzing the data flow, and the expression mode can meet the requirement of searching any node, can quickly locate the node, and can quickly trace to the source of the data. All information of the node must meet the analysis requirement, and the link information of the node must be searched at any time. A data storage method and an efficient algorithm are needed to meet these requirements.
Technical objects that can be achieved by the present invention are not limited to what has been particularly described above, and other technical objects that are not described herein will be more clearly understood by those skilled in the art from the following detailed description.
The technical scheme for solving the technical problems is as follows:
according to one aspect of the present disclosure, there is provided a method for analyzing data pollution propagation, characterized in that the method comprises: step 1: collecting global variables and local variables in all classes so as to obtain data information of all variables; step 2: and analyzing the data information one by one to form an association relation among the data information.
Optionally, in the method as described above, in step 1, all of the global variables and the local variables are defined as a plurality of data nodes, it is determined whether the data node is a pollution source node, then the attribute of each of the plurality of data nodes is obtained, and the plurality of data nodes are combined into a final data information table.
Optionally, in the method as described above, the attribute of the data node includes an ID, a name of a function where the data node is located, a name of a variable of the data node, a number of lines where the data node is located, a reference node of the data node, whether the data node is a global variable, and whether the data node is a pollution source node.
Optionally, in the method as described above, if a data node is a local variable, the attribute of the data node further includes a name of the method in which the data node is located; if the data node is all variables, the attribute of the data node also comprises the name of the class in which the data node is located; if the data node is a pollution source node, the data node is marked as a pollution source node and is stored in a pollution source table, and the pollution source node also serves as the first node of the data link table.
Optionally, in the method as described above, in step 2, the context relationship between different data nodes is searched for through the data node used by the current data node, wherein the node using the pollution source node is taken as a child node of the pollution source node.
Optionally, in the method as described above, a final data information table is sorted according to names of data nodes, each data node in the final data information table is traversed, a reference node of the data node is found, the data node and the reference node thereof are stored in a data link, a data link Key to which the data node belongs is recorded at the same time, and a Map object storing all data links is finally generated, so as to obtain a data transfer process of data information.
Optionally, in the method as described above, the current data node can reference a plurality of data nodes, and if the current data node references a plurality of data nodes, the current data node belongs to two data links.
According to one aspect of the present disclosure, the present invention provides an apparatus for analyzing data pollution propagation, characterized by comprising: memory, processor and computer program stored on the memory and executable on the processor, which when executed by the processor implements the steps of a method for analyzing data pollution propagation as defined in any of the above.
According to an aspect of the present disclosure, the present invention provides a computer-readable storage medium, wherein the computer-readable storage medium stores an implementation program of information transfer, and the program, when executed by a processor, implements the steps of the method for analyzing data pollution propagation as described in any one of the above.
The above-described embodiments are only some of the embodiments of the present invention, and those skilled in the art can derive and understand various embodiments including technical features of the present invention from the following detailed description of the present invention.
The technical scheme of the invention adopts a data node mode to record the data information, and is simple, easy to expand and easy to use. The data in the data information table are sorted according to the names, so that the data can be quickly searched and is more convenient to use. All the node information is stored in the data information table, and the table can be directly searched for subsequent operations in all data aspects without searching for a syntax tree, so that the use efficiency is greatly improved. The nodes with data crossed are independently recorded as a plurality of data links, so that disorder is not easy to occur. The data link is recorded in an array mode, and the method is simple and easy to use. The data information table may be used as a data dictionary table or a data index table. The data pollution point and the data transmission process are recorded in detail and are easy to use.
It will be appreciated by persons skilled in the art that the effects that can be achieved by the present invention are not limited to what has been particularly described hereinabove and other advantages of the present invention will be more clearly understood from the following detailed description.
Drawings
The accompanying drawings, which are included to provide a further understanding of the invention, illustrate embodiments of the invention and together with the description serve to explain the principle of the invention.
FIG. 1 is a flow chart of a method for analyzing data pollution propagation according to an embodiment of the present invention.
Fig. 2-3 are schematic diagrams of a method for analyzing data pollution propagation according to an embodiment of the present invention.
Fig. 4 is a schematic diagram of an apparatus for analyzing data pollution propagation according to an embodiment of the present invention.
Detailed Description
Reference will now be made in detail to exemplary embodiments of the invention, examples of which are illustrated in the accompanying drawings. The detailed description, which will be given below with reference to the accompanying drawings, is intended to explain exemplary embodiments of the present invention, rather than to show the only embodiments that can be implemented according to the present invention. The following detailed description includes specific details in order to provide a thorough understanding of the invention. It will be apparent, however, to one skilled in the art that the present invention may be practiced without these specific details.
In some instances, well-known structures and devices are omitted or shown in block diagram form, focusing on important features of the structures and devices so as not to obscure the concept of the present invention. The same reference numbers will be used throughout the specification to refer to the same or like parts.
The principles and features of this invention are described below in conjunction with the following drawings, which are set forth by way of illustration only and are not intended to limit the scope of the invention.
In the description of the present invention, it is to be understood that the terms "upper", "lower", "center", "inner", "outer", "top", "bottom", and the like, indicate orientations or positional relationships based on the orientations or positional relationships shown in the drawings, and are only for convenience in describing the present invention and simplifying the description, but do not indicate or imply that the device or element referred to must have a particular orientation, be constructed and operated in a particular orientation, and thus, should not be construed as limiting the present invention.
In the description of the present invention, it should be noted that, unless otherwise explicitly specified or limited, the terms "mounted," "connected," and "connected" are to be construed broadly, e.g., as meaning either a fixed connection, a removable connection, or an integral connection; can be mechanically or electrically connected; they may be connected directly or indirectly through intervening media, or they may be interconnected between two elements. Source code refers to the source code of a computer programming language. The different source codes consist of the keywords and basic grammar of the language. The defects refer to defects of programs caused by unreasonable design or improper use and the like appearing in source codes. Vulnerabilities refer to security threats arising in source code due to unreasonable code design. Data flow refers to the flow and transfer of data in a software program. The JAVA language refers to an object-oriented software program language developed by Sun corporation. Pollution propagation refers to the transfer of unsafe data in software to other functions or other objects. The specific meanings of the above terms in the present invention can be understood in specific cases to those skilled in the art.
Example 1
FIG. 1 illustrates a flow chart of a method for analyzing data pollution propagation provided by an embodiment of the present invention. An embodiment of the present invention provides a method for analyzing data pollution propagation, where the method includes: step 1: collecting global variables and local variables in all classes so as to obtain data information of all variables; and 2, step: and analyzing the data information one by one to form an association relation among the data information. Optionally, in step 1, all variables in the global variables and the local variables are defined as a plurality of data nodes, it is determined whether the data nodes are pollution source nodes, then the attributes of each of the plurality of data nodes are obtained, and the plurality of data nodes are combined into a final data information table. Optionally, the attribute of the data node includes an ID, a name of a function where the data node is located, a name of a variable of the data node, a number of lines where the data node is located, a reference node of the data node, whether the data node is a global variable, and whether the data node is a pollution source node. Optionally, if the data node is a local variable, the attribute of the data node further includes a name of the method in which the data node is located; if the data node is all variables, the attribute of the data node also comprises the name of the class in which the data node is located; if the data node is a pollution source node, the data node is marked as a pollution source node and is stored in a pollution source table, and the pollution source node also serves as the first node of the data link table. Optionally, in step 2, the context relationship between different data nodes is searched through the data node used by the current data node, wherein the node using the pollution source node is taken as a child node of the pollution source node. Optionally, sorting a final data information table according to names of data nodes, traversing each data node in the final data information table, finding a reference node of the data node, storing the data node and the reference node in a data link, recording a data link Key to which the data node belongs, and finally generating a Map object storing all data links, thereby obtaining a data transmission process of the data information. Alternatively, the current data node can reference multiple data nodes, and if the current data node references multiple data nodes, the current data node belongs to both data links.
According to an embodiment of the present invention, the present invention defines three data results to store all nodes and to construct the order of data propagation. The first data structure is a pollution source table, where all the polluted nodes are placed. The second data structure is a large table that holds all the nodes. The third data structure is a data linked list and a Map for storing the linked list.
The global variables and the local variables in all classes are collected firstly, and all the variables are defined as a Node (namely a data Node). And marking the attribute of the Node, such as the name of the class where the Node is located, and marking the name of the method where the Node is located if the Node belongs to the local variable. If the current node belongs to a pollution Source node (i.e., Source point), then this attribute is noted (i.e., the data node is a pollution Source node). And place this node in the pollution source table. These pollution source nodes are also the first nodes of the data link list. Another important attribute is that the current node may reference multiple nodes. After all variables are collected sequentially, all data information is obtained.
The first step obtains basic data, and the second step analyzes the data one by one to form the incidence relation among the data. The context relationship between different nodes is established mainly by the nodes referenced by the current node, i.e. it is a relationship lookup from bottom to top. Each data chain is recorded with a name, a Source point is used as a starting node of the data chain, and a node used for the data chain is a child node of the data chain. When a link relationship is found, it is placed in the linked list result. And labeling the name of the linked list to the current node. Since nodes are unordered and there are multiple references. Each referenced instance is recorded once within the linked list. Where node duplication is possible. Thus, all nodes in the data table are traversed, and the link table is repeatedly operated (new links are inserted, old links are searched, old links are modified, and links are merged). And finally, obtaining a final data structure.
According to a more specific embodiment, the actual operation of the method of the invention can be seen with reference to fig. 2 and 3. The invention is realized in two steps. Firstly, collecting all data points, carrying out attribute labeling on each data node, and generating the name of the data node, wherein the key points are a class name, a function name, a variable name of the node, the line number of the node and a reference node of the current node. And whether the current node is a Source point. The complete data record set shown in fig. 2 is obtained after all the nodes are collected. The second step prepares the data structure. A data link is placed in an array set, and the sequence of the data link is the sequence in the array. A sequential ID is generated for each data link. And traversing all nodes in the data set to generate a plurality of data links. For example, the specific implementation steps are as follows:
obtaining a syntax tree of a class, and obtaining a global variable of the class, for example, in JAVA language, public String name ═ wang dong "; public Int ═ 20; these two variable declarations are two data nodes.
And then traversing all function bodies of the current class to obtain all local variables in the function bodies, including parameter values of the current function. For example, public List getUserInfo (Int deparatmentId), that is deparatmentId, is a data node.
For example, the attributes of a data node are: ID (unique primary key), ClassName (class name where), FunName (function name where), callnode ID (data node referenced by current node), IsPublic (whether it is a global variable), IsSourceNode (whether it is a data dirty point), SourceFunc (dirty function name).
If a data node is a Source point, the node is placed in a Source List queue.
And traversing each class in turn to obtain all variables. The generated data nodes form a final data information table.
And sequencing the data information table according to the data node names.
A Map is generated to store all the data links. A Source point is the starting point of a data link and its transfer point is the next node. Each node in the data information table is traversed to find its reference node. They are placed in a data link. The data link is stored in a Key in the Map.
If a link has no source point, it is also stored in Map.
If a node has multiple reference nodes, then the node belongs to two data links.
When a node is recorded in a data link, the link Key to which the node belongs is recorded at the same time.
Finally, a Map object is generated for storing all data links, and any data transfer process can be taken in the Map object.
A fast lookup algorithm may be used to query any node in the data information table. And obtaining the link Key of the node, thereby obtaining the data link of the node.
Example 2
According to an embodiment of the present invention, there is provided an apparatus for analyzing data pollution propagation, as shown in fig. 4, including: a memory 10, a processor 12 and a computer program stored on the memory 10 and executable on the processor 12, the computer program, when executed by the processor 12, implementing the steps of the method for analyzing data pollution propagation as described in embodiment 1 above.
Example 3
According to an embodiment of the present invention, there is provided a computer-readable storage medium having stored thereon an information transfer implementing program which, when executed by a processor, implements the steps of the method for analyzing data pollution propagation as described in embodiment 1 above.
The technical scheme of the invention adopts a data node mode to record the data information, and is simple, easy to expand and easy to use. The data in the data information table are sorted according to the names, so that the data can be quickly searched and is more convenient to use. All the node information is stored in the data information table, and the table can be directly searched for subsequent operations in all data aspects without searching for a syntax tree, so that the use efficiency is greatly improved. The nodes with data crossed are recorded as a plurality of data links independently, so that disorder is not easy to occur. The data link is recorded in an array mode, and the method is simple and easy to use. The data information table may be used as a data dictionary table or a data index table. The data pollution point and the data transmission process are recorded in detail and are easy to use.
From the above description of the embodiments, it is obvious for those skilled in the art that the present application can be implemented by software and necessary general hardware, and of course, can also be implemented by hardware. Based on such understanding, the technical solutions of the present application may be embodied in the form of a software product, which may be stored in a computer-readable storage medium, such as a floppy disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a FLASH Memory (FLASH), a hard disk or an optical disk of a computer, and includes several instructions for enabling a computer device (which may be a personal computer, a server, or a network device) to execute the methods described in the embodiments of the present application.
As mentioned above, a detailed description of the preferred embodiments of the invention has been given to enable those skilled in the art to make and practice the invention. Although the present invention has been described with reference to exemplary embodiments, those skilled in the art will appreciate that various modifications and changes can be made in the present invention without departing from the spirit or scope of the invention described in the appended claims. Thus, the present invention is not intended to be limited to the particular embodiments shown and described herein, but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.
Claims (7)
1. A method for analyzing data pollution propagation, the method comprising:
step 1: collecting global variables and local variables in all classes so as to obtain data information of all variables;
defining all variables in the global variables and the local variables into a plurality of data nodes in step 1, determining whether the data nodes are pollution source nodes, then obtaining the attribute of each of the data nodes, and forming a final data information table by the data nodes;
step 2: analyzing the data information one by one to form an association relation among the data information;
in step 2, according to the names of the data nodes, a final data information table is sorted, each data node in the final data information table is traversed, a reference node of the data node is found, the data node and the reference node are stored in a data link, a data link Key to which the data node belongs is recorded at the same time, and a Map object for storing all the data links is finally generated, so that the data transmission process of the data information is obtained.
2. The method of claim 1, wherein the first and second light sources are selected from the group consisting of,
the method is characterized in that the attributes of the data nodes comprise an ID, a function name of the data node, a variable name of the data node, a line number of the data node, a reference node of the data node, whether the data node is a global variable and whether the data node is a pollution source node.
3. The method of claim 1, wherein the first and second light sources are selected from the group consisting of,
if the data node is a local variable, the attribute of the data node also comprises the name of the method where the data node is located; if the data node is all variables, the attribute of the data node also comprises the name of the class in which the data node is located; if the data node is a pollution source node, the data node is marked as a pollution source node and is stored in a pollution source table, and the pollution source node also serves as the first node of the data link table.
4. The method of claim 3, wherein the first and second light sources are selected from the group consisting of,
in step 2, the context relationship between different data nodes is searched through the data node used by the current data node, wherein the node using the pollution source node is taken as a child node of the pollution source node.
5. The method of claim 1, wherein the first and second light sources are selected from the group consisting of,
wherein the current data node is capable of referencing multiple data nodes, and wherein the current data node belongs to two data links if the current data node references multiple data nodes.
6. An apparatus for analyzing data pollution propagation, comprising: memory, processor and computer program stored on the memory and executable on the processor, which computer program, when executed by the processor, carries out the steps of the method for analyzing data pollution propagation according to any one of claims 1 to 5.
7. A computer-readable storage medium, characterized in that it has stored thereon a program for implementing an information transfer, which program, when being executed by a processor, carries out the steps of the method for analyzing data pollution propagation according to any one of claims 1 to 5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010078574.6A CN111291373B (en) | 2020-02-03 | 2020-02-03 | Method, apparatus and computer-readable storage medium for analyzing data pollution propagation |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010078574.6A CN111291373B (en) | 2020-02-03 | 2020-02-03 | Method, apparatus and computer-readable storage medium for analyzing data pollution propagation |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111291373A CN111291373A (en) | 2020-06-16 |
| CN111291373B true CN111291373B (en) | 2022-06-14 |
Family
ID=71021563
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010078574.6A Active CN111291373B (en) | 2020-02-03 | 2020-02-03 | Method, apparatus and computer-readable storage medium for analyzing data pollution propagation |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111291373B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114710301A (en) * | 2020-12-16 | 2022-07-05 | 中国移动通信有限公司研究院 | Data pollution degree determination method and device and storage medium |
Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101661543A (en) * | 2008-08-28 | 2010-03-03 | 西门子（中国）有限公司 | Method and device for detecting security flaws of software source codes |
| CN102567183A (en) * | 2011-12-08 | 2012-07-11 | 清华大学 | Tainted variable tracking method |
| CN103455759A (en) * | 2012-06-05 | 2013-12-18 | 深圳市腾讯计算机系统有限公司 | Page loophole detection device and page loophole detection method |
| CN103809966A (en) * | 2012-11-08 | 2014-05-21 | 国际商业机器公司 | Data-flow analysis method and device |
| CN105723340A (en) * | 2013-11-08 | 2016-06-29 | 日本电气株式会社 | Information processing device, information processing method, recording medium, calculation processing device, calculation processing method |
| CN105955877A (en) * | 2016-04-19 | 2016-09-21 | 西安交通大学 | Taint analysis method for dynamic parallel program based on symbolic computation |
| CN106709356A (en) * | 2016-12-07 | 2017-05-24 | 西安电子科技大学 | Static taint analysis and symbolic execution-based Android application vulnerability discovery method |
| CN108319858A (en) * | 2018-01-29 | 2018-07-24 | 中国科学院信息工程研究所 | For the data dependence graph construction method and device of uneasy total function |
| CN109002712A (en) * | 2018-06-22 | 2018-12-14 | 北京大学 | A kind of Contaminated Data Analysis method, system and electronic equipment based on value dependency graph |
| CN109002721A (en) * | 2018-07-12 | 2018-12-14 | 南方电网科学研究院有限责任公司 | A kind of mining analysis method of information security loophole |
| CN109324971A (en) * | 2018-09-30 | 2019-02-12 | 中国人民解放军国防科技大学 | Software data flow analysis method based on intermediate language and taint analysis |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7451065B2 (en) * | 2002-03-11 | 2008-11-11 | International Business Machines Corporation | Method for constructing segmentation-based predictive models |
| CN101482847B (en) * | 2009-01-19 | 2011-06-29 | 北京邮电大学 | Detection method based on safety bug defect mode |
| CN107169358B (en) * | 2017-05-24 | 2019-10-08 | 中国人民解放军信息工程大学 | Code homology detection method and its device based on code fingerprint |
| CN109583200B (en) * | 2017-09-28 | 2021-04-27 | 中国科学院软件研究所 | Program abnormity analysis method based on dynamic taint propagation |
-
2020
- 2020-02-03 CN CN202010078574.6A patent/CN111291373B/en active Active
Patent Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101661543A (en) * | 2008-08-28 | 2010-03-03 | 西门子（中国）有限公司 | Method and device for detecting security flaws of software source codes |
| CN102567183A (en) * | 2011-12-08 | 2012-07-11 | 清华大学 | Tainted variable tracking method |
| CN103455759A (en) * | 2012-06-05 | 2013-12-18 | 深圳市腾讯计算机系统有限公司 | Page loophole detection device and page loophole detection method |
| CN103809966A (en) * | 2012-11-08 | 2014-05-21 | 国际商业机器公司 | Data-flow analysis method and device |
| CN105723340A (en) * | 2013-11-08 | 2016-06-29 | 日本电气株式会社 | Information processing device, information processing method, recording medium, calculation processing device, calculation processing method |
| CN105955877A (en) * | 2016-04-19 | 2016-09-21 | 西安交通大学 | Taint analysis method for dynamic parallel program based on symbolic computation |
| CN106709356A (en) * | 2016-12-07 | 2017-05-24 | 西安电子科技大学 | Static taint analysis and symbolic execution-based Android application vulnerability discovery method |
| CN108319858A (en) * | 2018-01-29 | 2018-07-24 | 中国科学院信息工程研究所 | For the data dependence graph construction method and device of uneasy total function |
| CN109002712A (en) * | 2018-06-22 | 2018-12-14 | 北京大学 | A kind of Contaminated Data Analysis method, system and electronic equipment based on value dependency graph |
| CN109002721A (en) * | 2018-07-12 | 2018-12-14 | 南方电网科学研究院有限责任公司 | A kind of mining analysis method of information security loophole |
| CN109324971A (en) * | 2018-09-30 | 2019-02-12 | 中国人民解放军国防科技大学 | Software data flow analysis method based on intermediate language and taint analysis |
Non-Patent Citations (8)
| Title |
|---|
| 《Detecting malicious nodes in MANET using rateless codes for maximum content distribution》;Suganthi N.等;《2014 Sixth International Conference on Advanced Computing (ICoAC)》;20150831;第308-311页 * |
| 《The Tube: A Rapidly Deployable Wireless Sensor Platform for Supervising Pollution of Emergency Work》;Huang-Chen Lee等;《IEEE Transactions on Instrumentation and Measurement》;20120613;第61卷(第10期);第2776-2786页 * |
| 《一种全局数据流分析方法研究与实现》;沈若也;《中国优秀硕士学位论文全文数据库（电子期刊）》;20181115(第11期);信息科技辑第I138-293页 * |
| 《基于污点指针的二进制代码缺陷检测》;刘杰等;《计算机工程》;20121231;第38卷(第24期);第46-49页 * |
| 《基于稀疏框架的静态污点分析优化技术》;王蕾等;《计算机研究与发展》;20190331;第56卷(第3期);第480-495页 * |
| 《基于静态污点分析技术的软件内核驱动安全性检测》;倪涛;《计算机应用与软件》;20150531;第32卷(第5期);第262-266页 * |
| 《所谓的全局污染》;行进中的技术唛;《https://blog.csdn.net/sinat_30961847/article/details/83819775》;20181107;第1-2页 * |
| 《污点分析技术的原理和实践应用》;王蕾等;《软件学报》;20180430;第28卷(第4期);第860-882页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111291373A (en) | 2020-06-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109445834B (en) | Program code similarity rapid comparison method based on abstract syntax tree | |
| CN110688456A (en) | Vulnerability knowledge base construction method based on knowledge graph | |
| Gao et al. | Navigating the data lake with datamaran: Automatically extracting structure from log datasets | |
| US8335779B2 (en) | Method and apparatus for gathering, categorizing and parameterizing data | |
| US20140108418A1 (en) | Searching code by specifying its behavior | |
| KR101617696B1 (en) | Method and device for mining data regular expression | |
| CN105095067A (en) | User interface element object identification and automatic test method and apparatus | |
| CN104834528A (en) | Dependency version processing plug-in and dependency version processing method adopting same | |
| US20150019592A1 (en) | Systems, methods and software for computing reachability in large graphs | |
| JP2020126641A (en) | Api mash-up exploration and recommendation | |
| CN112860727A (en) | Data query method, device, equipment and medium based on big data query engine | |
| CN115357904B (en) | Multi-class vulnerability detection method based on program slicing and graph neural network | |
| CN101055566B (en) | Function collection method and device of electronic data table | |
| Kamalabalan et al. | Tool support for traceability of software artefacts | |
| Abul-Basher et al. | Tasweet: optimizing disjunctive regular path queries in graph databases | |
| CN113297580A (en) | Code semantic analysis-based electric power information system safety protection method and device | |
| CN114564482A (en) | Multi-entity-oriented label system and processing method | |
| CN116301755A (en) | Automatic batch flow data marking framework construction method based on directed calculation graph | |
| CN111291373B (en) | Method, apparatus and computer-readable storage medium for analyzing data pollution propagation | |
| CN104424399B (en) | A kind of method, apparatus of the knowledge navigation based on virus protein body | |
| Petermann et al. | Graph mining for complex data analytics | |
| CN116663019B (en) | Source code vulnerability detection method, device and system | |
| CN106933844B (en) | Construction method of reachability query index facing large-scale RDF data | |
| Acosta-Mendoza et al. | A new algorithm for approximate pattern mining in multi-graph collections | |
| CN112799673B (en) | Network protocol data checking method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |