A Trusted Sorting Method for Synchronous Data Flow Programs Based on Formal Verification

A technology of synchronous data flow and formal verification, which is applied in the field of trusted sorting of synchronous data flow programs, can solve problems such as the inability to verify the safety of compilers, and achieve improved security and reliability, high security, and correctness Effect

Active Publication Date: 2016-04-06
CHINA TECHENERGY +1
View PDF5 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0008] In order to solve the problem in the prior art that the security of the compiler cannot be verified when the Luster program is converted into a C language program, the present invention provides a formally verified trusted sorting method for synchronous data flow programs

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 Trusted Sorting Method for Synchronous Data Flow Programs Based on Formal Verification
  • A Trusted Sorting Method for Synchronous Data Flow Programs Based on Formal Verification
  • A Trusted Sorting Method for Synchronous Data Flow Programs Based on Formal Verification

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0051] Since Luster is a synchronous data flow language, it performs calculations in an infinite cycle, and has complex and variable clock calculations and temporal operations for calculating historical flow data. The program is too different from the C program, so it is directly translated to C. The process is very complicated, and it will be very difficult to verify. The present invention divides the entire conversion process into multi-step execution, and only performs one type of simplification in each step, and calls the result of the simplification an intermediate language. The mutual independence among them facilitates collaborative development and improves efficiency, and also simplifies the difficulty of formal verification.

[0052] like figure 1 As shown, 101, the credible sorting method of the synchronous data flow program based on formal verification of the present invention, comprises Luster parallel program and the serial C program obtained after sorting by Lust...

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 discloses a credible sorting method of synchronous data flow procedures based on formal verification. The credible sorting method comprises a Lustre parallel program and a serial C program obtained after sorting of the Lustre parallel program. For any two Lustre programs meeting the requirement for topological sorting, execution semantic equivalence of a Lustre program before topological sorting and a Lustre program after topological sorting is proved, and a C program after sorting and the Lustre program before sorting are equivalent in semantic execution. The credible sorting method of synchronous data flow procedures based on formal verification is developed and achieved based on a formalized language and with a 'vertex topological sorting algorithm with the in-degree as zero' as the theoretical basis. By means of the provement that any two programs meeting the topological sorting property are equivalent in serial semantic execution, during formal verification, all the situations in the process that a parallel language is converted into a serial language, each situation is proved, the program after sorting meets the topological sorting property, so that correctness of a scheme is ensured, and safety and reliability of a whole software system are improved.

Description

technical field [0001] The invention relates to the field of computer security, in particular to a trusted sorting method for synchronous data flow programs using formal verification for the security of compilers. Background technique [0002] As computer technology is increasingly used in safety-critical systems (SCS, Safety-Critical System) such as aerospace, nuclear power, and high-speed railways, the security requirements for the core software in the system are also getting higher and higher. The slightest error in a safety-critical system may cause a huge disaster. How to construct a basic safe software environment for a safety-critical system is the primary problem to be faced, especially for basic core software such as operating systems and compilers. [0003] The credibility of compilers has long been valued by academia and industry. Starting from the pioneering work of McCarthy and Painter, how to improve the correctness and reliability of compilers has always been ...

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): G06F21/12G06F17/30
CPCG06F11/3608
Inventor 张雁杨晨任保华张智慧
Owner CHINA TECHENERGY
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

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

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap