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

来源：

JOURNAL OF COMPUTER AND SYSTEM SCIENCES | 1982年 / 25卷 / 03期

关键词：

D O I：

10.1016/0022-0000(82)90013-7

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：267 / 284

页数：18

共 26 条

[1] 10 YEARS OF HOARE LOGIC - A SURVEY .1. [J].

APT, KR .

ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1981, 3 (04) :431-483

[2] FLOYD PRINCIPLE, CORRECTNESS THEORIES AND PROGRAM EQUIVALENCE [J].

BERGSTRA, JA ;

TIURYN, J ;

TUCKER, JV .

THEORETICAL COMPUTER SCIENCE, 1982, 17 (02) :113-149

[3] SOME NATURAL STRUCTURES WHICH FAIL TO POSSESS A SOUND AND DECIDABLE HOARE-LIKE LOGIC FOR THEIR WHILE-PROGRAMS [J].

BERGSTRA, JA ;

TUCKER, JV .

THEORETICAL COMPUTER SCIENCE, 1982, 17 (03) :303-315

[4]

BERGSTRA JA, 1981, UNPUB AXIOMATIC SEMA

[5]

BERGSTRA JA, UNPUB HOARES LOGIC P

[6]

BERGSTRA JA, UNPUB INF P LETT

[7]

BERGSTRA JA, UNPUB THEORET COMP S

[8]

CHANG C. C., 1973, MODEL THEORY

[9] 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

[10] SOUNDNESS AND COMPLETENESS OF AN AXIOM SYSTEM FOR PROGRAM VERIFICATION [J].

COOK, SA .

SIAM JOURNAL ON COMPUTING, 1978, 7 (01) :70-90

← 1 2 3 →