Formal Analysis of Model Transformations Based on Triple Graph Rules with Kernels
DOI10.1007/978-3-540-87405-8_13zbMATH Open1175.68222OpenAlexW1600482346MaRDI QIDQ3540397FDOQ3540397
Authors: Hartmut Ehrig, Ulrike Prange
Publication date: 20 November 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-87405-8_13
Recommendations
- Formal analysis of model transformations based on triple graph grammars
- Formal analysis of functional behaviour for model transformations based on triple graph grammars
- Construction of integrity preserving triple graph grammars
- Toward bridging the gap between formal foundations and current practice for triple graph grammars. Flexible relations between source and target elements
- A static analysis of non-confluent triple graph grammars for efficient model transformation
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Grammars and rewriting systems (68Q42)
Cites Work
Cited In (2)
This page was built for publication: Formal Analysis of Model Transformations Based on Triple Graph Rules with Kernels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3540397)