Proving Reflex Program Verification Conditions in Coq Proof Assistant

Abstract

The process-oriented paradigm is a promising approach to the development of control software based on the natural concept of the process. Many safety-critical systems use control software. This is a reason for the formal verification of such systems. Deductive verification is the formal method of proving the program s correctness (the satisfiability program requirements). Requirements are formalized as annotations added to programs. The resulting annotated programs are reduced to verification conditions - formulas in some logical language. The original program is considered to be correct if all the verification conditions are true. This paper presents the results of experiments on proving verification conditions in Coq proof assistant within the framework of the two-step method of deductive verification of process-oriented programs in Reflex language.