Supercharge Your Innovation With Domain-Expert AI Agents!

On-demand configurable program control flow graph accessibility indexing method

A program control flow graph and accessibility technology, applied in program code conversion, software engineering design, error detection/correction, etc., can solve the problems of large space-time overhead, reduce space-time overhead, improve accessibility information index and The effect of query efficiency

Active Publication Date: 2019-04-19
黑龙江省工业技术研究院
View PDF4 Cites 2 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0004] The present invention provides an on-demand reducible program control flow graph reachability indexing method in order to solve the problem of large time and space overhead in the existing control flow graph reachability indexing technology

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
  • On-demand configurable program control flow graph accessibility indexing method
  • On-demand configurable program control flow graph accessibility indexing method
  • On-demand configurable program control flow graph accessibility indexing method

Examples

Experimental program
Comparison scheme
Effect test

specific Embodiment approach 1

[0019] Specific implementation mode 1: The on-demand reducible program control flow graph graph reachability indexing method provided in this implementation mode specifically includes the following steps:

[0020] Use the depth-first strategy to traverse all the nodes in the program control flow graph; use the depth of the regional hierarchy as the measurement weight, and store the nodes to be encoded through the weighted work list (Worklist); the weighted work list is realized by the heap data structure, and the nodes inserted into the list are based on the region Hierarchical depth sorting (such as line ② and line 2 of the hierarchical linearization coding algorithm code below Line, No. line), to ensure that the top node has the deepest level, and the nodes in the pop-up list are nodes sorted according to the depth-first strategy of the area level (such as line ④); specifically:

[0021] Step 1. Initialize the work list, such as lines ①~②;

[0022] Step 2, then sort acco...

specific Embodiment approach 2

[0030] Embodiment 2: The difference between this embodiment and Embodiment 1 is that the hierarchical linearization encoding domain corresponding to the encoding process is specifically:

[0031] HLCDomain={G,DT,RT,ST,HLC,≤R}

[0032] The field is a six-tuple. Among them, HLCDomain represents the hierarchical linearization coding domain, which includes the hierarchical linearization coding structure, its affiliation and the information on which the structure depends; G is a program control flow graph, which is a directed graph, G=(V,E ); |V|=n, n is a node; |E|=m, m represents the level depth (the number of edges) of the region where the node is located; DT is the dominator tree corresponding to the program control flow graph; RT is the corresponding program control flow graph The region structure tree of , ST=(V,E ST ) is the spanning tree generated by the depth-first traversal of the region hierarchy G, and the corresponding non-tree edge E NST =E-E ST ; HLC is the node ...

specific Embodiment approach 3

[0035] Specific implementation mode 3: The difference between this implementation mode and specific implementation mode 2 is that the hierarchical linearization coding structure is specifically:

[0036] HLC M =(HLC parent ,LC M )=(LC 0 M ,LC 1 M ,…,LC m-1 M ,LC M )=(LC (0,m-1) M ,LC M )=LC (0,m) M

[0037] Among them, HLC M is the hierarchical linearization code of node M; m represents the hierarchical depth of the area where node M is located; LC 0 M ,LC 1 M ,…,LC i M HLC M Intra-layer sequence encoding of the region head node experienced from the root node of the directed flow graph to the current node, i∈[0,m]; LC M =LC m M is the sequence code in the lowest layer area where node M is located; HLC parent Encodes the hierarchical linearization of the parent node.

[0038] Other steps and parameters are the same as those in Embodiment 1 or 2.

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 an on-demand reducible program control flow graph accessibility indexing method, and belongs to the technical field of computer program analysis. According to the method, a depth-first strategy traversal program is used for controlling all nodes in a flow graph; Taking the regional hierarchical depth as a measurement weight, and storing a to-be-coded node through a weightedwork list; Wherein the weighted work list is realized by a heap data structure, the nodes inserted into the list are ranked according to the regional hierarchy depth, the deepest hierarchy of the topend node is ensured, and the nodes of the pop-up list are ranked according to a regional hierarchy depth priority strategy. The method solves the problem that an existing control flow graph reachability index technology is large in space-time cost. The method can be used for on-demand program analysis.

Description

technical field [0001] The invention relates to a graph accessibility indexing method and belongs to the technical field of computer program analysis. Background technique [0002] On-demand program analysis is an analysis strategy that only calculates the information related to the analysis and the target after the analysis target is given by the user, but does not calculate the global information. How to quickly determine the graph reachability query of the range associated with the analysis target in the program control flow graph (Control Flow Graph, CFG) is the key to determining the efficiency of on-demand analysis. However, the current graph reachability algorithm is mainly aimed at sparse directed acyclic graphs, and lacks the optimization and processing of non-spanning tree edges in program control flow graphs and directed cycle subgraphs in loop bodies, resulting in low processing efficiency. [0003] On-demand program analysis is sensitive to both preprocessing t...

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
IPC IPC(8): G06F8/41G06F11/36
CPCG06F8/433G06F11/3604
Inventor 逄龙
Owner 黑龙江省工业技术研究院
Features
  • R&D
  • Intellectual Property
  • Life Sciences
  • Materials
  • Tech Scout
Why Patsnap Eureka
  • Unparalleled Data Quality
  • Higher Quality Content
  • 60% Fewer Hallucinations
Social media
Patsnap Eureka Blog
Learn More

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

© 2025 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com