Abstract
Nowadays the Model Driven Software Development gains more and more weightin software development. Its most important concept is the definition of a high
level Platform Independent Model that is transformated into the application usingseveral Model Transformation (MT) steps. So it becomes crucial that development
tools provide support for writing Model Transformations.
The
Viatra2
transformation framework developed at the Department of Mea-
surement and Information Systems is such a supporting sytem, and is used invarious research projects. The framework uses a high level language combining
elements of model transformations and abstract state machines (ASM). For the ele-mentary transformation steps of graph models graph transformation rules are used,while using ASM contructs these steps can be built into a complex transformation
program.
This thesis introduces a static source code analyser system usable for graph
transformation languages. The static source code analysers identify potential faultswithout running the program using only the source code structure and the syntactics
and semantics of the language, thus speeding up development.
The analysis is traced back to solving Constraint Satisfaction Problems (CSP).
The CSP solver systems use a declarative approach of solving combinatoric prob-lems. They use a set of variables by narrowing their possible domain by applyingconstraints. If the domain of a variable becomes the empty set, the problems is
not solvable. The main advantage of using CSP solvers is that they are capable of
propagating the effects of the new constraints forwards and backwards so previous
statements can be reevaluated.
After the general analysis the thesis describes a type safety checker for thetransformation language of the
Viatra2
framework, and displays its result in
Eclipse-based graphical user interface of the framework.
The thesis concludes with a case study based evaluation of the type checker,
and the lists the conceptional and practical limitations.
Leave a Comment