VIATRA " Visual Automated Transformations for Formal Verification and Validation of UML Models
Proceedings of the 17th IEEE international conference on Automated software engineering
Definition of an Executable SPEM 2.0
APSEC '07 Proceedings of the 14th Asia-Pacific Software Engineering Conference
ATL: A model transformation tool
Science of Computer Programming
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
RASCAL: A Domain Specific Language for Source Code Analysis and Manipulation
SCAM '09 Proceedings of the 2009 Ninth IEEE International Working Conference on Source Code Analysis and Manipulation
All about maude - a high-performance logical framework: how to specify, program and verify systems in rewriting logic
Towards a rewriting logic semantics for ATL
ICMT'10 Proceedings of the Third international conference on Theory and practice of model transformations
Matching logic: an alternative to hoare/floyd logic
AMAST'10 Proceedings of the 13th international conference on Algebraic methodology and software technology
Weaving executability into object-oriented meta-languages
MoDELS'05 Proceedings of the 8th international conference on Model Driven Engineering Languages and Systems
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
WRLA'12 Proceedings of the 9th international conference on Rewriting Logic and Its Applications
| Hi-index | 0.00 |
We propose a formal approach for the definition of domain-specific modelling languages (dsmls). The approach uses basic Model-Driven Engineering artifacts for defining a dsml's syntax (using metamodels) and its operational semantics (using model transformations). We give formal meanings to these artifacts by mapping them to the $\mathbb K$ semantic framework. Since the $\mathbb K$ definitions are executable, one obtains an execution engine for dsmls and gains acces to $\mathbb K$'s formal analysis tools. We illustrate the approach on xspem, a language for describing the execution of tasks constrained by time, precedence, and resources.