Demand-driven reusable binary pointer analysis method

By employing a demand-driven, reusable binary pointer analysis method, and by restoring the pointer type and pointer representation, efficient reuse of pointer analysis is achieved, solving the problem of low efficiency in existing technologies and improving analysis accuracy and efficiency.

CN122020650APending Publication Date: 2026-05-12NANJING UNIV
0 Cites 0 Cited by

Patent Information

Application Number
CN202610066507.X
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2026-01-19
Publication Date
2026-05-12

AI Technical Summary

Technical Problem

In existing technologies, pointer analysis is inefficient and it is difficult to significantly improve it while ensuring high analysis accuracy. Furthermore, downstream tasks rely on frequent calls to pointer analysis results.

Method used

A demand-driven, reusable binary pointer analysis method is adopted. The pointer type is restored by the variable usage, the pointer calculation related instructions are extracted, and the abstract interpretation is performed based on the pointer representation. The results are saved to the intermediate library, and the function to be analyzed is determined as needed, so as to realize the reuse of analysis results between processes.

Benefits of technology

It improves the overall efficiency of pointer analysis, reduces the complexity of subsequent abstract interpretation, reduces the number of functions that need to be analyzed, and maintains the high efficiency of large-scale program analysis.

✦ Generated by Eureka AI based on patent content.
Patent Text Reader

Abstract

The invention discloses a demand-driven reusable binary pointer analysis method, which is used for determining a pointing set and an alias of a given target pointer variable, and comprises the following steps of: S1, recovering a pointer type in a process through a use mode of the variable, and extracting an instruction related to pointer calculation; s2, on the basis of the pointer representation and an execution result of the modeling instruction, abstract interpretation is carried out in the process, a pointer representation set of all pointer variables is obtained, and the result is stored in an intermediate result library; s3, on the basis of an analysis result in the process, determining a to-be-analyzed function as required, and obtaining different pointer representations of the target pointer variable in different functions; and if a certain function is not analyzed, the in-process analysis of the step S1 and the step S2 is triggered for the function. According to the method, a context sensitive strategy and a flow sensitive strategy are realized, the balance of analysis efficiency and precision is realized, and inter-process on-demand pointer analysis can be efficiently carried out.
Need to check novelty before this filing date? Find Prior Art