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.
本文提出了利用循環(huán)體轉(zhuǎn)換關(guān)系式的程序證明方法。
Giving an operational semantics model of DFL programming language which can solve dynamic fuzzy problems and proving the correctness and reliability of it;
提出了可以解決動(dòng)態(tài)模糊性問(wèn)題的DFL程序設(shè)計(jì)語(yǔ)言的操作語(yǔ)義模型，并對(duì)該模型的正確性和可靠性進(jìn)行了證明；
Several heuristic rules and the proving of their correctness are given.
具體地給出若干啟發(fā)式控制規(guī)則，并證明了這些規(guī)則的正確性。