Filters








38,393 Hits in 6.5 sec

A Component Concept for Typed Graphs with Inheritance and Containment Structures [chapter]

Stefan Jurack, Gabriele Taentzer
2010 Lecture Notes in Computer Science  
Based on the concept of distributed graphs, we propose typed composite graphs with inheritance and containment to specify logical distribution structures of EMF models.  ...  The category-theoretical foundation of this kind of composite graphs forms a solid basis for the precise definition of typed composite graph transformations obeying inheritance and containment conditions  ...  Typed Graphs with Inheritance and Containment Structures In this section, we formally define typed graphs with inheritance and containment.  ... 
doi:10.1007/978-3-642-15928-2_13 fatcat:q2dniryxpffy5prbrail3w3iiq

Pattern-based design recovery of Java software

Jochen Seemann, Jürgen Wolff von Gudenberg
1998 Proceedings of the 6th ACM SIGSOFT international symposium on Foundations of software engineering - SIGSOFT '98/FSE-6  
We define criteria for the automatic detection of associations and aggregations between classes, as well as for some of the popular design patterns such as composite or strategy.  ...  The' result of the compile phase is a graph acting as the starting graph of a graph grammar that describes our design recovery process.  ...  Acknowledgement We like to thank the referees whose valuable comments helped to improve the presentation of our ideas.  ... 
doi:10.1145/288195.288207 dblp:conf/sigsoft/SeemannG98 fatcat:2t32qidlpjfcxcnzklr5njlpce

A graph-based approach to modeling and detecting composition conflicts related to introductions

Wilke Havinga, Istvan Nagy, Lodewijk Bergmans, Mehmet Aksit
2007 Proceedings of the 6th international conference on Aspect-oriented software development - AOSD '07  
To analyze the causes of these conflicts precisely, we first model the structure of programs as graphs. Next, we model introductions as graph transformation rules.  ...  The goal of this paper is to model and detect composition conflicts related to introductions. Within this context, we identify several categories of composition conflicts.  ...  However, OO languages usually assume that the inheritance structure cannot contain cycles.  ... 
doi:10.1145/1218563.1218574 dblp:conf/aosd/HavingaNBA07 fatcat:si67nfj5fffmxbcskk7cier63y

Towards a General Composition Semantics for Rule-Based Model Transformation [chapter]

Dennis Wagelaar, Massimo Tisi, Jordi Cabot, Frédéric Jouault
2011 Lecture Notes in Computer Science  
We will discuss how ATL and graph transformations can be mapped to modules and rules inside the virtual machine.  ...  One way to compose model transformations is to compose modules of transformation rules, and execute the composition as one transformation (internal composition).  ...  Therefore, we introduce a basic, proof-of-concept graph transformation language with built-in rule inheritance and module import support: SimpleGT.  ... 
doi:10.1007/978-3-642-24485-8_46 fatcat:lfdpsxg6cvfclasvq4mmhah3wi

Building adaptable and reusable XML applications with model transformations

Ivan Kurtev, Klaas van den Berg
2005 Proceedings of the 14th international conference on World Wide Web - WWW '05  
In that way we achieve reuse and composition of XML applications.  ...  Transformation rules and the application model for an XML language may be composed with the corresponding rules and application models defined for other XML languages.  ...  The source contains one component, which is a variable of type Element with an imposed condition.  ... 
doi:10.1145/1060745.1060772 dblp:conf/www/KurtevB05 fatcat:24eibwitrncrdjogukgtc4cgfi

A Graph-based Semantics For Object-oriented Programming Constructs

Ana Paula Lüdtke Ferreira, Leila Ribeiro
2005 Electronical Notes in Theoretical Computer Science  
The formalism combines labelled graphs with partial orders, to adequately model the (single) inheritance relation among objects and the overriding relation between methods within derived classes.  ...  The semantics of system extension by inheritance and aggregation is then defined as colimits in a suitable category of object-oriented system specifications and their morphisms.  ...  Graphs can provide a model of computation if combined with graph rules, to form a graph transformation system.  ... 
doi:10.1016/j.entcs.2004.06.053 fatcat:6q3zbgcdbvhwlbekak5r72ijqi

Attributed graph transformation with node type inheritance

Juan de Lara, Roswitha Bardohl, Hartmut Ehrig, Karsten Ehrig, Ulrike Prange, Gabriele Taentzer
2007 Theoretical Computer Science  
The aim of this paper is to integrate typed attributed graph transformation with node type inheritance.  ...  The main results of this paper show that attributed graph transformation with node type inheritance is fully compatible with the existing concept of typed attributed graph transformation.  ...  Typed Attributed Graph Transformation with Inheritance In this section, we show how to adapt the concept of inheritance to the notions of typed attributed graph transformation, graph grammar and graph  ... 
doi:10.1016/j.tcs.2007.02.001 fatcat:3zzyt7hacbcsrbjiizn4ebg3v4

On formalizing EMF modeling operations with graph transformations

Petra Brosch, Sebastian Gabmeyer, Gerti Kappel, Martina Seidl
2012 Software engineering notes  
Desirable yet contradicting properties of model transformations are user-friendliness as offered by by-demonstration approaches and formal conciseness as provided by algebraic graph transformations which  ...  The development of software in accordance with the modeldriven engineering paradigm places model transformations at a central position.  ...  An attributed type graph with inheritance is extended by a set C of containment edges to support composition.  ... 
doi:10.1145/2237796.2237810 fatcat:2v3j26lh5fcvpjse34bnsvrexq

Transformation of Type Graphs with Inheritance for Ensuring Security in E-Government Networks [chapter]

Frank Hermann, Hartmut Ehrig, Claudia Ermel
2009 Lecture Notes in Computer Science  
The technique is based on the formal theory of graph transformation, which we extend to transformations of type graphs with inheritance within a type graph hierarchy.  ...  The extended theory is shown to fulfil the conditions of a weak adhesive HLR category allowing us to transfer analysis techniques and results shown for this abstract framework of graph transformation.  ...  Transformation of Graphs with Inheritance Graph transformation with node type inheritance [6, 9] provides main aspects of inheritance, in particular inheritance of attributes and edge types from parent  ... 
doi:10.1007/978-3-642-00593-0_22 fatcat:ukd5tm5itjb4bgcninboemu4cm

DiTo — A Distribution Tool Based on Graph Rewriting [chapter]

Ansgar Radermacher
2000 Lecture Notes in Computer Science  
In the paper Support for Design Patterns through Graph Transformation Tools in this volume, we have already outlined the global structure of a tool that allows for the analysis and transformation of software  ...  architectures using graph tests and rewrite rules, respectively.  ...  «stereotype» name interface class/ pkg. name package with contained classes Elements (node types) inheritance Shorthands (dependency relationship) «creates» «calls» containment  ... 
doi:10.1007/3-540-45104-8_39 fatcat:3lzzy4koqjd47nf4g4szgpxvaa

A Modeling and Verification Approach Based on Graph Transformation

Wafa Chama, Raida Elmansouri, Allaoua Chaoui
2013 Lecture Notes on Software Engineering  
To reach this goal we propose in this paper, a framework and a tool based on graph transformation allowing an automatic translation of some UML diagrams to equivalent Maude formal specifications.  ...  UML is a standard modeling language with an open notation and several concepts to be widely used in software modeling. However UML suffers from a lack of formal semantics.  ...  [9] is used to model the behavior of a system, contains states and other types of transitions (events and actions); states may also contain subdiagrams called Composite states which can be sequential  ... 
doi:10.7763/lnse.2013.v1.9 fatcat:u4ibrxpclrcj5mwmru72rxxez4

Fragmenta: A theory of fragmentation for MDE

Nuno Amalio, Juan de Lara, Esther Guerra
2015 2015 ACM/IEEE 18th International Conference on Model Driven Engineering Languages and Systems (MODELS)  
The theory is based on an algebraic description of models, fragments and clusters based on graphs and morphisms.  ...  structure to model instances, (iii) FRAGMENTA's support for both top-down and bottom-up design, and (iv) our formally proved result that shows that inheritance hierarchies remain well-formed (acyclic)  ...  Graph CG MONDO M of Fig. 7 : 7 FRAGMENTA's colimit composition Fig. 8 : 8 Typed fragment structure (a) and example (b).  ... 
doi:10.1109/models.2015.7338241 dblp:conf/models/AmalioLG15 fatcat:4t4fbdapjrb7rb24hne5dmt77q

Integrating Meta-modelling Aspects with Graph Transformation for Efficient Visual Language Definition and Model Manipulation [chapter]

Roswitha Bardohl, Hartmut Ehrig, Juan de Lara, Gabriele Taentzer
2004 Lecture Notes in Computer Science  
with edge types of some graph class.  ...  In this paper, we extend algebraic graph grammars by a node type inheritance concept which opens up the possibility to integrate both approaches by identifying symbol classes with node types and associations  ...  Typed Graph Transformation with Node Type Inheritance In this section we present our new concepts of typed graph transformation with node type inheritance.  ... 
doi:10.1007/978-3-540-24721-0_16 fatcat:4ocviigkhjds3mowyl5mcc6kw4

Towards a Distributed Modeling Process Based on Composite Models [chapter]

Daniel Strüber, Gabriele Taentzer, Stefan Jurack, Tim Schäfer
2013 Lecture Notes in Computer Science  
This paper proposes a structured process for distributed modeling based on the modularization technique provided by composite models with explicit interfaces.  ...  All main concepts of composite modeling are precisely defined based on category theory.  ...  For example, composite graphs over typed graphs with inheritance and containment as well as inheritance and containmentpreserving graph morphisms are considered in [13] .  ... 
doi:10.1007/978-3-642-37057-1_2 fatcat:wmcvll5tyzdhldolykga2tgnw4

Model Checking and Code Generation for UML Diagrams Using Graph Transformation

Wafa Chama
2012 International Journal of Software Engineering & Applications  
So, in this paper, we propose an approach and a tool based on graph transformation to perform an automatic mapping for verification purposes.  ...  This transformation aims to bridge the gap between informal and formal notations and allows a formal verification of concurrent UML models using Maude language.  ...  A StateChart diagram [7] [2] is used to model the behavior of a system, contains states and other types of transitions (events and actions); states may also contain subdiagrams called Composite states  ... 
doi:10.5121/ijsea.2012.3604 fatcat:nbk3o7rnevfmjhsywuqovouao4
« Previous Showing results 1 — 15 out of 38,393 results