THE AXIOMATIC SEMANTICS OF PROGRAMS BASED ON HOARES LOGIC

被引：4

作者：

BERGSTRA, JA ^{[1
]}

TUCKER, JV ^{[1
]}

机构：

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

来源：

ACTA INFORMATICA | 1984年 / 21卷 / 03期

关键词：

D O I：

10.1007/BF00264252

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：293 / 320

页数：28

共 38 条

[1] A COMPLETE LOGIC FOR REASONING ABOUT PROGRAMS VIA NONSTANDARD MODEL-THEORY .1. [J].

ANDREKA, H ;

NEMETI, I ;

SAIN, I .

THEORETICAL COMPUTER SCIENCE, 1982, 17 (02) :193-212

[2]

ANDREKA H, 1978, B SECTION LOGIC WROC, V7, P115

[3]

ANDREKA H, 1981, LECT N COMP, V118, P162

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

APT, KR .

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

[5] HOARE LOGIC AND PEANO ARITHMETIC [J].

BERGSTRA, JA ;

TUCKER, JV .

THEORETICAL COMPUTER SCIENCE, 1983, 22 (03) :265-284

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

BERGSTRA, JA ;

TUCKER, JV .

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

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

BERGSTRA, JA ;

TIURYN, J ;

TUCKER, JV .

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

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

[9]

BERGSTRA JA, 1981, LECTURE NOTES COMPUT, V131, P24

[10]

BERGSTRA JA, 1984, THEOR COMPUT SCI, V28, P213

← 1 2 3 4 →