Method for formally verifying bytecode intermediate representation program module by module

Abstract

The invention discloses a method for formally verifying a bytecode intermediate representation program module by module, which relates to the technical field of program security. The method is executed in a virtual machine with a dual-stack structure, and comprises the following steps of: formally rewriting the bytecode program to be verified in a way of taking a function as a unit and giving the formal specifications of the bytecode program; dividing the functions into instruction sequences and giving the specifications of the instruction sequences; formally certifying that each instruction sequence accords with the corresponding specifications; and connecting the certificates of all the instruction sequences in the functions to form the certificates of the functions, and connecting the certificates of all the functions to obtain the certificate of the whole program. Storage characteristics and a part of accuracy characteristics described in the specifications are met, so the aim of enhancing the credibility of the bytecode program is fulfilled. The method can be combined with the conventional methods for test, static and dynamic checking and the like, is applied to the checking of key security programs in the fields of aviation, nuclear industrial control and the like, and has the characteristics of high credibility, automatic checking and the like.

Description

technical field [0001] The invention relates to the field of program credibility, in particular to a sub-module formalized verification method for bytecode intermediate representation programs. Background technique [0002] The bytecode intermediate representation can not only run on a virtual machine, but also serve as a well-defined program representation in the compilation process. It is an important technology widely used in today's network software and computing devices. Bytecode intermediate representation program verification can improve the credibility of related software, and at the same time provide intermediate representation support for constructing proof-keeping compilers, which has important practical and theoretical values. [0003] The main research work of traditional bytecode intermediate representation program verification focuses on JVM internal checkers, and the goal is type correctness, so as to ensure storage safety. With the deepening of research wor...

AI Technical Summary

Problems solved by technology

[0005] Due to the complexity of the program abstract control stack in the middle of the bytecode and the lack of control flow structure information, previous methods cannot effectively solve the block verification of such programs, and there are a lot of demands in reality, so an effective and automatic checkable formalization is designed The verification scheme has important practical significance and application value

Images