Sciweavers

5904 search results - page 312 / 1181
» Requirements for a Composition Language
Sort
View
126
Voted
ICALP
2004
Springer
15 years 10 months ago
Syntactic Control of Concurrency
Abstract. We consider a finitary procedural programming language (finite data-types, no recursion) extended with parallel composition and binary semaphores. Having first shown t...
Dan R. Ghica, Andrzej S. Murawski, C.-H. Luke Ong
REFLECTION
2001
Springer
15 years 9 months ago
A Hybrid Approach to Separation of Concerns: The Story of SADES
A number of approaches have been proposed to achieve separation of concerns. Although all these approaches form suitable candidates for separating cross-cutting concerns in a syste...
Awais Rashid
ECOOP
1999
Springer
15 years 9 months ago
Type-Safe Delegation for Run-Time Component Adaptation
Abstract. The aim of component technology is the replacement of large monolithic applications with sets of smaller software components, whose particular functionality and interoper...
Günter Kniesel
126
Voted
CONCUR
1998
Springer
15 years 9 months ago
The Regular Viewpoint on PA-Processes
PA is the process algebra allowing non-determinism, sequential and parallel compositions, and recursion. We suggest viewing PA-processes as trees, and using treeautomata technique...
Denis Lugiez, Ph. Schnoebelen
ECOOP
1997
Springer
15 years 8 months ago
Feature-Oriented Programming: A Fresh Look at Objects
We propose a new model for exible composition of objects et of features. Features are similar to (abstract) subclasses, but only provide the core functionality of a (sub)class. Ove...
Christian Prehofer