Hypergraph rewriting: critical pairs and undecidability of confluence
Term graph rewriting
Handbook of graph grammars and computing by graph transformation: volume I. foundations
Handbook of graph grammars and computing by graph transformation: volume I. foundations
Partial confluence of processes and systems of objects
Theoretical Computer Science
Handbook of graph grammars and computing by graph transformation: vol. 2: applications, languages, and tools
Proceedings of the 24th International Conference on Software Engineering
OOZE: An Object Oriented Z Environment
ECOOP '91 Proceedings of the European Conference on Object-Oriented Programming
A Formal Semantics of UML Statecharts by Model Transition Systems
ICGT '02 Proceedings of the First International Conference on Graph Transformation
On Termination of Graph Rewriting
WG '95 Proceedings of the 21st International Workshop on Graph-Theoretic Concepts in Computer Science
The Rhapsody UML Verification Environment
SEFM '04 Proceedings of the Software Engineering and Formal Methods, Second International Conference
Fundamentals of Algebraic Graph Transformation (Monographs in Theoretical Computer Science. An EATCS Series)
Interaction Analysis in Aspect-Oriented Models
RE '06 Proceedings of the 14th IEEE International Requirements Engineering Conference
A Survey of Object-Oriented Petri Nets and Analysis Methods
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Attributed graph transformation with node type inheritance
Theoretical Computer Science
Formal Verification of Object-Oriented Graph Grammars Specifications
Electronic Notes in Theoretical Computer Science (ENTCS)
Efficient Conflict Detection in Graph Transformation Systems by Essential Critical Pairs
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Object-oriented analysis and design with applications, third edition
Object-oriented analysis and design with applications, third edition
Embedding and Confluence of Graph Transformations with Negative Application Conditions
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Electronic Notes in Theoretical Computer Science (ENTCS)
Specifying Domain-Specific Refactorings for AndroMDA Based on Graph Transformation
Applications of Graph Transformations with Industrial Relevance
Confluence in Domain-Independent Product Line Transformations
FASE '09 Proceedings of the 12th International Conference on Fundamental Approaches to Software Engineering: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Dependent and Conflicting Change Operations of Process Models
ECMDA-FA '09 Proceedings of the 5th European Conference on Model Driven Architecture - Foundations and Applications
Proceedings of the First International Workshop on Model-Driven Interoperability
Certifying Rule-Based Models using Graph Transformation: Extended, Improved and New Graph Transformation Analysis Techniques Clearing the Way for a General Road Map to Certification
Henshin: advanced concepts and tools for in-place EMF model transformations
MODELS'10 Proceedings of the 13th international conference on Model driven engineering languages and systems: Part I
Extending variability for OCL interpretation
MODELS'10 Proceedings of the 13th international conference on Model driven engineering languages and systems: Part I
Formal analysis of functional behaviour for model transformations based on triple graph grammars
ICGT'10 Proceedings of the 5th international conference on Graph transformations
Local confluence for rules with nested application conditions
ICGT'10 Proceedings of the 5th international conference on Graph transformations
Formal analysis and verification of self-healing systems
FASE'10 Proceedings of the 13th international conference on Fundamental Approaches to Software Engineering
Termination criteria for model transformation
FASE'05 Proceedings of the 8th international conference, held as part of the joint European Conference on Theory and Practice of Software conference on Fundamental Approaches to Software Engineering
Nested constraints and application conditions for high-level structures
Formal Methods in Software and Systems Modeling
Confluence of graph transformation revisited
Processes, Terms and Cycles
Defining object-oriented execution semantics using graph transformations
FMOODS'06 Proceedings of the 8th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems
Model checking dynamic states in GROOVE
SPIN'06 Proceedings of the 13th international conference on Model Checking Software
Graph transformations for MDE, adaptation, and models at runtime
SFM'12 Proceedings of the 12th international conference on Formal Methods for the Design of Computer, Communication, and Software Systems: formal methods for model-driven engineering
Proceedings of the Eleventh ACM International Conference on Embedded Software
Hi-index | 5.23 |
Inheritance is an important and widely spread concept enabling the elegant expression of hierarchy in object-oriented software programs or models. It has been defined for graphs and graph transformations enhancing the applicability of this formal technique. Up to now, for the analysis of transformations with inheritance a flattening construction has been used, which yields all the well-known results for graph transformation but results in a large number of graphs and rules that have to be analyzed. In this paper, we introduce a new category of typed attributed graphs with inheritance. For the detection of conflicts between graph transformations on these graphs, the notion of abstract critical pairs is defined. This allows us to perform the analysis on polymorphic rules and transformations without the need for flattening, which significantly increases the efficiency of the analysis and eases the interpretation of the analysis results. The new main result is the Local Confluence Theorem for typed attributed graph transformation with inheritance using abstract critical pairs. All constructions and results are demonstrated on an example for the analysis of refactorings.