Automatic Conformance Testing of Optimized Triple Graph Grammar Implementations (bibtex)
Reference:
, "Automatic Conformance Testing of Optimized Triple Graph Grammar Implementations", in Andy Schürr, Daniel Varró, Gergely Varró, Eds., Applications of graph Transformation with Industrial Relevance, 4th International Symposium, (AGTIVE 2011), vol. 7233 of LNCS, pp. 238-253, Springer, 2012.
Abstract:
In model-driven development, model transformations can be specified using an operational (imperative) or relational (declarative) approach. When using a relational approach, approved formal concepts are necessary to derive a conform operationalization. In general, though, it is not sure if implementations realize these formal concepts in an entirely correct way. Moreover, usually, available formal concepts neither cover every technicality, nor cover each additional optimization an implementation relies on. Consequently, conformance needs to be validated also on the implementation level. Conformance means that for each source model S and target model T related according to the relational specification, a corresponding implementation transforms S into T (and T into S in case that the specification is bidirectional). We present an automatic conformance testing approach for TGG implementations, where the Triple Graph Grammar (TGG) approach is an important representative of relational model transformation approaches. We show that the grammar character of TGGs is very convenient for the automatic generation of conformance test cases. In particular, test input models can be generated together with their expected result obtaining a complete oracle. We show how to measure test suite quality and evaluate our approach on our own TGG implementation.
Links:
@InProceedings{HLG12,
AUTHOR = {Hildebrandt, Stephan and Lambers, Leen and Giese, Holger and Petrick, Dominic and Richter, Ingo},
TITLE = {{Automatic Conformance Testing of Optimized Triple Graph Grammar Implementations}},
YEAR = {2012},
BOOKTITLE = {Applications of graph Transformation with Industrial Relevance, 4th International Symposium, (AGTIVE 2011)},
VOLUME = {7233},
PAGES = {238-253},
EDITOR = {Schürr, Andy and Varró, Daniel and Varró, Gergely},
SERIES = {LNCS},
PUBLISHER = {Springer},
PDF = {uploads/pdf/HLG12.pdf},
OPTacc_pdf = {},
ABSTRACT = {
In model-driven development, model transformations can be specified using an operational (imperative) or relational (declarative) approach. When using a relational approach, approved formal concepts are necessary to derive a conform operationalization. In general, though, it is not sure if implementations realize these formal concepts in an entirely correct way. Moreover, usually, available formal concepts neither cover every technicality, nor cover each additional optimization an implementation relies on. Consequently, conformance needs to be validated also on the implementation level. Conformance means that for each source model S and target model T related according to the relational specification, a corresponding implementation transforms S into T (and T into S in case that the specification is bidirectional).

We present an automatic conformance testing approach for TGG implementations, where the Triple Graph Grammar (TGG) approach is an important representative of relational model transformation approaches. We show that the grammar character of TGGs is very convenient for the automatic generation of conformance test cases. In particular, test input models can be generated together with their expected result obtaining a complete oracle. We show how to measure test suite quality and evaluate our approach on our own TGG implementation.
}
}
Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
Powered by bibtexbrowser