CN113721928A - Binary analysis-based dynamic library clipping method - Google Patents
Binary analysis-based dynamic library clipping method Download PDFInfo
- Publication number
- CN113721928A CN113721928A CN202111285971.1A CN202111285971A CN113721928A CN 113721928 A CN113721928 A CN 113721928A CN 202111285971 A CN202111285971 A CN 202111285971A CN 113721928 A CN113721928 A CN 113721928A
- Authority
- CN
- China
- Prior art keywords
- dynamic library
- analysis
- state
- code
- information
- 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.)
- Granted
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F8/00—Arrangements for software engineering
- G06F8/40—Transformation of program code
- G06F8/52—Binary to binary
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F8/00—Arrangements for software engineering
- G06F8/70—Software maintenance or management
- G06F8/72—Code refactoring
Landscapes
- Engineering & Computer Science (AREA)
- General Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Software Systems (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Stored Programmes (AREA)
Abstract
The invention discloses a dynamic library cutting method based on binary analysis, aiming at the problems that the compression rate is low in efficiency, a program additionally consumes CPU resources for decompression when running, even becomes unusable under certain conditions, and a large amount of useless codes increase the attack surface and the potential safety hazard of software. The invention is used for clipping the dynamic library.
Description
Technical Field
The invention belongs to the technical field of computers, and particularly relates to a dynamic library cutting method based on binary analysis.
Background
The dynamic library technology is widely applied to various kinds of software, solves the redundancy problem caused by static compiling, and enables a plurality of programs to share one library module. The mainstream system platform supports dynamic library technology, and in the Unix system, the dynamic library is an ELF file with so as to be suffixed, while in the Windows system, the dynamic library is a PE file with dll to be suffixed.
As software becomes increasingly complex, dynamic libraries become increasingly bulky, requiring the dynamic library to be fully loaded into memory space even if only one of the functions it provides is used. Moreover, when a third-party dynamic library with a closed source is used, if only a few functions are used, unnecessary hard disk overhead is brought to software installation. In addition, from the security perspective, the unnecessary code increases the attack surface of the software, and may bring convenience to an attacker to develop an exploit tool, such as gadget selection in the ROP technology. Therefore, it is important to reduce the size of the dynamic library, and the existing methods for reducing the size of the binary file are all to reduce the size of the binary file by compressing or deforming.
The problems existing in the prior art are as follows:
since the compression rate has a bottleneck, the compression rate may be very low in some cases. Furthermore, the morphed program may additionally consume CPU resources for decompression at runtime and may even become unusable in some cases. In addition to the above problems, for the third-party library, because the source code cannot be modified, once a security vulnerability occurs, the programs using the library are affected, and thus, a large amount of useless codes increase the attack surface and the security risk of the software.
Disclosure of Invention
Aiming at the problems that the compression rate is low in efficiency, a program additionally consumes CPU resources for decompression when running, even becomes unusable under certain conditions, and a large amount of useless codes increase the attack surface and the potential safety hazard of software, the invention provides a dynamic library cutting method based on binary analysis, which aims to: and analyzing and restoring the function call graph through data flow and control flow, converting other unused function codes into blank instructions according to the used library function, and eliminating the blank instructions on a file level through a binary rewriting technology to achieve the effect of reducing the volume.
In order to achieve the purpose, the invention adopts the technical scheme that: the dynamic library clipping method based on binary analysis comprises the following steps:
step 1: analyzing the target dynamic library module, analyzing the file format of the target dynamic library module, then separating the data section and the code section to obtain symbol information and repositioning information;
step 2: analyzing the data section and the code section through data flow analysis, and restoring a control flow diagram for recovering control flow information;
and step 3: restoring the function call graph, filtering out useless function information according to the user demand function set and the relocation information and the symbol information in the step 1, and filling the useless function information with a blank instruction to form a modified dynamic library;
and 4, step 4: disassembling the dynamic library modified in the step 3 into a code which can be assembled by using a binary rewriting technology, recovering link information, eliminating blank instructions on a text level, and reconstructing the code after the blank instructions are eliminated by using an assembler and a linker to generate a reconstructed dynamic library.
Preferably, the step 1 of the invention specifically comprises:
step 1.1: carrying out file format identification on the target dynamic library module, and judging the target system architecture of the target dynamic library module;
step 1.2: carrying out standard analysis on the target dynamic library module according to a file format corresponding to the target dynamic library module, and storing a data section, symbol information and relocation information, wherein the data section comprises a program loading substrate, an entry point and a dependency library;
step 1.3: intercepting a code segment for subsequent static analysis.
Preferably, the step 2 of the invention specifically comprises:
step 2.1: initializing an analysis environment;
step 2.2: disassembling and lifting the code segment into an intermediate representation;
step 2.3: analyzing the intermediate representation, processing the jump type statement and the non-jump type statement, and forming a constraint system of an abstract state in the form of a position and an edge;
step 2.4: based on a constraint system, calculating the state of each position by using data flow analysis to instantiate an indirect call concrete address to form a reachable state set;
step 2.5: and restoring the control flow graph according to the reachable state set.
Preferably, step 2.1 of the present invention specifically comprises: the initial analysis environment uses an abstract memory model to describe the memory, and different memory location types are divided by different regions.
Preferably, step 2.2 of the present invention specifically comprises:
step 2.2.1: disassembling the machine code at the corresponding position according to the current state of each part of the code segment;
step 2.2.2: loading a description file of the intermediate representation, wherein the description file is used for describing the mapping relation between the assembly instruction and the intermediate representation;
step 2.2.3: and promoting the current assembly instruction into a statement sequence of intermediate representation according to a corresponding rule.
Preferably, the processing mode for the jump-type statement and the non-jump-type statement in step 2.3 of the present invention specifically includes:
for the jump statement, generating an edge with assumed semantics, and determining the subsequent control flow according to the abstract state of the previous node;
for non-jump type sentences, directly taking the current sentence position and the state of the next adjacent sentence as nodes, and constructing edges by sentence semantics.
Preferably, step 2.4 of the present invention specifically comprises: performing data flow analysis through a worklist algorithm, receiving a state input by each edge, taking a subsequent state as an output, and taking the set of the output states of all the edges as an reachable state set; when one state input meets an edge with an assumed semantic meaning, whether the edge can pass through is judged according to whether the specific numerical value per se accords with the semantic meaning, and if one edge does not have the state output, the code of the part cannot be reached.
Preferably, step 2.5 of the present invention specifically comprises:
step 2.5.1: analyzing the reachable state set to obtain all edges with assumed semantics;
step 2.5.2: one end point of an edge with assumed semantics is used as the beginning of a basic block, the other end point is used as the end of the basic block, and two adjacent basic blocks are connected;
step 2.5.3: and dividing function boundaries for all basic blocks, and disconnecting edges between basic blocks of the cross-function.
Preferably, step 3 of the present invention specifically comprises:
restoring the function call graph, adding the initialization function into a useful function list, and filling the useless function information, namely the code part of the useless function, by using a blank instruction to generate a modified dynamic library.
Preferably, the step 4 of the invention is specifically as follows:
disassembling the modified dynamic library into a redirectable assembly file by using a binary rewriting technology, then recovering link information, removing blank instructions in the redirectable assembly file, and reconstructing the redirectable assembly file without the blank instructions by using an assembler and a linker to generate a reconstructed dynamic library.
Compared with the prior art, the technical scheme of the invention has the following advantages/beneficial effects:
1. the invention completes function call analysis by control flow restoration, can better solve the problem of indirect call, and avoids the condition that a function is called indirectly but classified as a useless code.
2. The invention safely removes the unused function and does not consume CPU resource for decompression during operation.
3. The invention eliminates the code part which cannot be used, and can reduce the memory resource occupied by the dynamic library.
4. The method and the device relieve the potential attack surface of the software, so that attackers cannot use the code segments for exploit development.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings that are required to be used in the embodiments will be briefly described below, it should be understood that the following drawings only illustrate some embodiments of the present invention and therefore should not be considered as limiting the scope, and for those skilled in the art, other related drawings can be obtained according to the drawings without inventive efforts.
FIG. 1 is a schematic diagram of a dynamic library clipping method based on binary analysis according to the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the technical solutions in the embodiments of the present invention are clearly and completely described below, and it is obvious that the described embodiments are a part of the embodiments of the present invention, not all of the embodiments of the present invention. All other embodiments, which can be obtained by a person skilled in the art without any inventive step based on the embodiments of the present invention, are within the scope of the present invention. Thus, the detailed description of the embodiments of the present invention provided below is not intended to limit the scope of the invention as claimed, but is merely representative of selected embodiments of the invention.
Step 1: analyzing the target dynamic library module, analyzing the file format of the target dynamic library module, then separating the data section and the code section to obtain symbol information and repositioning information;
step 1.1: carrying out file format identification on the target dynamic library module, and judging the target system architecture of the target dynamic library module;
step 1.2: carrying out standard analysis on the target dynamic library module according to a file format corresponding to the target dynamic library module, and storing a data section, symbol information and relocation information, wherein the data section comprises a program loading substrate, an entry point and a dependency library;
step 1.3: intercepting a code segment for subsequent static analysis.
Step 2: analyzing the data section and the code section through data flow analysis, and restoring a control flow diagram for recovering control flow information;
step 2.1: initializing an analysis environment, describing a memory by using an abstract memory model, and dividing different memory position types by different areas.
Step 2.2: disassembling and lifting the code segment into an intermediate representation;
step 2.2.1: disassembling the machine code at the corresponding position according to the current state of each part of the code segment;
step 2.2.2: loading a description file of the intermediate representation, wherein the description file is used for describing the mapping relation between the assembly instruction and the intermediate representation;
step 2.2.3: and promoting the current assembly instruction into a statement sequence of intermediate representation according to a corresponding rule.
Step 2.3: analyzing the intermediate representation to form a constraint system of an abstract state in the form of positions and edges; the processing mode of the jump type statement and the non-jump type statement is specifically as follows:
for the jump statement, generating an edge with assumed semantics, and determining the subsequent control flow according to the abstract state of the previous node;
for non-jump type sentences, directly taking the current sentence position and the state of the next adjacent sentence as nodes, and constructing edges by sentence semantics.
Step 2.4: based on a constraint system, calculating the state of each position by using data flow analysis to instantiate an indirect call concrete address to form a reachable state set; the method specifically comprises the following steps: performing data flow analysis through a worklist algorithm, receiving a state input by each edge, taking a subsequent state as an output, and taking the set of the output states of all the edges as an reachable state set; when one state input meets an edge with an assumed semantic meaning, whether the edge can pass through is judged according to whether the specific numerical value per se accords with the semantic meaning, and if one edge does not have the state output, the code of the part cannot be reached.
Step 2.5: and restoring the control flow graph according to the reachable state set.
Step 2.5.1: analyzing the reachable state set to obtain all edges with assumed semantics;
step 2.5.2: one end point of an edge with assumed semantics is used as the beginning of a basic block, the other end point is used as the end of the basic block, and two adjacent basic blocks are connected;
step 2.5.3: and dividing function boundaries for all basic blocks, and disconnecting edges between basic blocks of the cross-function.
And step 3: restoring the function call graph, filtering out useless function information according to the user demand function set and the relocation information and the symbol information in the step 1, and filling the useless function information with a blank instruction to form a modified dynamic library; the method specifically comprises the following steps: restoring the function call graph, adding the initialization function into a useful function list, and filling the useless function information, namely the code part of the useless function, by using a blank instruction to generate a modified dynamic library.
And 4, step 4: disassembling the dynamic library modified in the step 3 into a code which can be assembled by using a binary rewriting technology, recovering link information, eliminating blank instructions on a text level, and reconstructing the code after the blank instructions are eliminated by using an assembler and a linker to generate a reconstructed dynamic library. The method specifically comprises the following steps: disassembling the modified dynamic library into a redirectable assembly file by using a binary rewriting technology, then recovering link information, removing blank instructions in the redirectable assembly file, and reconstructing the redirectable assembly file without the blank instructions by using an assembler and a linker to generate a reconstructed dynamic library.
Example 1:
as shown in fig. 1. The invention provides a dynamic library cutting method based on binary analysis, which comprises the following steps:
step 1: and analyzing the target dynamic library module, identifying the file format of the target dynamic library module, and acquiring symbol information, repositioning information and the like.
The module analysis comprises the following specific steps: 1) identifying the file format of the target dynamic library module, and judging the target system architecture of the target dynamic library module, wherein the file format is an ELF file or a PE file, and judging the information of a system platform, an instruction architecture and the like where the file format is positioned according to the file format, for example, the ELF file of x86 belongs to a Unix series platform, and the PE file of x86 belongs to a Windows platform; 2) analyzing according to the corresponding file format standard, and saving a program loading base address, an entry point, a dependency library, relocation information, symbol information and the like; 3) a code segment portion of the target dynamic library is intercepted for subsequent static analysis.
Step 2: analyzing the data section and the code section through data flow analysis, and restoring a control flow diagram for recovering control flow information;
the specific steps for recovering control flow information are 1), initializing an analysis environment, such as initializing a stack pointer, an entry point state, clearing a state code and the like; 2) analyzing the intercepted code segment, and promoting the code segment into a middle representation, and 3) analyzing the middle representation to form a constraint system of an abstract state in the form of a position and an edge; 4) calculating the state of each position by using data flow analysis to instantiate an indirect call concrete address to form a reachable state set; 5) and restoring the control flow graph according to the reachable state set. The specific operation is as follows:
initializing an analysis environment, describing a memory by using an abstract memory model, and dividing different abstract memory address types by different regions, for example, an abstract address of a global region is represented by < global, offset >, and < global, offset > can also represent an immediate number besides an abstract address, such as < global,0x400000> simultaneously represents a value 0x400000 and an address 0x 400000; the abstract address of the stack area is represented by < func _ record, offset >, wherein func _ record represents the process to which the local data belongs; and the abstract address of the heap area is represented by < heap _ number, offset >, wherein the heap _ number is determined by the allocation times of the malloc and other functions. Secondly, an initial state is needed as a start, the initial state is a mapattece, register variables are mapped to abstract addresses, for example, the initial state of the main function can be set to init _ state = { esp→ { < func _ main,0> }, eax → { < global,1> }, which means that only one state of eax is 1, the value of esp is located at the top of the stack of the main function, and registers not involved are uniformly initialized to be empty.
The specific steps for promoting the code to be the intermediate representation are 1): disassembling the machine code at the corresponding position according to the current state of the code segment; 2): loading a description file of the intermediate representation, wherein the description file describes the mapping relation between the assembly instruction and the intermediate representation; 3): and promoting the current assembly instruction into a statement sequence of the intermediate representation according to the rule.
The conversion from assembly to intermediate representation is actually the decomposition of a complex instruction into more single-mode behavior instructions, for example, a push imm instruction is first decomposed into mov [ esp ], imm, sub esp, 4, and then converted into assignment statements, esp = imm, esp-4.
When the intermediate representation is analyzed, different types of statements need to be treated in different processing modes, and for the jump type statement, the specific conditions need to be judged, which can be divided into three cases: the first condition is unconditional jump, and an edge with assumed semantics is generated by taking the current position and a target position solved by an expression as an end point; the second case is the jump of function call, which can be divided into two statements of return address stack and unconditional jump, and then the semantic is explained; the third case is a conditional jump, where two edges with assumed semantics are generated, and for the true and false cases, the judgment basis of the conditional jump is the associated flag bit in the status register, so the generated assumed semantics are also the judgment of the status register variable, for example, when the opcode of the instruction is jz, the semantics of one edge is (assign ZF = 1) and the semantics of the other edge is (assign ZF = 1), where ZF represents the ZF flag of the status register. And for the non-jump type statement, directly taking the position of the current statement and the state of the next adjacent statement as nodes, and forming an edge by statement semantics.
The dataflow analysis uses a worklist algorithm for obtaining a reachable state set of each program point. Each edge receives a state input and takes a successor state as an output, and the semantics attached to the edge can be viewed as a transform function of the state, which transforms one state into another, and adds the state to the state set of the corresponding program point each time a different state is generated.
When one state meets the edge with the assumed semantics, whether the edge can pass through the edge is judged according to whether the specific numerical value per se accords with the semantics, and if one edge is not output, the position pointed by the edge is not reachable.
To improve performance, a boundary may be set for the number of states of a program point, and once the number of reachable states exceeds the boundary, the point state is labeled as a top symbol, representing an arbitrary state. For example, if the boundary value is 3, and the state of a program point in the worklist algorithm is state = { eax → { < global, 2>, < global, 4>, < global, 6>, < global, 8> }, ebx → { < global, 3> }, when eax has a state of 4 exceeding the boundary value, the state is converted to state = { eax → top, ebx → { < global, 3> }.
When the worklist algorithm stops, the whole data flow analysis reaches the fixed point, each program point has a reachable state set, and the set of all edge output states is the result of the data flow analysis.
After the reachable state set is obtained, analyzing the reachable state set to obtain all edges with the assumed semantics; the only difference is that the indirect branch is solved at the moment, namely, a directed edge of an instruction similar to jmp eax is connected to the position pointed by eax to be used as the next basic block, so that the control flow information is more complete. After this, the function boundaries are partitioned and the edges between the basic blocks of the cross-function are recorded for restoring the function call graph.
And 3, filling a useless function. The method comprises the following specific steps: 1) restoring a function call graph; 2) adding an initialization function into a useful function list; 3) blank instructions are used to fill portions of code that are not garbage functions.
According to the relatively complete control flow information, the function call graph can be recovered: all call instructions are recursively analyzed starting with a start function specified by the user's input to build a tree structure of useful functions. By excluding the elements in the tree structure, all the useless functions in the dynamic library can be obtained. Further, the accuracy of the function call graph may be improved using the sign information and the relocation information.
Step 4, the concrete steps of reconstructing the dynamic library are as follows: 1) disassembling the dynamic library into a redirectable assembly file by using a reassembling technology; 2) recovering metadata information such as a dependency library and the like according to the input module; 3) removing blank instructions in the disassembled codes; 4) reconfiguring dynamic libraries using assemblers and linkers
The above described reassembling technique belongs to the binary rewrite (binary rewrite) technique, with which a dynamic library can be disassembled and a reassembled assembly code is obtained, i.e. an offset in the assembly code is relocatable due to tagmentation, rather than a simple immediate. And filling a large amount of codes by using blank instructions in the filling of the useless function in the previous step, so that the redirectable assembly codes obtained in the previous step have a large amount of blank instruction sequences, deleting blank instruction texts in the assembly files, and generating new dynamic library files by using an assembler and a linker, thereby achieving the purpose of cutting the dynamic library.
The above is only a preferred embodiment of the present invention, and it should be noted that the above preferred embodiment should not be considered as limiting the present invention, and the protection scope of the present invention should be subject to the scope defined by the claims. It will be apparent to those skilled in the art that various modifications and adaptations can be made without departing from the spirit and scope of the invention, and these modifications and adaptations should be considered within the scope of the invention.
Claims (8)
1. A dynamic library clipping method based on binary analysis is characterized by comprising the following steps:
step 1: analyzing the target dynamic library module, analyzing the file format of the target dynamic library module, then separating the data section and the code section to obtain symbol information and repositioning information;
step 2: analyzing the data section and the code section through data flow analysis, and restoring a control flow diagram for recovering control flow information;
and step 3: restoring the function call graph, filtering out useless function information according to the user demand function set and the relocation information and the symbol information in the step 1, and filling the useless function information with a blank instruction to form a modified dynamic library;
and 4, step 4: disassembling the dynamic library modified in the step 3 into a code which can be assembled by using a binary rewriting technology, recovering link information, eliminating blank instructions on a text level, and reconstructing the code after the blank instructions are eliminated by using an assembler and a linker to generate a reconstructed dynamic library.
2. The binary analysis-based dynamic library clipping method according to claim 1, wherein the step 1 specifically comprises:
step 1.1: carrying out file format identification on the target dynamic library module, and judging the target system architecture of the target dynamic library module;
step 1.2: carrying out standard analysis on the target dynamic library module according to a file format corresponding to the target dynamic library module, and storing a data section, symbol information and relocation information, wherein the data section comprises a program loading substrate, an entry point and a dependency library;
step 1.3: intercepting a code segment for subsequent static analysis.
3. The binary analysis-based dynamic library clipping method according to claim 1, wherein the step 2 specifically comprises:
step 2.1: initializing an analysis environment;
step 2.2: disassembling and lifting the code segment into an intermediate representation;
step 2.3: analyzing the intermediate representation, processing the jump type statement and the non-jump type statement, and forming a constraint system of an abstract state in the form of a position and an edge;
step 2.4: based on a constraint system, calculating the state of each position by using data flow analysis to instantiate an indirect call concrete address to form a reachable state set;
step 2.5: and restoring the control flow graph according to the reachable state set.
4. The binary analysis-based dynamic library clipping method according to claim 3, wherein the step 2.1 specifically comprises: when the analysis environment is initialized, the memory is described by using an abstract memory model, and different memory position types are divided by different regions.
5. The binary analysis-based dynamic library clipping method according to claim 3, wherein the step 2.2 specifically comprises:
step 2.2.1: disassembling the machine code at the corresponding position according to the current state of each part of the code segment;
step 2.2.2: loading a description file of the intermediate representation, wherein the description file is used for describing the mapping relation between the assembly instruction and the intermediate representation;
step 2.2.3: and promoting the current assembly instruction into a statement sequence of intermediate representation according to a corresponding rule.
6. The dynamic library clipping method based on binary analysis according to claim 3, wherein the processing mode for the jump-class statements and the non-jump-class statements in step 2.3 is specifically:
for the jump statement, generating an edge with assumed semantics, and determining the subsequent control flow according to the abstract state of the previous node;
for non-jump type sentences, directly taking the current sentence position and the state of the next adjacent sentence as nodes, and constructing edges by sentence semantics.
7. The binary analysis-based dynamic library clipping method according to claim 3, wherein the step 2.4 specifically comprises: performing data flow analysis through a worklist algorithm, receiving a state input by each edge, taking a subsequent state as an output, and taking the set of the output states of all the edges as an reachable state set; when one state input meets an edge with an assumed semantic meaning, whether the edge can pass through is judged according to whether the specific numerical value per se accords with the semantic meaning, and if one edge does not have the state output, the code of the part cannot be reached.
8. The binary analysis-based dynamic library clipping method according to claim 7, wherein the step 2.5 specifically comprises:
step 2.5.1: analyzing the reachable state set to obtain all edges with assumed semantics;
step 2.5.2: one end point of an edge with assumed semantics is used as the beginning of a basic block, the other end point is used as the end of the basic block, and two adjacent basic blocks are connected;
step 2.5.3: and dividing function boundaries for all basic blocks, and disconnecting edges between basic blocks of the cross-function.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111285971.1A CN113721928B (en) | 2021-11-02 | 2021-11-02 | Binary analysis-based dynamic library clipping method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111285971.1A CN113721928B (en) | 2021-11-02 | 2021-11-02 | Binary analysis-based dynamic library clipping method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113721928A true CN113721928A (en) | 2021-11-30 |
| CN113721928B CN113721928B (en) | 2022-01-18 |
Family
ID=78686391
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111285971.1A Active CN113721928B (en) | 2021-11-02 | 2021-11-02 | Binary analysis-based dynamic library clipping method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113721928B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116643812A (en) * | 2023-07-26 | 2023-08-25 | 北京麟卓信息科技有限公司 | Dynamic library loading optimization method based on minimum symbol redundancy |
| CN118193032A (en) * | 2024-03-25 | 2024-06-14 | 广州鼎甲计算机科技有限公司 | Method, apparatus, device, medium and program product for eliminating invalid dependency library |
Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070113291A1 (en) * | 2005-11-17 | 2007-05-17 | Juin-Jia Dai | Method for administrating the function access |
| CN101840334A (en) * | 2010-04-16 | 2010-09-22 | 中国电子科技集团公司第二十八研究所 | Software component service packaging method |
| CN102054149A (en) * | 2009-11-06 | 2011-05-11 | 中国科学院研究生院 | Method for extracting malicious code behavior characteristic |
| CN103034486A (en) * | 2012-11-28 | 2013-04-10 | 清华大学 | Automatic optimization method based on full-system expansion call graph for mobile terminal operation system |
| CN103116514A (en) * | 2013-03-15 | 2013-05-22 | 清华大学 | Automatic operating system optimization method and system based on system expansion call graph |
| US20150278069A1 (en) * | 2014-03-31 | 2015-10-01 | Nec Laboratories America, Inc. | Dynamic Border Line Tracing for Tracking Message Flows Across Distributed Systems |
| CN106528403A (en) * | 2016-10-08 | 2017-03-22 | 西安电子科技大学 | Software runtime monitoring method based on binary code implantation technology |
| CN107357566A (en) * | 2017-06-06 | 2017-11-17 | 上海交通大学 | More framework binary system similar codes detecting systems and method |
| CN111209007A (en) * | 2020-01-17 | 2020-05-29 | 济南浪潮高新科技投资发展有限公司 | Software implementation method for monitoring controllable equipment based on mobile environment |
| CN112379940A (en) * | 2020-11-11 | 2021-02-19 | 歌尔科技有限公司 | Executable file processing method and device, electronic equipment and storage medium |
| CN113050948A (en) * | 2021-03-22 | 2021-06-29 | 厦门亿联网络技术股份有限公司 | Dynamic library optimization method, device, equipment and storage medium |
| CN113535263A (en) * | 2021-07-07 | 2021-10-22 | 深圳市元征未来汽车技术有限公司 | Dynamic library calling method and device, computer equipment and storage medium |
-
2021
- 2021-11-02 CN CN202111285971.1A patent/CN113721928B/en active Active
Patent Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070113291A1 (en) * | 2005-11-17 | 2007-05-17 | Juin-Jia Dai | Method for administrating the function access |
| CN102054149A (en) * | 2009-11-06 | 2011-05-11 | 中国科学院研究生院 | Method for extracting malicious code behavior characteristic |
| CN101840334A (en) * | 2010-04-16 | 2010-09-22 | 中国电子科技集团公司第二十八研究所 | Software component service packaging method |
| CN103034486A (en) * | 2012-11-28 | 2013-04-10 | 清华大学 | Automatic optimization method based on full-system expansion call graph for mobile terminal operation system |
| CN103116514A (en) * | 2013-03-15 | 2013-05-22 | 清华大学 | Automatic operating system optimization method and system based on system expansion call graph |
| US20150278069A1 (en) * | 2014-03-31 | 2015-10-01 | Nec Laboratories America, Inc. | Dynamic Border Line Tracing for Tracking Message Flows Across Distributed Systems |
| CN106528403A (en) * | 2016-10-08 | 2017-03-22 | 西安电子科技大学 | Software runtime monitoring method based on binary code implantation technology |
| CN107357566A (en) * | 2017-06-06 | 2017-11-17 | 上海交通大学 | More framework binary system similar codes detecting systems and method |
| CN111209007A (en) * | 2020-01-17 | 2020-05-29 | 济南浪潮高新科技投资发展有限公司 | Software implementation method for monitoring controllable equipment based on mobile environment |
| CN112379940A (en) * | 2020-11-11 | 2021-02-19 | 歌尔科技有限公司 | Executable file processing method and device, electronic equipment and storage medium |
| CN113050948A (en) * | 2021-03-22 | 2021-06-29 | 厦门亿联网络技术股份有限公司 | Dynamic library optimization method, device, equipment and storage medium |
| CN113535263A (en) * | 2021-07-07 | 2021-10-22 | 深圳市元征未来汽车技术有限公司 | Dynamic library calling method and device, computer equipment and storage medium |
Non-Patent Citations (2)
| Title |
|---|
| BIN REN: "Compiling Dynamic Data Structures in Python to Enable the Use of Multi-core and Many-core Libraries", 《2011 INTERNATIONAL CONFERENCE ON PARALLEL ARCHITECTURES AND COMPILATION TECHNIQUES》 * |
| 范长青: "Windows操作系统冗余动态链接库的删除", 《福州大学学报(自然科学版)》 * |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116643812A (en) * | 2023-07-26 | 2023-08-25 | 北京麟卓信息科技有限公司 | Dynamic library loading optimization method based on minimum symbol redundancy |
| CN116643812B (en) * | 2023-07-26 | 2023-09-19 | 北京麟卓信息科技有限公司 | Dynamic library loading optimization method based on minimum symbol redundancy |
| CN118193032A (en) * | 2024-03-25 | 2024-06-14 | 广州鼎甲计算机科技有限公司 | Method, apparatus, device, medium and program product for eliminating invalid dependency library |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113721928B (en) | 2022-01-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Debray et al. | Profile-guided code compression | |
| US5805895A (en) | Method and apparatus for code translation optimization | |
| CN113721928B (en) | Binary analysis-based dynamic library clipping method | |
| EP2082318B1 (en) | Register-based instruction optimization for facilitating efficient emulation of an instruction stream | |
| US7958133B2 (en) | Application conversion of source data | |
| CN110569628B (en) | Code obfuscation method and device, computer device and storage medium | |
| CN110059456B (en) | Code protection method, code protection device, storage medium and electronic equipment | |
| US10248409B1 (en) | Limiting the effects of source code patches on corresponding native-code patches | |
| CN109948308A (en) | Code security guard method, device, electronic equipment and computer readable storage medium | |
| CN113296786B (en) | Data processing method, device, electronic equipment and storage medium | |
| WO2018125363A1 (en) | Systems and/or methods for type inference from machine code | |
| US11029934B2 (en) | Method and system for updating legacy software | |
| CN112732321B (en) | Firmware modification method, device, computer readable storage medium and equipment | |
| US6625807B1 (en) | Apparatus and method for efficiently obtaining and utilizing register usage information during software binary translation | |
| US5926814A (en) | System and method for processing a new calendar system | |
| CN111880800B (en) | Application downloading method and application downloading system | |
| CN112540755A (en) | Front-end-based component processing method, device, equipment and storage medium | |
| CN111796832B (en) | Hot patch file generation method, device, equipment and storage medium | |
| CN104615935A (en) | Hiding method geared to Xen virtualization platform | |
| US20230325476A1 (en) | Obfuscation device, obfuscation method, and obfuscation program | |
| CN114174983B (en) | Method and system for optimized automatic verification of advanced constructs | |
| CN114816435A (en) | Software development method based on reverse technology | |
| CN114637988A (en) | Binary-oriented function level software randomization method | |
| CN113835714A (en) | Language conversion method and device of application program, computer equipment and storage medium | |
| CN114579135B (en) | Installation package generation 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 | ||
| PE01 | Entry into force of the registration of the contract for pledge of patent right |
Denomination of invention: A Dynamic Library Cropping Method Based on Binary Analysis Effective date of registration: 20230712 Granted publication date: 20220118 Pledgee: Sichuan Tianfu bank Limited by Share Ltd. Chengdu branch Pledgor: CHENGDU NO SUGAR INFORMATION TECH Co.,Ltd. Registration number: Y2023510000179 |
|
| PE01 | Entry into force of the registration of the contract for pledge of patent right |