Constructing optimized constraint-preserving application conditions for model transformation rules

DOI10.1016/j.jlamp.2020.100564zbMath1451.68140OpenAlexW3030637547MaRDI QIDQ780069

Jens Kosiol, Thorsten Arendt, Nebras Nassar, Gabriele Taentzer

Publication date: 14 July 2020

Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jlamp.2020.100564

zbMATH Keywords

correctnessconstraintsmodel transformationgraph transformationvalidity preservation

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Grammars and rewriting systems (68Q42)

Related Items

Preface to the special issue on the 12th international conference on graph transformation ⋮ Unnamed Item ⋮ Unnamed Item

Uses Software

• Henshin
• OCLinEcore
• OCL2AC
• ENFORCe

Cites Work

• Unnamed Item
• Constructing constraint-preserving interaction schemes in adhesive categories
• Constructing optimized validity-preserving application conditions for graph transformation rules
• Fundamentals of algebraic graph transformation
• Graph and model transformation. General framework and applications
• Probabilistic Graph Transformation Systems
• Inductive Invariant Checking with Partial Negative Application Conditions
• Sesqui-Pushout Rewriting
• Constraint Logic Programming Using ECLⁱPS^e
• Correctness of high-level transformation systems relative to nested conditions
• k-Inductive Invariant Checking for Graph Transformation Systems
• Change-Preserving Model Repair
• Graph Transformations
• Adhesive and quasiadhesive categories
• -adhesive transformation systems with nested application conditions. Part 1: parallelism, concurrency and amalgamation