Implementing a practical declarative logic-based model transformation engine

Authors:
Michael Lawley;Kerry Raymond
Affiliations:
Queensland University of Technology, Brisbane, Australia;Queensland University of Technology, Brisbane, Australia
Venue:
Proceedings of the 2007 ACM symposium on Applied computing
Year:
2007

Citing 5
Cited 5

On the declarative semantics of deductive databases and logic programs

Foundations of deductive databases and logic programming
Beyond programming languages

Communications of the ACM
Transformation: The Missing Link of MDA

ICGT '02 Proceedings of the First International Conference on Graph Transformation
Transforming models with ATL

MoDELS'05 Proceedings of the 2005 international conference on Satellite Events at the MoDELS
Practical declarative model transformation with tefkat

MoDELS'05 Proceedings of the 2005 international conference on Satellite Events at the MoDELS

Approaches for Model Transformation Reuse: Factorization and Composition

ICMT '08 Proceedings of the 1st international conference on Theory and Practice of Model Transformations
Extracting Object Interactions Out of Software Contracts Using Model Transformations

ICMT '08 Proceedings of the 1st international conference on Theory and Practice of Model Transformations
Solving Constraints in Model Transformations

ICMT '09 Proceedings of the 2nd International Conference on Theory and Practice of Model Transformations
A framework for model-driven development of information systems: Technical decisions and lessons learned

Journal of Systems and Software
Partial evaluation of model transformations

Proceedings of the 34th International Conference on Software Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

Declarative approaches to specifying model-model transformation are an attractive approach because they can offer implicit source model traversal, automatic traceability management, implicit target object creation, and implicit rule ordering. However, when proposing such a declarative logic-based transformation language, there are two common objections. One is programmer unfamiliarity with declarative style, and the other is that of perceived performance problems. In this paper we address these issues, discussing the design of specific features of the Tefkat transformation engine intended to facilitate writing and debugging declarative transformation specifications, and describing important implementation techniques used to avoid performance problems.