Abstract

With the rapid increase in the number of wireless terminals and the openness of wireless networks, the security of wireless communication is facing serious challenges. The safety and security of computer communication have always been a research hotspot, especially the wireless communication that still has a more complex architecture which leads to more safety problems in the communication system development. In recent years, more and more wireless communication systems are applied in the safety-critical field which tends to need high safety guarantees. A compiler is an important tool for system development, and its safety and reliability have an important impact on the development of safety-critical software. As the strictest method, formal verification methods have been widely paid attention to in compiler verification, but the current formal verification methods have some problems, such as high proof complexity, weak verification ability, and low algorithm efficiency. In this paper, a compiler formal verification method based on safety C subsets is proposed. By abstracting the concept of C grammar units from safety C subsets, the formal verification of the compiler is transformed into the verification of limited C grammar units. In this paper, an axiom system of first-order logic and special axioms are introduced. On this axiom system, the semantic consistency verification of C grammar unit and target code pattern is completed by means of theorem proving, and the formal verification of the compiler is completed.

Highlights

  • With the rapid development of wireless communication technology, a wireless communication system has been widely used in various fields of national economy and national defense construction

  • This paper proposes a compiler formal verification method based on secure C subset

  • In order to obtain the semantics of each C grammar unit, this paper introduces the concept of context, which can define the semantics of grammar unit according to context

Read more

Summary

A Formal Verification Method of Compilation Based on C Safety Subset

Received 17 June 2021; Revised 3 July 2021; Accepted 12 July 2021; Published 1 August 2021. The safety and security of computer communication have always been a research hotspot, especially the wireless communication that still has a more complex architecture which leads to more safety problems in the communication system development. More and more wireless communication systems are applied in the safety-critical field which tends to need high safety guarantees. A compiler formal verification method based on safety C subsets is proposed. An axiom system of first-order logic and special axioms are introduced. On this axiom system, the semantic consistency verification of C grammar unit and target code pattern is completed by means of theorem proving, and the formal verification of the compiler is completed

Introduction
Related Works
Formal Verification Algorithm
Discussion and Conclusion
Conflicts of Interest
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call