FAIRNESS IN PARALLEL PROGRAMS - THE TRANSFORMATIONAL APPROACH

被引：28
作者：
OLDEROG, ER
APT, KR
机构：
[1] CENTRUM WISKUNDE & INFORMAT,1098 SJ AMSTERDAM,NETHERLANDS
[2] UNIV TEXAS,AUSTIN,TX 78712
来源：
ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS | 1988年 / 10卷 / 03期
关键词：
D O I：
10.1145/44501.44504
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
引用
收藏
页码：420 / 455
页数：36
相关论文
共 32 条
[1]   FAIR TERMINATION REVISITED WITH DELAY [J].
APT, KR ;
PNUELI, A ;
STAVI, J .
THEORETICAL COMPUTER SCIENCE, 1984, 33 (01) :65-84
[2]   PROOF RULES AND TRANSFORMATIONS DEALING WITH FAIRNESS [J].
APT, KR ;
OLDEROG, ER .
SCIENCE OF COMPUTER PROGRAMMING, 1983, 3 (01) :65-100
[3]  
APT KR, 1984, LECT NOTES COMPUT SC, V166, P26
[4]   COUNTABLE NONDETERMINISM AND RANDOM ASSIGNMENT [J].
APT, KR ;
PLOTKIN, GD .
JOURNAL OF THE ACM, 1986, 33 (04) :724-767
[5]  
APT KR, 1987, 14TH P ACM S POPL, P189
[6]  
BARRINGER H, 1986, 18TH POPL ACM, P173
[7]   A WEAKER PRECONDITION FOR LOOPS [J].
BOOM, HJ .
ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1982, 4 (04) :668-677
[8]   TRANSFORMATIONAL SEMANTICS FOR CONCURRENT PROGRAMS [J].
BROY, M .
INFORMATION PROCESSING LETTERS, 1980, 11 (02) :87-91
[9]  
Broy M., 1981, 2nd International Conference on Distributed Computing Systems, P116
[10]  
Dijkstra E. W., 1976, DISCIPLINE PROGRAMMI
1234