Verification and Synthesis of OCL Constraints Via Topology Analysis

  title={Verification and Synthesis of OCL Constraints Via Topology Analysis},
  author={J{\"o}rg Kreiker and Werner Damm and Tobe Toben and Bernd Westphal},
On the basis of a case-study, we demonstrate the usefulness of topology invariants for model-driven systems development. Considering a graph grammar semantics for a relevant fragment of UML, where a graph represents an object diagram, allows us to apply Topology Analysis, a particular abstract interpretation of graph grammars. The outcome of this analysis is a finite and concise over-approximation of all possible reachable object diagrams, the so-called topology invariant. We discuss how… 
3 Citations
Teaching Software Modelling in an Undergraduate Introduction to Software Engineering
  • B. Westphal
  • Computer Science
    2019 ACM/IEEE 22nd International Conference on Model Driven Engineering Languages and Systems Companion (MODELS-C)
  • 2019
This article presents an (otherwise completely ordinary) undergraduate introduction to software engineering with an emphasis on contemporary software modelling, and introduces proper sub-languages of common modelling languages like UML class diagrams with a complete formal abstract syntax and semantics.
Gap Analysis of Existing Modeling Formalisms
  • Computer Science
  • 2012
This document contains information, which is PROPRIETARY to the DANSE CONSORTIUM, which has received funding from the SEVENTH FRAMEWORK PROGRAMME under grants n° 287716.
Analysis of dynamic evolution systems by spotlight abstraction refinement
Diese Arbeit entwickelt eine formale Analysemethode fur Systemmodelle with einer sich verandernden Prozessanzahl and Verbindungsstruktur, which kann diese iterative Prozedur durch Hinzunahme of statisch berechneten Systeminvarianten weiter verbessert werden.


Abstract Graph Transformation
Counterexample-Guided Abstraction Refinement for the Analysis of Graph Transformation Systems
It is shown that a spurious counterexample is caused by merging nodes during the approximation of graph transformation systems, and a technique is presented for identifying these merged nodes and splitting them using abstraction refinement, which removes the spurious run.
A discrete-time UML semantics for concurrency and communication in safety-critical applications
Model checking UML state machines and collaborations
Model checking for an executable subset of UML
  • F. Xie, V. Levin, J. Browne
  • Computer Science
    Proceedings 16th Annual International Conference on Automated Software Engineering (ASE 2001)
  • 2001
An approach to model checking software system designs specified in xUML, an executable subset of UML, based on automatic translation from xU ML to S/R, the input language of the COSPAN model checker.
A probabilistic extension of UML statecharts: Specification and Verification.
To achieve this, a general recipe to extend a statechart semantics with discrete probability distributions is developed, resulting in Markov decision processes as semantic models.
The Rhapsody UML Verification Environment
How UML models are transformed into a format usable for the VIS model checker is discussed, the specification and verification on a simple example are shown, and how the tool can be used to help determining the memory resources of a model is explained.
Symbolic invariant verification for systems with dynamic structural adaptation
A verification technique for arbitrarily large multi-agent systems from the mechatronic domain, featuring complex coordination and structural adaptation at run-time, and a symbolic verification procedure that allows the computation on an efficient BDD-based graph manipulation engine.
VIATRA - visual automated transformations for formal verification and validation of UML models
An overview of the major design goals and decisions, the underlying formal methodology based on metamodeling and graph transformation, the software architecture based upon the XMI standard, and several benchmark applications of the VIATRA framework are presented.
Shaped Generic Graph Transformation
Adaptive star grammars are proposed, which combine star replacement, a very simple way of graph transformation, with an operation called cloning, which automates the very labor-intensive and therefore time-heavy act of cloning.