2 NORMAL-FORM THEOREMS FOR CSP PROGRAMS

被引：6

作者：

APT, KR

BOUGE, L

CLERMONT, P

机构：

[1] ECOLE NORMALE SUPER,DEPT MATH & INFORMAT,INFORMAT LAB,F-75230 PARIS 05,FRANCE

[2] ETCA,CTME,OP SERV,F-94114 ARCUEIL,FRANCE

[3] UNIV ORLEANS,INFORMAT LAB,F-45067 ORLEANS 02,FRANCE

来源：

关键词：

D O I：

10.1016/0020-0190(87)90001-9

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：165 / 171

页数：7

共 13 条

[1] CORRECTNESS PROOFS OF DISTRIBUTED TERMINATION ALGORITHMS [J].

APT, KR .

ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1986, 8 (03) :388-405

[2]

APT KR, 1985, NATO ASI SERIES F, V14

[3]

APT KR, 1985, RC10975 IBM TJ WATS

[4]

BOUGE L, 1987, THESIS U PARIS 7

[5]

BOUGE L, 1987, LIENS872 REPT

[6]

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

[7]

FRANCEZ N, 1981, LECTURE NOTES COMPUT, V107

GOUDA, MG .

[9] COMMUNICATING SEQUENTIAL PROCESSES [J].

HOARE, CAR .

[10] SOME PROPERTIES OF PREDICATE TRANSFORMERS [J].

HOARE, CAR .