Sciweavers

1552 search results - page 296 / 311
» Concepts and Concept-Oriented Programming
Sort
View
CORR
2006
Springer
91views Education» more  CORR 2006»
14 years 9 months ago
Complexity of Data Flow Analysis for Non-Separable Frameworks
The complexity of round robin iterative data flow analysis has been traditionally defined as 1+d where d is the depth of a control flow graph. However, this bound is restricted to ...
Bageshri Karkare, Uday P. Khedker
ENTCS
2006
139views more  ENTCS 2006»
14 years 9 months ago
AspectLISA: An Aspect-oriented Compiler Construction System Based on Attribute Grammars
The use of object-oriented techniques and concepts, like encapsulation and inheritance, greatly improves language specifications towards better modularity, reusability and extensi...
Damijan Rebernak, Marjan Mernik, Pedro Rangel Henr...
CORR
2007
Springer
85views Education» more  CORR 2007»
14 years 9 months ago
Interface groups and financial transfer architectures
Analytic execution architectures have been proposed by the same authors as a means to conceptualize the cooperation between heterogeneous collectives of components such as program...
Jan A. Bergstra, Alban Ponse
DAM
2007
85views more  DAM 2007»
14 years 9 months ago
Testing primitivity on partial words
Primitive words, or strings over a finite alphabet that cannot be written as a power of another string, play an important role in numerous research areas including formal language...
Francine Blanchet-Sadri, Arundhati R. Anavekar
DM
2007
125views more  DM 2007»
14 years 9 months ago
Generalized switch-setting problems
Switch-setting games like Lights Out are typically modelled as a graph, where the vertices represent switches and lamps, and the edges capture the switching rules. We generalize t...
Torsten Muetze