EXPRESSING PROGRAM LOOPING IN REGULAR DYNAMIC LOGIC

被引：12

|

作者：

MEYER, AR ^{[1
]}

WINKLMANN, K ^{[1
]}

机构：

[1] WASHINGTON STATE UNIV,DEPT COMP SCI,PULLMAN,WA 99164

来源：

THEORETICAL COMPUTER SCIENCE | 1982年 / 18卷 / 03期

关键词：

D O I：

10.1016/0304-3975(82)90071-8

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

收藏

页码：301 / 323

页数：23

相关论文

共 50 条

[1] LOOPING VS REPEATING IN DYNAMIC LOGIC
HAREL, D
SHERMAN, R
INFORMATION AND CONTROL, 1982, 55 (1-3): : 175 - 192
[2] Regular equivalence and dynamic logic
Marx, M
Masuch, M
SOCIAL NETWORKS, 2003, 25 (01) : 51 - 65
[3] SEMANTICS OF LOOPING PROGRAMS IN PROPOSITIONAL DYNAMIC LOGIC
BERMAN, F
MATHEMATICAL SYSTEMS THEORY, 1982, 15 (04): : 285 - 294
[4] MORE ON LOOPING VS REPEATING IN DYNAMIC LOGIC
HAREL, D
PELEG, D
INFORMATION PROCESSING LETTERS, 1985, 20 (02) : 87 - 90
[5] PROPOSITIONAL DYNAMIC LOGIC OF REGULAR PROGRAMS
FISCHER, MJ
LADNER, RE
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1979, 18 (02) : 194 - 211
[6] PROPOSITIONAL DYNAMIC LOGIC OF LOOPING AND CONVERSE IS ELEMENTARILY DECIDABLE
STREETT, RS
INFORMATION AND CONTROL, 1982, 54 (1-2): : 121 - 141
[7] REGULAR DYNAMIC LOGIC IS NOT INTERPRETABLE IN DETERMINISTIC CONTEXT-FREE DYNAMIC LOGIC
STOLBOUSHKIN, AP
INFORMATION AND CONTROL, 1983, 59 (1-3): : 94 - 107
[8] A DYNAMIC LOGIC FOR PROGRAM VERIFICATION
HEISEL, M
REIF, W
STEPHAN, W
LECTURE NOTES IN COMPUTER SCIENCE, 1989, 363 : 134 - 145
[9] Propositional Dynamic Logic with Program Quantifiers
Leivant, Daniel
ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2008, 218 (231-240) : 231 - 240
[10] DETERMINISTIC CONTEXT-FREE DYNAMIC LOGIC IS MORE EXPRESSIVE THAN DETERMINISTIC DYNAMIC LOGIC OF REGULAR PROGRAMS
URZYCZYN, P
LECTURE NOTES IN COMPUTER SCIENCE, 1983, 158 : 496 - 504

← 1 2 3 4 5 →