从公理语义看UNITY模型和GAMMA模型的关系

ＧＡＭＭＡ和ＵＮＩＴＹ都是面向问题描述的程序设计语言．ＵＮＩＴＹ开发了一种公理语义规范语言，即ＵＮＩＴＹ逻辑，描述和推导程序的特性．这一规范语言也可以很自然地移植到ＧＡＭＭＡ模型上去．基于上述语义规范，给出一个将ＵＮＩＴＹ程序变换成ＧＡＭＭＡ程序的保语义等价性的程序变换方法，从而证明了ＧＡＭＭＡ模型的描述能力强于ＵＮＩＴＹ模型     

UniNet Description of Dining Philosopher Problem

The UniNet specification of Dining Philosopher Problem we presents not only is graphic and intuitionistic but also explicitly indicates the In the specification, static semantics and the the static properties are dynamic semantics. the recorder of the dynamic properties, and the dynamic properties are the track of the static properties change. Accordingly, Dining Philosopher Problem is formally verified by UniNet. Furthermore, the procedure of properties＇ verification is implemented through the graphic-related computing style.     

UNITY逻辑中关于unless的若干结果

本文的工作主要分为两部分．首先，我们把验证ｐｕｎｌｅｓｓｑ是否是ＵＮＩＴＹ逻辑的定理转化为一阶定理的验证．其次，设ｐ１ｕｎｌｅｓｓｑ１，…，ｐｎｕｎｌｅｓｓｑｎ在一ＵＮＩＴＹ程序Ｆ中成立．我们把验证ｐｕｎｌｅｓｑ在Ｆ中成立是否可由以上ｎ个性质得出转化为强推出的验证，其中强推出是本文引进的新概念．