Guarded commands, nondeterminacy and formal derivation of programs
Communications of the ACM
Expressing UML Class Diagrams Properties with OCL
Object Modeling with the OCL, The Rationale behind the Object Constraint Language
Static composition of refactorings
Science of Computer Programming - Special issue on program transformation
Fundamentals of Algebraic Graph Transformation (Monographs in Theoretical Computer Science. An EATCS Series)
Theory of Constraints and Application Conditions: From Graphs to High-Level Structures
Fundamenta Informaticae - SPECIAL ISSUE ON ICGT 2004
Electronic Notes in Theoretical Computer Science (ENTCS)
Drawing Preconditions of Operation Contracts from Conceptual Schemas
CAiSE '08 Proceedings of the 20th international conference on Advanced Information Systems Engineering
Verification of UML/OCL Class Diagrams using Constraint Programming
ICSTW '08 Proceedings of the 2008 IEEE International Conference on Software Testing Verification and Validation Workshop
Correctness of high-level transformation systems relative to nested conditions†
Mathematical Structures in Computer Science
Incremental integrity checking of UML/OCL conceptual schemas
Journal of Systems and Software
Nested constraints and application conditions for high-level structures
Formal Methods in Software and Systems Modeling
Reasoning on UML class diagrams with OCL constraints
ER'06 Proceedings of the 25th international conference on Conceptual Modeling
Hi-index | 0.01 |
Graph transformation (GT) is being increasingly used in Model Driven Engineering (MDE) to describe in-place transformations like animations and refactorings. For its practical use, rules are often complemented with OCL application conditions. The advancement of rule post-conditions into pre-conditions is a well-known problem in GT, but current techniques do not consider OCL. In this paper we provide an approach to advance post-conditions with arbitrary OCL expressions into pre-conditions. This presents benefits for the practical use of GT in MDE, as it allows: (i) to automatically derive pre-conditions from the meta-model integrity constraints, ensuring rule correctness, (ii) to derive pre-conditions from graph constraints with OCL expressions and (iii) to check applicability of rule sequences with OCL conditions.