CORRECTNESS PROOFS OF DISTRIBUTED TERMINATION ALGORITHMS

被引：23

作者：

APT, KR

机构：

[1] Univ of Paris 7, Paris, Fr, Univ of Paris 7, Paris, Fr

来源：

ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS | 1986年 / 8卷 / 03期

关键词：

D O I：

10.1145/5956.6000

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

页码：388 / 405

页数：18

共 14 条

[1] A Proof System for Communicating Sequential Processes [J].

Apt, Krzysztof R. ;

Francez, Nissim ;

De Roever, Willem P. .

ACM Transactions on Programming Languages and Systems, 1980, 2 (03) :359-385

[2] 10 YEARS OF HOARE LOGIC - A SURVEY .2. NONDETERMINISM [J].

APT, KR .

THEORETICAL COMPUTER SCIENCE, 1984, 28 (1-2) :83-109

[3]

APT KR, 1985, NATO ASI F, V14, P441

[4]

APT KR, 1985, NATO ASI SERIES F, V14, P475

[5] DERIVATION OF A TERMINATION DETECTION ALGORITHM FOR DISTRIBUTED COMPUTATIONS [J].

DIJKSTRA, EW ;

FEIJEN, WHJ ;

VANGASTEREN, AJM .

INFORMATION PROCESSING LETTERS, 1983, 16 (05) :217-219

[6] DECOMPOSITION OF DISTRIBUTED PROGRAMS INTO COMMUNICATION-CLOSED LAYERS [J].

ELRAD, T ;

FRANCEZ, N .

SCIENCE OF COMPUTER PROGRAMMING, 1982, 2 (03) :155-173

[7]

Francez N., 1980, ACM Transactions on Programming Languages and Systems, V2, P42, DOI 10.1145/357084.357087

[8]

FRANCEZ N, 1981, LECTURE NOTES COMPUT, V107

[9]

Grumberg O., 1981, Algorithmic Languages. Proceedings of the International Symposium, P399

[10] COMMUNICATING SEQUENTIAL PROCESSES [J].

HOARE, CAR .

COMMUNICATIONS OF THE ACM, 1978, 21 (08) :666-677

← 1 2 →