Distributed transaction processing systems can be unnecessarily complex when crosscutting concerns, e.g. logging, concurrency controls, transaction management, and access controls, are scattered throughout the transaction processing logic or tangled into otherwise cohesive modules. Aspect orientation has the potential of reducing this kind of complexity with better modularization and encapsulation of crosscutting concerns, but currently aspect-oriented programming languages and frameworks only allow weaving of advice, i.e., the logic for crosscutting concerns, into contexts derived from traditional executable structures, such as method calls, constructors, and exceptions. This paper lays a foundation for weaving advice into distributed tran...
Object-based distributed systems are intended to merge the benefits of both object-based languages a...
Concurrency and failures are fundamental problems in distributed computing. One likes to think that ...
Concurrency and failures are fundamental problems in distributed computing. One likes to think that ...
Distributed transaction processing systems can be unnecessarily complex when crosscutting concerns, ...
Implementing crosscutting concerns for transactions is difficult, even using Aspect-Oriented Program...
Implementing crosscutting concerns for transactions is difficult, even using Aspect-Oriented Program...
The AspectOPTIMA project aims to build an aspect-oriented framework that provides run-time support f...
Abstract. The transaction abstraction is arguably one of the most ap-pealing middleware paradigms. I...
This thesis shows that abstractions provided by current mainstream Object Oriented (OO) languages ar...
The unified theory of concurrency control and recovery integrates atomicity and isolation within a c...
This paper applies a model for distributed databases and transactions with a distinction between glo...
Part 1: Invited PaperInternational audienceThe transaction abstraction is arguably one of the most a...
We have added distributed concurrency control to the MELD object system by representing in progress ...
We present a new model for describing and reasoning about transaction-processing algorithms. The mod...
In multi-tiered distributed systems transaction management has long been a mainstay of concurrency m...
Object-based distributed systems are intended to merge the benefits of both object-based languages a...
Concurrency and failures are fundamental problems in distributed computing. One likes to think that ...
Concurrency and failures are fundamental problems in distributed computing. One likes to think that ...
Distributed transaction processing systems can be unnecessarily complex when crosscutting concerns, ...
Implementing crosscutting concerns for transactions is difficult, even using Aspect-Oriented Program...
Implementing crosscutting concerns for transactions is difficult, even using Aspect-Oriented Program...
The AspectOPTIMA project aims to build an aspect-oriented framework that provides run-time support f...
Abstract. The transaction abstraction is arguably one of the most ap-pealing middleware paradigms. I...
This thesis shows that abstractions provided by current mainstream Object Oriented (OO) languages ar...
The unified theory of concurrency control and recovery integrates atomicity and isolation within a c...
This paper applies a model for distributed databases and transactions with a distinction between glo...
Part 1: Invited PaperInternational audienceThe transaction abstraction is arguably one of the most a...
We have added distributed concurrency control to the MELD object system by representing in progress ...
We present a new model for describing and reasoning about transaction-processing algorithms. The mod...
In multi-tiered distributed systems transaction management has long been a mainstay of concurrency m...
Object-based distributed systems are intended to merge the benefits of both object-based languages a...
Concurrency and failures are fundamental problems in distributed computing. One likes to think that ...
Concurrency and failures are fundamental problems in distributed computing. One likes to think that ...