HOARE LOGIC AND PEANO ARITHMETIC

被引：7

作者：

BERGSTRA, JA ^{[1
]}

TUCKER, JV ^{[1
]}

机构：

[1] UNIV LEEDS,DEPT COMP STUDIES,LEEDS LS2 9JT,W YORKSHIRE,ENGLAND

来源：

THEORETICAL COMPUTER SCIENCE | 1983年 / 22卷 / 03期

关键词：

D O I：

10.1016/0304-3975(83)90107-X

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：265 / 284

页数：20

共 20 条

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

Barwise J., 1977, HDB MATH LOGIC

[3] 2 THEOREMS ABOUT THE COMPLETENESS OF HOARES LOGIC [J].

BERGSTRA, JA ;

TUCKER, JV .

INFORMATION PROCESSING LETTERS, 1982, 15 (04) :143-149

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

BERGSTRA, JA ;

TIURYN, J ;

TUCKER, JV .

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

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

[6]

BERGSTRA JA, 1981, LECTURE NOTES COMPUT, V131

[7]

BERGSTRA JA, 1981, LECTURE NOTES COMPUT, V115

[8]

BERGSTRA JA, 1980, IW149 MATH CTR DEP C

[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

← 1 2 →