10 YEARS OF HOARE LOGIC - A SURVEY .2. NONDETERMINISM

被引:33
作者
APT, KR
机构
[1] Univ de Paris 7, Paris, Fr, Univ de Paris 7, Paris, Fr
关键词
All Open Access; Green;
D O I
10.1016/0304-3975(83)90066-X
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
COMPUTER PROGRAMMING
引用
收藏
页码:83 / 109
页数:27
相关论文
共 24 条
[1]  
APT K, 1982, 2ND P C F SOFTW TECH, P146
[2]   PROOF RULES AND TRANSFORMATIONS DEALING WITH FAIRNESS [J].
APT, KR ;
OLDEROG, ER .
SCIENCE OF COMPUTER PROGRAMMING, 1983, 3 (01) :65-100
[3]  
APT KR, 1981, LECTURE NOTES COMPUT, V115, P479
[4]  
Apt KR, 1981, ACM T PROGR LANG SYS, V3, P431
[5]  
APT KR, 1982, LITP827 U PAR 7 TECH
[6]  
Apt Krzysztof R., 1982, LECT NOTES COMPUTER, V131, P1
[7]   SOUNDNESS AND COMPLETENESS OF AN AXIOM SYSTEM FOR PROGRAM VERIFICATION [J].
COOK, SA .
SIAM JOURNAL ON COMPUTING, 1978, 7 (01) :70-90
[8]  
DEBAKKER JW, 1980, MATH THEORY PROGRAM
[9]  
Dijkstra E. W., 1976, DISCIPLINE PROGRAMMI
[10]  
Dijkstra E. W., 1975, COMM ACM, V18