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.
My Menu
Saved Items

Qualifying Types Illustrated by Synchronisation Examples

J. Leslie KeedyContact Information, Gisela MengerContact Information, Christian HeinleinContact Information and Frans HenskensContact Information

(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.

Contact Information J. Leslie Keedy
Email: keedy@informatik.uni-ulm.de

Contact Information Gisela Menger
Email: menger@informatik.uni-ulm.de

Contact Information Christian Heinlein
Email: heinlein@informatik.uni-ulm.de

Contact Information Frans Henskens
Email: henskens@cs.newcastle.edu.au
Fulltext Preview (Small, Large)
Image of the first page of the fulltext

References secured to subscribers.



Export this chapter
Export this chapter as RIS | Text
 
Referenced by
1 newer article

  1. Haustein, Max (2006) JAC: declarative Java concurrency. Concurrency and Computation Practice and Experience 18(5)
    [CrossRef]
Remote Address: 38.107.191.108 • Server: mpweb04
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)