Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

A method and device for lossless compression system dependency graph

A system-dependent graph and lossless compression technology, applied in the computer field, can solve problems such as high space-time overhead, reduced slicing accuracy, and unhelpful slicing accuracy

Inactive Publication Date: 2017-07-07
HUAWEI TECH CO LTD +1
View PDF3 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0006] Although improving the accuracy of pointer analysis can moderately reduce the scale of SDG, the high-precision pointer analysis algorithm itself not only requires high space-time overhead, but also hardly helps to improve the slice accuracy.
However, using the context sensitivity of the limited slice algorithm to alleviate the overhead of traversing the SDG will reduce the accuracy of the slice

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 method and device for lossless compression system dependency graph
  • A method and device for lossless compression system dependency graph
  • A method and device for lossless compression system dependency graph

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0058] The following will clearly and completely describe the technical solutions in the embodiments of the present invention with reference to the accompanying drawings in the embodiments of the present invention. Obviously, the described embodiments are only some, not all, embodiments of the present invention. Based on the embodiments of the present invention, all other embodiments obtained by persons of ordinary skill in the art without making creative efforts belong to the protection scope of the present invention.

[0059] Embodiments of the present invention provide a method for losslessly compressing system dependency graphs, such as figure 1 As shown, the method includes:

[0060] S101. Obtain equivalence relations among all variables in the program according to alias analysis information, and classify all variables into different equivalence classes according to the equivalence relations, wherein the alias analysis information is obtained according to an alias analysi...

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

Embodiments of the present invention provide a method and device for lossless compression of a system dependency graph, which relate to the field of computers and can realize lossless compression of a system dependency graph and reduce the scale of the system dependency graph, thereby reducing the slicing algorithm based on the system dependency graph s expenses. The method is: first extract the equivalence relationship between all variables in the program, then divide all variables in the program into different equivalence classes through the equivalence relationship, and set the nodes in the system dependency graph according to these equivalence classes key value, and then compress the system dependency graph according to the key value of the node in the system dependency graph. The embodiment of the present invention is used to compress the system dependency graph.

Description

technical field [0001] The invention relates to the field of computers, in particular to a method and device for losslessly compressing system dependency graphs. Background technique [0002] Program static slicing is an important program analysis technology, which is widely used in program understanding, testing, debugging, verification, and maintenance. It can help programmers extract the code they care about, and reduce program analysis, error verification, and maintenance. At present, the mainstream slicing tools all use the graph reachability algorithm based on the system dependency graph. [0003] System Dependence Graph (SDG) is a directed graph, which is an extension of Program Dependence Graph (PDG). The program slicing algorithm based on the system dependency graph is to extract the program code that may affect the value of a variable at a certain position in the program by traversing the system dependency graph. However, the cost and accuracy of existing slicing...

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): G06F9/44
Inventor 李丰霍玮陈聪明衷璐洁张兆庆冯晓兵
Owner HUAWEI TECH CO LTD
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

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

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