METRIC INTERPRETATIONS OF INFINITE-TREES AND SEMANTICS OF NON DETERMINISTIC RECURSIVE-PROGRAMS

被引：51

|

作者：

ARNOLD, A

NIVAT, M

机构：

[1] UNIV PARIS 7,F-75221 PARIS 05,FRANCE

[2] LAB INFORMAT THEOR & PROGRAMMAT,PARIS,FRANCE

来源：

THEORETICAL COMPUTER SCIENCE | 1980年 / 11卷 / 02期

关键词：

D O I：

10.1016/0304-3975(80)90045-6

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

收藏

页码：181 / 205

页数：25

相关论文

共 6 条

[1] RECURSIVE-PROGRAMS AND DENOTATIONAL SEMANTICS IN ABSOLUTE LOGICS OF PROGRAMS
PASZTOR, A
THEORETICAL COMPUTER SCIENCE, 1990, 70 (01) : 127 - 150
[2] NONSTANDARD LOGICS OF RECURSIVE-PROGRAMS AND DENOTATIONAL SEMANTICS
PASZTOR, A
LECTURE NOTES IN COMPUTER SCIENCE, 1988, 343 : 255 - 278
[3] DETERMINISTIC DYNAMIC LOGIC OF RECURSIVE-PROGRAMS IS WEAKER THAN DYNAMIC LOGIC
BERMAN, P
LECTURE NOTES IN COMPUTER SCIENCE, 1983, 158 : 14 - 25
[4] Polynomial Invariant Generation for Non-deterministic Recursive Programs
Chatterjee, Krishnendu
Fu, Hongfei
Goharshady, Amir Kafshdar
Goharshady, Ehsan Kafshdar
PROCEEDINGS OF THE 41ST ACM SIGPLAN CONFERENCE ON PROGRAMMING LANGUAGE DESIGN AND IMPLEMENTATION (PLDI '20), 2020, : 672 - 687
[5] There is no fully abstract fixpoint semantics for non-deterministic languages with infinite computations
Computer Science Department, Uppsala University, Box 311, S-751 05 Uppsala, Sweden
Inf. Process. Lett., 6 (289-293):
[6] There is no fully abstract fixpoint semantics for non-deterministic languages with infinite computations
Nystrom, SO
INFORMATION PROCESSING LETTERS, 1996, 60 (06) : 289 - 293