SOME NATURAL STRUCTURES WHICH FAIL TO POSSESS A SOUND AND DECIDABLE HOARE-LIKE LOGIC FOR THEIR WHILE-PROGRAMS

被引:11
作者
BERGSTRA, JA [1 ]
TUCKER, JV [1 ]
机构
[1] MATH CTR,DEPT COMP SCI,1098 SJ AMSTERDAM,NETHERLANDS
关键词
D O I
10.1016/0304-3975(82)90027-5
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
引用
收藏
页码:303 / 315
页数:13
相关论文
共 25 条
[1]  
Apt K. R., 1979, Theoretical Computer Science, V8, P73, DOI 10.1016/0304-3975(79)90058-6
[2]  
APT KR, 1979, 5TH P SCAND LOG S, P1
[3]  
BACK RJR, UNPUB ACTA INFORMAT
[4]  
BERGSTRA JA, 1980, IW143 MATH CTR DEP C
[5]  
BERGSTRA JA, 1980, IW149 MATH CTR DEP C
[6]  
BERGSTRA JA, UNPUB THEORET COMPUT
[7]   COMPLETE AND CONSISTENT HOARE AXIOMATICS FOR A SIMPLE PROGRAMMING LANGUAGE [J].
CHERNIAVSKY, JC ;
KAMIN, SN .
JOURNAL OF THE ACM, 1979, 26 (01) :119-128
[8]   PROGRAMMING LANGUAGE CONSTRUCTS FOR WHICH IT IS IMPOSSIBLE TO OBTAIN GOOD HOARE AXIOM SYSTEMS [J].
CLARKE, EM .
JOURNAL OF THE ACM, 1979, 26 (01) :129-147
[9]   SOUNDNESS AND COMPLETENESS OF AN AXIOM SYSTEM FOR PROGRAM VERIFICATION [J].
COOK, SA .
SIAM JOURNAL ON COMPUTING, 1978, 7 (01) :70-90
[10]  
DEBAKKER JW, 1980, MATH THEORY PROGRAM