COMPLETENESS OF INDUCTIVE ASSERTION METHOD

被引：29

作者：

DEBAKKER, JW ^{[1
]}

MEERTENS, LGLT ^{[1
]}

机构：

[1] MATH CTR,2E BOERHAAVE STR 49,AMSTERDAM 1005,NETHERLANDS

来源：

关键词：

D O I：

10.1016/S0022-0000(75)80056-0

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：323 / 357

页数：35

共 19 条

[1] DECIDABLE PROPERTIES OF MONADIC FUNCTIONAL SCHEMAS [J].

ASHCROFT, E ;

MANNA, Z ;

PNUELI, A .

[2]

DEBAKKER JW, 1972, MR142 MATH CENTR REP

[3]

DEBAKKER JW, 1971, MATHEMATICAL CTR TRA, V24

[4]

ENGELFRIET J, 1971, 25 TWENT TU MEM

[5]

Floyd Robert W., 1967, P S APPL MATH, V19, P19, DOI DOI 10.1090/PSAPM/019/0235771

[6]

GINSBURG S, 1966, MATHEMATICAL THEORY

[7]

HITCHCOCK P, 1973, AUTOMATA LANGUAGES P, P225

[8] AN AXIOMATIC BASIS FOR COMPUTER PROGRAMMING [J].

HOARE, CAR .

[9]

KLEENE SC, 1952, INTRO METAMATHEMATIC

[10] FORMALIZATION OF PROPERTIES OF FUNCTIONAL PROGRAMS [J].

MANNA, Z ;

PNUELI, A .