USING MESSAGE PASSING FOR DISTRIBUTED-PROGRAMMING - PROOF RULES AND DISCIPLINES

被引：14

作者：

SCHLICHTING, RD ^{[1
]}

SCHNEIDER, FB ^{[1
]}

机构：

[1] CORNELL UNIV,DEPT COMP SCI,ITHACA,NY 14853

来源：

ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS | 1984年 / 6卷 / 03期

关键词：

D O I：

10.1145/579.583

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

页码：402 / 431

页数：30

共 23 条

[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] AXIOMS AND PROOF RULES FOR ADA TASKS [J].

BARRINGER, H ;

MEARNS, I .

IEE PROCEEDINGS-E COMPUTERS AND DIGITAL TECHNIQUES, 1982, 129 (02) :38-48

[3]

Clint M., 1973, Acta Informatica, V2, P50, DOI 10.1007/BF00571463

[4]

Cousot P., 1980, LECT NOTES COMPUTER, V85, P119

[5]

Dijkstra E. W., 1976, DISCIPLINE PROGRAMMI

[6]

FRANCEZ N, 1982, 9TH P ANN ACM S PRIN, P40

[7]

GERTH R, 1982, LECT NOTES COMPUT SC, V140, P252

[8]

GERTH R, 1983, RUUCS832 RIJKS U UTR

[9]

GERTH R, 1982, LECTURE NOTES COMPUT, V137, P132

[10]

GOOD DI, 1979, 6TH P ACM S PRINC PR, P42