correctness proving

基本解释

In this paper a method of proving the correctness of a computer program based on a transformation relation of the loop body is presented.
本文提出了利用循环体转换关系式的程序证明方法。
Giving an operational semantics model of DFL programming language which can solve dynamic fuzzy problems and proving the correctness and reliability of it;
提出了可以解决动态模糊性问题的DFL程序设计语言的操作语义模型，并对该模型的正确性和可靠性进行了证明；
Several heuristic rules and the proving of their correctness are given.
具体地给出若干启发式控制规则，并证明了这些规则的正确性。