PROOF RULES AND TRANSFORMATIONS DEALING WITH FAIRNESS

被引：47

作者：

APT, KR

OLDEROG, ER

机构：

[1] UNIV PARIS 07,LITP,F-75251 PARIS,FRANCE

[2] UNIV KIEL,INST INFORMAT & PRAKT MATH,D-2300 KIEL 1,FED REP GER

[3] OXFORD UNIV,COMP LAB,PROGRAMMING RES GRP,OXFORD OX1 3QD,ENGLAND

来源：

关键词：

D O I：

10.1016/0167-6423(83)90004-7

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

页码：65 / 100

页数：36

共 14 条

[1] APT K, 1982, 2ND P C F SOFTW TECH, P146
[2] APT KR, 1981, LECTURE NOTES COMPUT, V115, P479
[3] Apt Krzysztof R., 1982, LECT NOTES COMPUTER, V131, P1
[4] COUSOT P, 1977, 88 U SCI MED GREN RA
[5] Dijkstra E. W., 1976, DISCIPLINE PROGRAMMI
[6] EMERSON EA, 1980, LECT NOTES COMPUT SC, V85, P169
[7] FISCHER MJ, 1982, STORAGE REQUIREMENTS
[8] THE TOTAL CORRECTNESS OF PARALLEL PROGRAMS
FLON, L
SUZUKI, N
[J]. SIAM JOURNAL ON COMPUTING, 1981, 10 (02) : 227 - 246
[9] Flon L., 1978, Proceedings of the IFIP Working Conference on Formal Descriptions of Programming Concepts, P589
[10] Floyd Robert W., 1967, P S APPL MATH, V19, P19, DOI DOI 10.1090/PSAPM/019/0235771