Skip to main content

Toward Reusable Synchronisation for Object-Oriented Languages

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1543))

Abstract

The integration of concurrency and object-orientation, despite much research, has been problematic due to the conflicts that can arise between synchronisation and inheritance, which limit the reuse potential of concurrent objects. Our research aims to provide a means for achieving flexible and reusable synchronisation within existing object-oriented languages, such as JavaTM or C++.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Holmes, D., Noble, J., Potter, J. (1998). Toward Reusable Synchronisation for Object-Oriented Languages. In: Demeyer, S., Bosch, J. (eds) Object-Oriented Technology: ECOOP’98 Workshop Reader. ECOOP 1998. Lecture Notes in Computer Science, vol 1543. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49255-0_136

Download citation

  • DOI: https://doi.org/10.1007/3-540-49255-0_136

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65460-5

  • Online ISBN: 978-3-540-49255-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics