Translating Essential OCL Invariants to Nested Graph Constraints Focusing on Set Operations

DOI10.1007/978-3-319-21145-9_10zbMath1321.68203OpenAlexW997242481MaRDI QIDQ2947219

Hendrik Radke, Jan Steffen Becker, Thorsten Arendt, Annegret Habel, Gabriele Taentzer

Publication date: 22 September 2015

Published in: Graph Transformation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-21145-9_10

zbMATH Keywords

set operationsmeta-modelinggraph constraintsessential OCL

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Grammars and rewriting systems (68Q42) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (4)

Translating Essential OCL Invariants to Nested Graph Constraints Focusing on Set Operations ⋮ Unnamed Item ⋮ Evaluation diversity for graph conditions ⋮ Evaluation diversity for graph conditions

Uses Software

• Alloy
• Henshin
• UMLtoCSP

Cites Work

• Unnamed Item
• Alloy
• Henshin
• Symbolic graphs for attributed graph constraints
• Fundamentals of algebraic graph transformation
• Hoare-Style Verification of Graph Programs
• Translating Essential OCL Invariants to Nested Graph Constraints Focusing on Set Operations
• Tableau-Based Reasoning for Graph Properties
• From Core OCL Invariants to Nested Graph Constraints
• Development of Correct Graph Transformation Systems
• Correctness of high-level transformation systems relative to nested conditions
• Graph Transformations
• Formal Methods in Software and Systems Modeling

This page was built for publication: Translating Essential OCL Invariants to Nested Graph Constraints Focusing on Set Operations