Typing Non-uniform Concurrent Objects

  • Authors:
  • António Ravara;Vasco Thudichum Vasconcelos

  • Affiliations:
  • -;-

  • Venue:
  • CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
  • Year:
  • 2000

Quantified Score

Hi-index 0.05

Visualization

Abstract

Concurrent objects may offer services non-uniformly, constraining the acceptance of messages on the states of objects. We advocate a looser view of communication errors. Safe programmes must guarantee that every message has a chance of being received if it requests a method that may become enabled at some point in the future. We formalise non-uniform concurrent objects in TyCO, a name-passing object calculus, and ensure program safety via a type system. Types are terms of a process algebra that describes dynamic aspects of the behaviour of objects.