Three different classes of programs are identified for which the proof of correctness is shown to be "natural", in that the functional input-output specifications of the programs lead, in a straightforward manner, to the verification conditions that should be proven. Furthermore, these verification conditions are shown to be necessary and sufficient so that a proof/refutation follows by proving/disproving the corresponding verification conditions. It is not necessary to follow the exact control flow of the programs to generate these conditions; certain simple checks are enough to show whether a particular program belongs to one of the classes. These apparently different programs have the common feature that they operate "uniformly" on the data domain; changing the input to the program changes the dynamic behavior of the program in a predictable, easily definable fashion. Implications of this feature in program construction are discussed.
确定三种不同类别的程序,对于这些程序,正确性的证明被证明是“自然的”,因为程序的功能输入输出规范以直接的方式导致应证明的验证条件。此外,这些验证条件被证明是必要和充分的,从而通过证明/证明相应的验证条件来进行证明/反驳。不必遵循程序的确切控制流程来生成这些条件。某些简单的检查足以显示特定程序是否属于这些类之一。这些显然不同的程序具有共同的特征,即它们在数据域上“统一”运行。更改程序的输入会以可预测的,易于定义的方式更改程序的动态行为。讨论了此功能在程序构建中的含义。 P>
机译:命题可证明性逻辑中的非表格m-预完成式类
机译:用于隐式随机和基于样本的动态程序的可透明近乎最佳的近似方案
机译:BWM:一种新颖的,可证明的,基于集合的动态规划算法,用于计算蛋白质设计的稀疏近似
机译:ConstereRexample驱动的遗传编程:随机合成可怕的正确计划
机译:高效的运行时间调度程序可简化并行编程
机译:BWM *:一种新颖的可证明的基于集合的动态规划算法用于计算蛋白质设计的稀疏近似
机译:ConstereRexample驱动的遗传编程:随机合成可怕的正确计划