SHARED-STATE DESIGN MODULO WEAK AND STRONG PROCESS FAIRNESS

被引：0
|
作者：
STOLEN, K [1 ]
机构：
[1] TECH UNIV MUNICH, INST INFORMAT, W-8000 MUNICH 2, GERMANY
来源：
IFIP TRANSACTIONS C-COMMUNICATION SYSTEMS | 1993年 / 10卷
关键词：
SOFTWARE ENGINEERING; REQUIREMENTS SPECIFICATIONS; PROGRAM VERIFICATION; DESIGN;
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
A number of rules for proving shared-state programs totally correct with respect to both weak and strong process fairness is presented. The rules are compositional - thus they allow for design in a top-down style. On the other hand, already finished programs can be verified without the use of program transformation.
引用
收藏
页码：479 / 498
页数：20
相关论文
共 50 条
12345