A Compete Proof Rule for Strong Equifair Termination

Authors:
Orna Grumberg;Nissim Francez;Shmuel Katz
Affiliations:
-;-;-
Venue:
Proceedings of the Carnegie Mellon Workshop on Logic of Programs
Year:
1983

Citing 0
Cited 3

Appraising fairness in distributed languages

POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Generalized fair termination

POPL '84 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Fair termination of communicating processes

PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing

Quantified Score

Hi-index	0.00

Visualization

Abstract