NONDETERMINISTIC FLOWCHART PROGRAMS WITH RECURSIVE PROCEDURES - SEMANTICS AND CORRECTNESS .2.

被引：8

作者：

GALLIER, JH

机构：

来源：

关键词：

D O I：

10.1016/S0304-3975(81)80001-1

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：239 / 270

页数：32

共 34 条

[1]

APT KR, 1977, IW8477 MATH CTR TECH

[2]

APT KR, 1977, AUTOMATA LANGUAGES P

[3]

ASHCROFT EA, 1970, MACH INTELL, V6, P17

[4]

Bakker J.W. de, 1976, AUTOMATA LANGUAGES P, P435

[5]

Clarke E. M. Jr., 1977, 18th Annual Symposium on Foundations of Computer Science, P18, DOI 10.1109/SFCS.1977.25

[6]

CLARKE EM, 1977, 4TH P ACM S PRINC PR, P10

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

DEBAKKER, JW ;

MEERTENS, LGLT .

[8]

DEROEVER WP, 1976, RECURSIVE PROGRAM SC

[9] NONDETERMINISTIC ALGORITHMS [J].

FLOYD, RW .

[10]

Gallier J. H., 1978, Automata, languages and programming, P251