Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
|
 |
Qualifying Types Illustrated by Synchronisation Examples
| |
|
Qualifying Types Illustrated by Synchronisation Examples
J. Leslie Keedy7 , Gisela Menger7 , Christian Heinlein7 and Frans Henskens8 
| (7) |
Department of Computer Structures, University of Ulm, D-89069 Ulm, Federal Republic of Germany |
| (8) |
School of Electrical Engineering and Computer Science, University of Newcastle, 2308, N.S.W., Australia |
Abstract
Qualifying types represent a new approach to modifying the behaviour of instances of other types in a general way, in the
form of components which can be designed and implemented without a prior knowledge of the types to be modified or their implementations.
This paper illustrates the idea by showing how they can be used to program various standard synchronisation problems, including
mutual exclusion, reader-writer synchronisation and several variants of the bounded buffer problem.
Fulltext Preview (Small, Large)
 References secured to subscribers.
|
|
|
|
|
|