Abstract
A new fairness notion is proposed for languages with multi-party interactions as the sole interprocess synchronization and communication primitive. The main advantage of this fairness notion is the elimination of starvation occurring solely due to race conditions (i.e., ordering of independent actions). Also, this is the first fairness notion for such languages which is fully-adequate with respect to the criteria presented by K.R. Apt et al. The paper defines the notion, proves its properties, and presents examples of its usefulness.
Original language | English (US) |
---|---|
Pages (from-to) | 292-305 |
Number of pages | 14 |
Journal | Conference Record of the Annual ACM Symposium on Principles of Programming Languages |
DOIs | |
State | Published - 1990 |
Externally published | Yes |
Event | Conference Record of the Seventeenth Annual ACM Symposium on Principles of Programming Languages - San Francisco, CA, USA Duration: Jan 17 1990 → Jan 19 1990 |
ASJC Scopus subject areas
- Software