Progress under bounded fairness

Distributed Computing

Volumn 12, Issue 4, 1999, Pages 197-207

  Hesselink, Wim H ^a,b,c,d  

^a UNIVERSITY OF GRONINGEN   (Netherlands)

^b UTRECHT UNIVERSITY   (Netherlands)

^c UNIVERSITY OF TEXAS AT AUSTIN   (United States)

^d Groninger Universiteitsfonds ^*  (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDED FAIRNESS; SHARED-MEMORY DISTRIBUTED SYSTEMS;

ALGORITHMS; CLIENT SERVER COMPUTER SYSTEMS; COMPUTER ARCHITECTURE; DATA STORAGE EQUIPMENT; FAULT TOLERANT COMPUTER SYSTEMS; THEOREM PROVING;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0033356446     PISSN: 01782770     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004460050066     Document Type: Article

References (12)

1. A. Arora: Efficient reconfiguration of trees: a case study in methodological design of nonmasking fault-tolerant programs. In: H. Langmaak, W.-P. de Roever, J. Vytopil (eds.): Formal Techniques in Real-Time and Fault-Tolerant Systems. Springer 1994 (LNCS 863). pp 110-127
2. K.M. Chandy, J. Misra: Parallel Program Design, A Foundation (Addison-Wesley, 1988)
3. N. Francez: Fairness. Springer, Berlin Heidelberg New York 1986
4. M.P. Herlihy: Wait-free synchronization. ACM Trans. on Program. Languages and Systems 13: 124-149 (1991)
5. M.P. Herlihy, J. Wing: Linearizability: a correctness condition for concurrent objects. ACM Trans Program Lang Syst 12: 463-492 (1990)
6. W.H. Hesselink: Wait-tree linearization with an assertional proof. Distributed Computing 8: 65-80 (1994)
7. W.H. Hesselink: Theories for mechanical proofs of imperative programs. Formal Aspects of Computing 9: 448-468 (1997)
8. W.H. Hesselink: The design of a linearization of a concurrent data object. In: D. Gries, W.-P. de Roever (eds.): Programming Concepts and Methods, Proceedings Procomet '98, Chapman & Hall, IFIP 1998, pp 205-224
9. W.H. Hesselink: Progress for memory management of a concurrent data object. To be obtained from [10]
10. W.H. Hesselink: Web site: http://www.cs.rug.nl/~wim/linproc
11. S. Owicki, D. Gries: An axiomatic proof technique for parallel programs. Acta Informatica 6: 319-340 (1976)
12. F.W. Vaandrager: Verification of a distributed summation algorithm. In I. Lee, S.A. Smolka (editors): Proceedings 6th International Conference on Concurrency Theory (Concur'95). Springer V., 1995 (LNCS 962), pp 190-203