Implementing Relational Queries on Models as Triple Graph Grammars: Unterschied zwischen den Versionen
K (Al5932 verschob die Seite Implementation of Graph Query Operators as Triple Graph Grammar Rules nach Implementing Relational Queries on Models as Triple Graph Grammars) |
Keine Bearbeitungszusammenfassung |
||
| Zeile 7: | Zeile 7: | ||
|termin=Institutsseminar/2025-07-25 | |termin=Institutsseminar/2025-07-25 | ||
|vortragsmodus=in Präsenz | |vortragsmodus=in Präsenz | ||
|kurzfassung=Transformations between models play a vital role in model-driven software development | |||
and engineering. Especially view-based approaches with user-defined views mandate the | |||
need for a simple language or model to specify transformations to views and back, as | |||
well as for synchronizations of incremental changes. We introduce a method based on | |||
relational operators that we implement by utilizing triple graph grammars as an underlying | |||
transformation language. We demonstrate that the approach is sufficiently expressive to | |||
transform models of simple to medium complexity. Nonetheless, we have determined that | |||
further research is required to enhance the expressiveness of the proposed operators. | |||
}} | }} | ||
Version vom 18. Juli 2025, 14:26 Uhr
| Vortragende(r) | Daniel Ritz | |
|---|---|---|
| Vortragstyp | Masterarbeit | |
| Betreuer(in) | Lars König | |
| Termin | Fr 25. Juli 2025, 14:00 (Raum 010 (Gebäude 50.34)) | |
| Vortragssprache | Englisch | |
| Vortragsmodus | in Präsenz | |
| Kurzfassung | Transformations between models play a vital role in model-driven software development
and engineering. Especially view-based approaches with user-defined views mandate the need for a simple language or model to specify transformations to views and back, as well as for synchronizations of incremental changes. We introduce a method based on relational operators that we implement by utilizing triple graph grammars as an underlying transformation language. We demonstrate that the approach is sufficiently expressive to transform models of simple to medium complexity. Nonetheless, we have determined that further research is required to enhance the expressiveness of the proposed operators. | |