Membership algebra as a logical framework for equational specification
WADT '97 Selected papers from the 12th International Workshop on Recent Trends in Algebraic Development Techniques
A Characterisation of Computable Data Types by Means of a Finite Equational Specification Method
Proceedings of the 7th Colloquium on Automata, Languages and Programming
Transformation Rules for UML Class Diagrams
«UML» '98 Selected papers from the First International Workshop on The Unified Modeling Language «UML»'98: Beyond the Notation
VIATRA " Visual Automated Transformations for Formal Verification and Validation of UML Models
Proceedings of the 17th IEEE international conference on Automated software engineering
Understanding Distributed Systems via Execution Trace Data
IWPC '01 Proceedings of the 9th International Workshop on Program Comprehension
The meta-object facility typed
Proceedings of the 2006 ACM symposium on Applied computing
Definition of an Executable SPEM 2.0
APSEC '07 Proceedings of the 14th Asia-Pacific Software Engineering Conference
Simulation-based Verification for Invariant Properties in the OTS/CafeOBJ Method
Electronic Notes in Theoretical Computer Science (ENTCS)
Behavior Preservation in Model Refactoring Using DPO Transformations with Borrowed Contexts
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Supporting user-oriented analysis for multi-view domain-specific visual languages
Information and Software Technology
Unification and Narrowing in Maude 2.4
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
All about maude - a high-performance logical framework: how to specify, program and verify systems in rewriting logic
An algebraic semantics for MOF
Formal Aspects of Computing
A constructive approach to testing model transformations
ICMT'10 Proceedings of the Third international conference on Theory and practice of model transformations
Combining theorem proving and narrowing for rewriting-logic specifications
TAP'10 Proceedings of the 4th international conference on Tests and proofs
Back-annotation of Simulation Traces with Change-Driven Model Transformations
SEFM '10 Proceedings of the 2010 8th IEEE International Conference on Software Engineering and Formal Methods
Embedding domain-specific modelling languages in maude specifications
ACM SIGSOFT Software Engineering Notes
Correct-by-construction model transformations from partially ordered specifications in Coq
ICFEM'10 Proceedings of the 12th international conference on Formal engineering methods and software engineering
A generic tool for tracing executions back to a DSML's operational semantics
ECMFA'11 Proceedings of the 7th European conference on Modelling foundations and applications
Formal real-time model transformations in MOMENT2
FASE'10 Proceedings of the 13th international conference on Fundamental Approaches to Software Engineering
Weaving executability into object-oriented meta-languages
MoDELS'05 Proceedings of the 8th international conference on Model Driven Engineering Languages and Systems
Hi-index | 0.00 |
We propose a formal approach for the definition and analysis of domain-specific modelling languages (dsml). The approach uses standard model-driven engineering artifacts for defining a language's syntax (using metamodels) and its operational semantics (using model transformations). We give formal meanings to these artifacts by translating them to the Maude language: metamodels and models are mapped to equational specifications, and model transformations are mapped to rewrite rules between such specifications, which are also expressible in Maude due to Maude's reflective capabilities. These mappings provide us, on the one hand, with abstract definitions of the mde concepts used for defining dsml, which naturally capture their intended meanings; and, on the other hand, with equivalent executable definitions, which can be directly used by Maude for formal verification. We also study a notion of operational semantics-preserving model transformations, which are model transformations between two dsml that ensure that each execution of a transformed instance is matched by an execution of the original instance. We propose a semi-decision procedure, implemented in Maude, for checking the semantics-preserving property. We also show how the procedure can be adapted for tracing finite executions of the transformed instance back to matching executions of the original one. The approach is illustrated on xspem, a language for describing the execution of activities constrained by time, precedence, and resource availability.