Handbook of graph grammars and computing by graph transformation: volume I. foundations
Handbook of graph grammars and computing by graph transformation: volume I. foundations
On the capabilities of while, repeat, and exit statements
Communications of the ACM
Handbook of Process Algebra
A Relational Approach to Defining Transformations in a Metamodel
UML '02 Proceedings of the 5th International Conference on The Unified Modeling Language
Formalising Behaviour Preserving Program Transformations
ICGT '02 Proceedings of the First International Conference on Graph Transformation
Specification of Graph Translators with Triple Graph Grammars
WG '94 Proceedings of the 20th International Workshop on Graph-Theoretic Concepts in Computer Science
Model transformation in the large
Proceedings of the the 6th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on The foundations of software engineering
Validation of model transformations: first experiences using a white box approach
MoDELS'06 Proceedings of the 2006 international conference on Models in software engineering
Refactoring object-oriented specifications with data and processes
FMOODS'07 Proceedings of the 9th IFIP WG 6.1 international conference on Formal methods for open object-based distributed systems
On the correctness of model transformations in the development of embedded systems
Proceedings of the 13th Monterey conference on Composition of embedded systems: scientific and industrial issues
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
Certifiable program generation
GPCE'05 Proceedings of the 4th international conference on Generative Programming and Component Engineering
Conflict detection for graph transformation with negative application conditions
ICGT'06 Proceedings of the Third international conference on Graph Transformations
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
Executable Domain Specific Language for Message-Based System Integration
MODELS '09 Proceedings of the 12th International Conference on Model Driven Engineering Languages and Systems
Bisimulation theory for graph transformation systems
ICGT'10 Proceedings of the 5th international conference on Graph transformations
Showing full semantics preservation in model transformation: a comparison of techniques
IFM'10 Proceedings of the 8th international conference on Integrated formal methods
Formal verification of QVT transformations for code generation
Proceedings of the 14th international conference on Model driven engineering languages and systems
Deriving bisimulation congruences for conditional reactive systems
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
ICGT'12 Proceedings of the 6th international conference on Graph Transformations
Hi-index | 0.01 |
Model transformations support a model-driven design by providing an automatic translation of abstract models into more concrete ones, and eventually program code. Crucial to a successful application of model transformations is their correctness, in the sense that the meaning (semantics) of the models is preserved. This is especially important if the models not only describe the structure but also the intended behaviourof the systems. Reasoning about and showing correctness is, however, often impossible as the source and target models typically lack a precise definition of their semantics.In this paper, we take a first step towards provably correct behavioural model transformations. In particular, we develop transformations from UML Activities (which are visual models) to programs in TAAL, which is a textual Java-like programming language. Both languages come equipped with formal behavioural semantics, which, moreover, have the same semantic domain. This sets the stage for showing correctness, which in this case comes down to showing that the behaviour of every (well-formed) UML Activity coincides with that of the corresponding TAAL program, in a well-defined sense.