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

State-based path-sensitive symbolization function digest algorithm

A technology of function abstraction and symbolization, applied in the field of program analysis, it can solve the problems of inability to achieve context sensitivity, low analysis precision, and high false negative rate, and achieve the effects of easy instantiation, concise summary information, and good scalability.

Active Publication Date: 2017-09-22
UNIV OF ELECTRONIC SCI & TECH OF CHINA
View PDF7 Cites 5 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

The invention solves the technical problems of low inter-process analysis precision, high false negative rate and high false negative rate caused by the inability to realize context sensitivity and path sensitivity in the prior art

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
  • State-based path-sensitive symbolization function digest algorithm
  • State-based path-sensitive symbolization function digest algorithm

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0048] refer to figure 1 , a state-based path-sensitive symbolic function summarization algorithm, roughly divided into 5 parts. In the stage of constructing the function call graph, the source code is first compiled. During the compilation process, the function call graph (CallGraph) is constructed. Finally, the functions in the graph are analyzed in sequence using symbolic execution technology according to the topological order. In the intra-procedural analysis stage, first construct the function control flow graph, and then use the queuing algorithm to perform symbolic execution on the elements in the CFG. During the symbolic execution process, report errors that can be determined and report information that cannot be reported depending on the context. Record. In the function summary collection stage, when a function return statement is encountered, the symbolized program state is used as a function summary, and path conditions are stored into the program state. In the ap...

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 present invention discloses a state-based path-sensitive symbolization function digest algorithm, relates to the technical field of program analysis, and solves the technical problems of low precision in inter-process analysis, high memory footprint, high false positive rate, and the like caused by that the prior art can not realize the context-sensitive and path-sensitive. The method mainly comprises: constructing the function call graph; carrying out inter-process analysis on the function; collecting the function digest; applying the function digest; instantiating the function digest; and delaying to report the error. The algorithm disclosed by the present invention is applied to a static analysis framework.

Description

technical field [0001] The invention relates to the technical field of program analysis, in particular to a state-based path-sensitive symbolic function summary algorithm. Background technique [0002] The correctness analysis of programs has always been an important issue in software engineering. Today, when security is becoming more and more prominent, how to ensure that running programs have fewer loopholes has become an increasingly urgent issue. The static code analysis technology can find the loopholes in the program as early as possible before the program runs, avoiding the cost of the later maintenance of the program, and improving the stability and security of the program running. The current scenarios that limit static analysis capabilities mainly focus on inter-procedural analysis, and the two main methods to solve inter-procedural analysis are inter-procedural analysis based on function inlining and inter-procedural analysis based on function summary. Among them...

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): G06F11/36
CPCG06F11/3604G06F11/3688
Inventor 王晓斌屈鸿汪一文王留帅符明晟杨林川季江州
Owner UNIV OF ELECTRONIC SCI & TECH OF CHINA
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