Conditional rewriting logic as a unified model of concurrency
Selected papers of the Second Workshop on Concurrency and compositionality
The expression of graph properties and graph transformations in monadic second-order logic
Handbook of graph grammars and computing by graph transformation
The PROGRES approach: language and environment
Handbook of graph grammars and computing by graph transformation
Specification and proof in membership equational logic
Theoretical Computer Science - Trees in algebra and programming
Proofs-as-Model-Transformations
ICMT '08 Proceedings of the 1st international conference on Theory and Practice of Model Transformations
MTT: The Maude Termination Tool (System Description)
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Rewriting Logic Semantics and Verification of Model 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
An algebraic semantics for MOF
FASE'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Fundamental approaches to software engineering
All about maude - a high-performance logical framework: how to specify, program and verify systems in rewriting logic
A Church-Rosser checker tool for conditional order-sorted equational Maude specifications
WRLA'10 Proceedings of the 8th international conference on Rewriting logic and its applications
On the use of alloy to analyze graph transformation systems
ICGT'06 Proceedings of the Third international conference on Graph Transformations
KM3: a DSL for metamodel specification
FMOODS'06 Proceedings of the 8th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems
Bidirectional model transformations in QVT: semantic issues and open questions
MODELS'07 Proceedings of the 10th international conference on Model Driven Engineering Languages and Systems
Embedding domain-specific modelling languages in maude specifications
ACM SIGSOFT Software Engineering Notes
Tractable model transformation testing
ECMFA'11 Proceedings of the 7th European conference on Modelling foundations and applications
Formal verification of QVT transformations for code generation
Proceedings of the 14th international conference on Model driven engineering languages and systems
On validation of ATL transformation rules by transformation models
Proceedings of the 8th International Workshop on Model-Driven Engineering, Verification and Validation
A K-based formal framework for domain-specific modelling languages
FoVeOOS'11 Proceedings of the 2011 international conference on Formal Verification of Object-Oriented Software
The impact of class model redesign on state machines
ICMT'12 Proceedings of the 5th international conference on Theory and Practice of Model Transformations
A case study based comparison of ATL and SDM
AGTIVE'11 Proceedings of the 4th international conference on Applications of Graph Transformations with Industrial Relevance
| Hi-index | 0.00 |
As the complexity of model transformation (MT) grows, the need to count on formal semantics of MT languages also increases. Firstly, formal semantics provide precise specifications of the expected behavior of transformations, which are crucial for both MT users (to be able to understand them and to use them properly) and MT tool builders (to develop correct MT engines, optimizers, etc.). Secondly, we need to be able to reason about the MTs to prove their correctness. This is specially important in case of large and complex MTs (with, e.g., hundreds or thousands of rules) for which manual debugging is no longer possible. In this paper we present a formal semantics to the ATL model transformation language using rewriting logic and Maude, which allows addressing these issues. This formalization provides additional benefits, such as enabling the simulation of the specifications or giving access to the Maude toolkit to reason about them.