An Automatic Verification Method for Synchronous Language Programs Based on Satisfiability Solving

Abstract

The invention discloses an automatic verification method of a synchronous language program based on satisfiability, which includes inlining the enumerated values, user-defined types and constants in the synchronous language program into the nodes of the synchronous language program, and in the synchronous language program recursively inline all the called nodes in the main node of , and get a synchronous language program containing a single node, and then reduce the memory depth of the program to 1 by introducing a new local data flow, and finally the synchronous language program containing a single node and Its security properties are expressed as propositional logic formulas, and a satisfiability modulo theory solver is used to verify whether a synchronous language program satisfies the security properties to be verified. The invention supports direct verification of large-scale complex synchronous language programs, can improve the verification ability and efficiency, and can ensure the reliability and safety of the programs.

Description

technical field [0001] The invention relates to the field of computer software, in particular to an automatic verification method for synchronous language programs based on satisfiability solutions. Background technique [0002] Embedded system software in safety-critical fields such as aviation, aerospace, nuclear energy, and transportation are mostly developed and implemented using synchronous data flow languages ​​(referred to as synchronous languages), such as SCADE, Esterel, Luster, and Signal. A synchronous language is a declarative language whose basic data abstraction is data flow. A synchronous language program consists of one or more nodes, similar to functions in C / C++. Each node has zero or more input data streams and local data streams, and one or more output data streams. A data stream is a sequence of values, and the synchronous language supports only Boolean, integer, and real data streams. Commonly used sequences for data streams (x 1 ,x 2 ,x 3 ,...) m...

AI Technical Summary

Problems solved by technology

[0011] Second, the verification efficiency of automatic verification tools based on propositional logic satisfiability solving technology is low, because propositional logic satisfiability solvers can only determine whether propositional logic formulas are satisfiable, and cannot support important language structures in programs , such as linear operations on integers and real numbers, uninterpreted function symbols, arrays, etc.

However, the algorithms designed to be compatible with these language structures generally have poor performance, resulting in low verification efficiency, making it impossible to automatically verify the security attributes of large and complex software systems.

Images