Welcome!
VOLT 2015
Verification Of modeL Transformation
Model transformations are everywhere in software development, implicitly or
explicitly. They became first-class citizens with the advent of MDD. Despite
some recent activity in the field, the work on the verification of model
transformations remains scattered and a clear perspective on the subject is
still not in sight. Furthermore, current model transformation tools lack
verification techniques to support such activities.
The Fourth International Workshop on the Verification Of modeL Transformation
(VOLT 2015) is one of the most accurate venues to offer researchers a dedicated
forum to classify, discuss, propose, and advance verification techniques
dedicated to model transformations.
VOLT 2015 promotes discussions between theoreticians and practitioners from
academy and industry, given its ideal co-location with STAF. A significant part of the workshop includes
a forum for discussing practical applications of model transformations and
related problems. One of the goals of the forum is to collect enough industrial
case studies so that those problems can be stated at a theoretical level. In order to discuss these
and further similar questions, we would like to invite submissions in the form of short papers on ongoing work,
position statements, or novel tool features related to the following topics:
- Application of formal verification, theorem proving,
model checking or testing to model transformation
- Verification techniques dedicated to model transformation
- Taxonomies of techniques for model transformation verification
- Properties relevant to specific model transformations
- Verification of model transformations expressed in languages
such as: ATL, QVT, TGG, VIATRA, Kermeta,
Epsilon, etc.
- Verification of domain-specific model transformations, in contrast to general-purpose transformations
- Case studies and experience reports
- Tools and automation
Organizers
Photo Credit
André Karwath published the picture on the VOLT banner at wikipedia. The picture is published using the creative commons BY-SA 2.5.
|