Sciweavers

10 search results - page 1 / 2
» Adaptive Star Grammars for Graph Models
Sort
View
ECEASST
2010
13 years 2 months ago
Conditional Adaptive Star Grammars
Abstract. The precise specification of software models is a major concern in model-driven design of object-oriented software. In this paper, we investigate how program graphs, a la...
Berthold Hoffmann
GG
2008
Springer
13 years 5 months ago
Adaptive Star Grammars for Graph Models
Abstract. Adaptive star grammars generalize well-known graph grammar formalisms based on hyperedge and node replacement while retaining, e.g., parseability and the commutativity an...
Frank Drewes, Berthold Hoffmann, Mark Minas
TCS
2010
13 years 3 months ago
Adaptive star grammars and their languages
Motivated by applications that require mechanisms for describing the structure of object-oriented programs, adaptive star grammars are introduced, and their fundamental properties...
Frank Drewes, Berthold Hoffmann, Dirk Janssens, Ma...
EUROPAR
2010
Springer
13 years 2 months ago
Starsscheck: A Tool to Find Errors in Task-Based Parallel Programs
Star Superscalar is a task-based programming model. The programmer starts with an ordinary C program, and adds pragmas to mark functions as tasks, identifying their inputs and outp...
Paul M. Carpenter, Alex Ramírez, Eduard Ayg...
FASE
2005
Springer
13 years 10 months ago
Modelling Parametric Contracts and the State Space of Composite Components by Graph Grammars
Modeling the dependencies between provided and required services within a software component is necessary for several reasons, such as automated component adaptation and architectu...
Ralf Reussner, Jens Happe, Annegret Habel