Concurrency control for composite objects

An essential motivation behind concurrent object-oriented systems is to exploit thesoftware modularity and reuse potential of object-oriented features in the developmentof concurrent systems. However, the marriage between the two disciplines hasnot been a happy one. In this work we propose a model that reduces the problemsassociated with introducing concurrency into object-oriented languages. We exploretechniques for reasoning about synchronisation requirements in composite object systemsoperating in a concurrent environment. Furthermore we investigate safe lockingstrategies, where the locks may be distributed over the components of the system andidentify conditions for such locks to be non-redundant.Through the recognition of a Galois connection, we achieve an elegant mathematicalcharacterisation of the lock-distribution problem, which allows us to identifyefficient strategies and tools for assisting developers with lock selection