Another Position Paper on Fairness
- Fred B. Schneider ,
- Leslie Lamport
Software Engineering Notes | , Vol 13(3)
This is a more traditional response to Dijkstra’s EWD 1013 (see [79]). We point out that Dijkstra’s same argument can be applied to show that termination is a meaningless requirement because it can’t be refuted by looking at a program for a finite length of time. The real argument in favor of fairness, which we didn’t mention, is that it is a useful concept when reasoning about concurrent systems.
Copyright © 1988 by the Association for Computing Machinery, Inc.Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept, ACM Inc., fax +1 (212) 869-0481, or permissions@acm.org. The definitive version of this paper can be found at ACM's Digital Library --http://www.acm.org/dl/.