Bounded delay for a free address

Acta Informatica

Volumn 33, Issue 3, 1996, Pages 233-254

  Hesselink, Wim H ^a  

^a UNIVERSITY OF GRONINGEN   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030552597     PISSN: 00015903     EISSN: None     Source Type: Journal    
DOI: 10.1007/s002360050042     Document Type: Article

References (12)

1. Apt, K.R., Olderog, E.-R.: Verification of sequential and concurrent programs. New York: Springer 1991
2. Attiya, H., Bar-Noy, A., Dolev, D., Peleg, D., Reischuk, R: Renaming in an asynchronous environment. J. ACM 37 (1990) 524-548
3. Back, R.J.R., Sere, K.: Stepwise refinement of action systems. In: J.L.A. van de Snepscheut (ed.): Mathematics of Program Construction (Lect. Notes Comput. Sci., vol. 375, pp. 115-138) Berlin, Springer: 1989
4. Bar-Noy A., Dolev, D.: Shared-memory vs. message-passing in an asynchronous distributed environment. In Proc. 8th ACM Symp. on principles of distributed computing, pp. 307-318, 1989
5. Borowsky, E., Gafni, A.: Immediate snapshots and fast renaming. In: Proc. 12th ACM Symp. on principles of distributed computing, pp. 41-52, 1993
6. Boyer, R.S., Moore, J.: A computational logic handbook. Boston: Academic Press 1988
7. Chandy, K.M., Misra, J.: Parallel program design, a foundation. Reading, MA: Addison-Wesley 1988
8. Dijkstra, E.W.: A class of allocation strategies inducing bounded delays only. Tech. Rept., Tech. Univ. Eindhoven, EWD 319, 1971
9. Herlihy, M.P., Wait-free synchronization. ACM Trans. Program. Languages Systems 13 (1991) 124-149
10. Hesselink, W.H.: Wait-free linearization with an assertional proof. Distributed Computing 8 (1994) 65-80
11. Hesselink, W.H.: Wait-free linearization with an mechanical proof. Computing Science Notes Groningen CS 9306, to appear in Distributed Computing
12. Owicki, S., Gries, D.: An axiomatic proof technique for parallel programs. Acta Inform. 6 (1976) 319-340