Program static automatic analysis method

Abstract

The invention discloses a program static automatic analysis method and relates to a method of automatically analyzing program property by using a data flow analysis means and a logic reasoning system.The method includes: using a grammar analysis tool to analyze a source code, and constructing an extension program flow graph on a sentence level; using a recursive function and property thereof to define property of a program to be analyzed, and using a meet semi-lattice to describe a valuing set of the property; customizing a processing procedure when the program property is transmitted and passes a program sentence, performing automatic derivation and analysis by combining a constraint solving tool with logic reasoning rules, and using a data flow analysis algorithm to execute automatic iteration to solve an analysis result; writing the result back onto the program node of the extension flow graph in a formula form for the convenience of analysis personnel to judge whether the code is wrong or not.By using the method, manual analysis operation can be replaced, analysis accuracy and completeness are guaranteed, errors and omissions caused by manual analysis are avoided, and time cost and manpower cost are saved effectively.

Description

technical field [0001] The invention relates to a method for automatically analyzing the correctness of a program based on a data flow analysis method and a logical reasoning system. The method can be applied to the static analysis and verification of the program, replacing manual and automatic analysis of the possibility of the program execution result, ensuring The accuracy and integrity of the analysis results belong to the application field of software verification technology. Background technique [0002] Software reliability refers to the method of ensuring the correctness of the program to a certain extent through various means such as testing, verification, and model checking. Programmers need to ensure the correct function of the code after writing it. You can observe whether the program execution results meet expectations by executing test cases, or use model checking technology to analyze whether the execution process of the system will lead to an unsafe state. Fo...

AI Technical Summary

Problems solved by technology

The problem with Hall logic is that it cannot handle multiple variables bound to the same memory address. Therefore, on the basis of it, later generations proposed extended logic systems such as separation logic, which defined the stack structure of the program and the corresponding separation algorithm. sub, and expanded and modified part of the reasoning rules, with the ability to handle pointer aliases, but the separation logic has greatly changed the process of logical reasoning, making the reasoning process too complicated, so some logical reasoning systems were developed later. The memory model, which uses fewer logical reasoning rules, has the same memory analysis capabilities. Their common feature is that they can model the actual memory addresses of the variables involved in program statements and expressions.

Images