EXPRESSIVENESS AND THE COMPLETENESS OF HOARE LOGIC

被引:15
作者
BERGSTRA, JA [1 ]
TUCKER, JV [1 ]
机构
[1] UNIV LEEDS,DEPT COMP STUDIES,LEEDS LS2 9JT,W YORKSHIRE,ENGLAND
关键词
D O I
10.1016/0022-0000(82)90013-7
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:267 / 284
页数:18
相关论文
共 26 条
[11]  
COOK SA, 1981, CORRIGENDUM, V10, P612
[12]  
DEBAKKER JW, 1980, MATH THEORY PROGRAM
[13]  
Greibach Sheila A., 1975, THEORY PROGRAM STRUC
[14]   SPECIFYING THE SEMANTICS OF WHILE PROGRAMS - A TUTORIAL AND CRITIQUE [J].
GREIF, I ;
MEYER, AR .
ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1981, 3 (04) :484-507
[15]  
Hoare C. A. R., 1973, Acta Informatica, V2, P335, DOI 10.1007/BF00289504
[16]   AN AXIOMATIC BASIS FOR COMPUTER PROGRAMMING [J].
HOARE, CAR .
COMMUNICATIONS OF THE ACM, 1969, 12 (10) :576-&
[17]  
LANGMAACK H, 1980, 7TH AUT LANG PROGR C, P363
[18]  
LIPTON RJ, 1977, 18TH P IEEE S F COMP
[19]  
MALCEV AI, 1961, RUSS MATH SURV, V16, P77
[20]  
MANIN YI, 1977, COURSE MATH LOGIC