PROPOSITIONAL DYNAMIC LOGIC OF NONREGULAR PROGRAMS

被引：43

作者：

HAREL, D ^{[1
]}

PNUELI, A ^{[1
]}

STAVI, J ^{[1
]}

机构：

[1] BAR ILAN UNIV,DEPT MATH & COMP SCI,RAMAT GAN,ISRAEL

来源：

JOURNAL OF COMPUTER AND SYSTEM SCIENCES | 1983年 / 26卷 / 02期

关键词：

D O I：

10.1016/0022-0000(83)90014-4

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：222 / 243

页数：22

共 15 条

[1]

Bar-Hillel Yehoshua, 1961, SPRACHTYPOLOGIE UNIV, V14, P143

[2]

DAVIS M, 1976, P S PURE MATH, V28, P323

[3] COMPLETENESS OF INDUCTIVE ASSERTION METHOD [J].

DEBAKKER, JW ;

MEERTENS, LGLT .

JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1975, 11 (03) :323-357

[4] PROPOSITIONAL DYNAMIC LOGIC OF REGULAR PROGRAMS [J].

FISCHER, MJ ;

LADNER, RE .

JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1979, 18 (02) :194-211

[5] SUPERDETERMINISTIC PDAS - A SUBCASE WITH A DECIDABLE INCLUSION PROBLEM [J].

GREIBACH, SA ;

FRIEDMAN, EP .

JOURNAL OF THE ACM, 1980, 27 (04) :675-700

[6]

HAREL D, 1981, SPRINGER VERLAG LECT, V131

[7]

Harrison M., 1978, INTRO FORMAL LANGUAG

[8] 2 DECIDABILITY RESULTS FOR DETERMINISTIC PUSHDOWN AUTOMATA [J].

LINNA, M .

JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1979, 18 (01) :92-107

[9]

MEYER AR, 1981, 8TH P INT C AUT LANG

[10]

OLSHANSKY T, THERE EXIST DECIDABL

← 1 2 →