Variability-based model transformation: formal foundation and application
DOI10.1007/S00165-017-0441-3zbMATH Open1380.68133OpenAlexW2768544685MaRDI QIDQ682373FDOQ682373
Authors: J. Rubin, J. Plöger, Daniel Strüber, Thorsten Arendt, Marsha Chechik, Gabriele Taentzer
Publication date: 2 February 2018
Published in: Formal Aspects of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00165-017-0441-3
Recommendations
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60)
Cites Work
- \textit{RuleMerger}: automatic construction of variability-based model transformation rules
- The complexity of theorem-proving procedures
- Title not available (Why is that?)
- Multi-amalgamation of rules with application conditions in \(\mathcal{M}\)-adhesive categories
- Fundamental theory for typed attributed graphs and graph transformation based on adhesive HLR categories
- Graph Transformations
- Generalised compositionality in graph transformation
- Title not available (Why is that?)
- Duality for simple \(\omega\)-categories and disks
- Title not available (Why is that?)
- Title not available (Why is that?)
- \(\mathcal M\)-adhesive transformation systems with nested application conditions. II: Embedding, critical pairs and local confluence
- From Core OCL invariants to nested graph constraints
- Compositionality in graph transformation
- Granularity of conflicts and dependencies in graph transformation systems
- -adhesive transformation systems with nested application conditions. Part 1: parallelism, concurrency and amalgamation
Cited In (3)
Uses Software
This page was built for publication: Variability-based model transformation: formal foundation and application
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q682373)