Precise Semantics of EMF Model Transformations by Graph Transformation

Biermann, Enrico; Ermel, Claudia; Taentzer, Gabriele

doi:10.1007/978-3-540-87875-9_4

Cited by 60 publications

(37 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We automate the change forward propagation to translate consistently an update on the process model into the service model when a transformation was previously executed. We base our work on the formal foundations of graph rewritings [6], [7] to preserve the model consistency. We have developed a proof-of-concepts prototype to validate our method of the consistency management between the models.…”

Section: Introductionmentioning

confidence: 99%

Alignment and Change Propagation between Business Processes and Service-Oriented Architectures

Dahman

Charoy

Godart

2013

2013 IEEE International Conference on Services Computing

View full text Add to dashboard Cite

Abstract-Increasing the productivity of the Service-Oriented Software Engineering through a model-driven methodology needs to go beyond business services modeling and the automation of transforming models that adhere to the SOA style. Commonly, the business analysts focus on modeling business processes. Then, IT developers implement software architectures that are automatically generated from the process models. In this paper we look forward to maintaining the alignment between business services and their supporting IT assets when business settings evolve. We introduce an approach for an incremental synchronization between business process models and component configuration models that follow SOA architectural principles. We automate the change forward propagation by enforcing in-place translations of the updates on the models in order to preserve their consistency. Rather than executing the entire development process again, software architects can assess the necessity of propagating design decisions to the implementation level by adapting the deployed IT assets according to the business evolutions.

show abstract

Section: Introductionmentioning

confidence: 99%

Alignment and Change Propagation between Business Processes and Service-Oriented Architectures

Dahman

Charoy

Godart

2013

2013 IEEE International Conference on Services Computing

View full text Add to dashboard Cite

show abstract

“…Biermann et al [38] present work on an EMF model transformation framework that is based on graph transformations. They show how the rich theory of algebraic graph transformation can be applied to EMF model transformations.…”

Section: Model Refactoringsmentioning

confidence: 99%

Towards an Integrated Quality Assessment and Improvement Approach for UML Models

Jalbani

Grabowski

Neukirchen

et al. 2009

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Models defined using the Unified Modeling Language (UML) are nowadays common parts of software documentations, specifications and sometimes even implementations. However, there is a broad variety of how UML is used. Reasons can be found, for example, in the lack of generally accepted modeling norms and guidelines, the semi-formal semantics of UML, or the complexity of the language. In practice, these factors inevitably lead to quality problems in UML models that need to be addressed. We investigate and discuss existing work in the field of quality assessment and improvement of UML models and present how we envision an integrated approach to quality assessment and improvement of UML models. We assess a model with a Factor-Criteria-Metrics (FCM) based quality model, detect issues by finding smells and violated metric thresholds in UML models, and improve UML models by applying refactorings using model-to-model transformations.

show abstract

“…An E-condition c over a graph P is of the form true or ∃(a | γ, c ′ ), where a : P ֒→ C is an injective 5 graph morphism with P, C ∈ G(Exp), γ is an assignment constraint, and c ′ is an E-condition over C. Boolean formulae over E-conditions over P yield E-conditions over P , that is, ¬c and c 1 ∧ c 2 are E-conditions over P if c, c 1 , c 2 are E-conditions over P .…”

Section: Definition 52 (E-condition)mentioning

confidence: 99%

“…Applications of graph transformation to programming languages and software engineering include the semantics and implementation of functional programming languages [26,27], the specification and analysis of pointer structures [3,2,33], the semantics of the Unified Modelling Language [17,21] and the semantics and analysis of model transformations [36,9,5,15].…”

Section: Introductionmentioning

confidence: 99%

Verification of Graph Programs

Poskitt

2012

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. GP (for Graph Programs) is an experimental nondeterministic programming language for solving problems on graphs and graph-like structures. The language is based on graph transformation rules, allowing visual programming at a high level of abstraction. In particular, GP frees programmers from dealing with low-level data structures. In this paper, we present a Hoare-style proof system for verifying the partial correctness of (a subset of) graph programs. The pre-and postconditions of the calculus are nested graph conditions with expressions, a formalism for specifying both structural graph properties and properties of labels. We show that our proof system is sound with respect to GP's operational semantics and give examples of its use.

show abstract

Precise Semantics of EMF Model Transformations by Graph Transformation

Cited by 60 publications

References 6 publications

Alignment and Change Propagation between Business Processes and Service-Oriented Architectures

Alignment and Change Propagation between Business Processes and Service-Oriented Architectures

Towards an Integrated Quality Assessment and Improvement Approach for UML Models

Verification of Graph Programs

Contact Info

Product

Resources

About