Showing Full Semantics Preservation in Model Transformation - A Comparison of Techniques

Hülsbusch, Mathias; König, Barbara; Rensink, Arend; Semenyak, Maria; Soltenborn, Christian; Wehrheim, Heike

doi:10.1007/978-3-642-16265-7_14

Cited by 27 publications

(13 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Furthermore we plan to continue our work in [11] and to conduct further case studies in the area of the verification of model transformations. In order to obtain a practically usable method, we have to integrate up-to techniques, but we expect that this can be done without problems.…”

Section: Resultsmentioning

confidence: 99%

“…A successful proof strategy is to show that every left-hand side of a transformation rule is bisimilar to the corresponding right-hand side and then rely on the fact that bisimilarity is a congruence. However, the presence of application conditions, especially negative application conditions which destroy monotonicity, are a severe problem, in fact the major problem we had to deal with in a case study where we compared proof techniques for showing semantics preservation in model transformation [11].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Deriving Bisimulation Congruences for Conditional Reactive Systems

Hülsbusch

König

2012

Foundations of Software Science and Computational Structures

Self Cite

View full text Add to dashboard Cite

Abstract. We consider conditional reactive systems, a general abstract framework for rewriting, in which reactive systemsà la Leifer and Milner are enriched with (nested) application conditions. We study the problem of deriving labelled transitions and bisimulation congruences from a reduction semantics. That is, we synthesize interactions with the environment in order to obtain a compositional semantics. Compared to earlier work we not only address the problem of deriving information about the (minimal) context needed to obtain a full left-hand side and thus be able to perform a reduction, but also generate conditions on the remaining context.

show abstract

Section: Resultsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Deriving Bisimulation Congruences for Conditional Reactive Systems

Hülsbusch

König

2012

Foundations of Software Science and Computational Structures

Self Cite

View full text Add to dashboard Cite

show abstract

“…As a next step, we intend to develop this into a theory that allows the CHART programmer to deduce confluence and termination of his rule system. A more ambitious goal is to be able to prove semantic preservation of model transformations in CHART (see, e.g., [8]). -Based on the formal semantics, we plan to formally verify that the RDT actually produces correct code.…”

Section: Future Workmentioning

confidence: 99%

Graph Transforming Java Data

Mol

Rensink

Hunt

2012

Fundamental Approaches to Software Engineering

Self Cite

View full text Add to dashboard Cite

Abstract. This paper introduces an approach for adding graph transformationbased functionality to existing JAVA programs. The approach relies on a set of annotations to identify the intended graph structure, as well as on user methods to manipulate that structure, within the user's own JAVA class declarations. Other ingredients are a custom transformation language, called CHART, and a compiler from CHART to JAVA. The generated JAVA code runs against the pre-existing, annotated code. The advantage of the approach is that it allows any JAVA program to be enhanced, non invasively, with declarative graph rules, improving clarity, conciseness and verifiability.

show abstract

“…Much work has been done on verifying model transformations, e.g. [10,16], using many different techniques [1,22]. In earlier work, we have developed a formal verification technique to determine whether the definition of a model transformation preserves specific safety or liveness properties, regardless of the model it is applied on [6,[24][25][26].…”

Section: Introductionmentioning

confidence: 99%

Confluence Detection for Transformations of Labelled Transition Systems

Wijs

2015

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

The development of complex component software systems can be made more manageable by first creating an abstract model and then incrementally adding details. Model transformation is an approach to add such details in a controlled way. In order for model transformation systems to be useful, it is crucial that they are confluent, i.e. that when applied on a given model, they will always produce a unique output model, independent of the order in which rules of the system are applied on the input. In this work, we consider Labelled Transition Systems (LTSs) to reason about the semantics of models, and LTS transformation systems to reason about model transformations. In related work, the problem of confluence detection has been investigated for general graph structures. We observe, however, that confluence can be detected more efficiently in special cases where the graphs have particular structural properties. In this paper, we present a number of observations to detect confluence of LTS transformation systems, and propose both a new confluence detection algorithm and a conflict resolution algorithm based on them.Comment: In Proceedings GaM 2015, arXiv:1504.0244

show abstract

Showing Full Semantics Preservation in Model Transformation - A Comparison of Techniques

Cited by 27 publications

References 21 publications

Deriving Bisimulation Congruences for Conditional Reactive Systems

Deriving Bisimulation Congruences for Conditional Reactive Systems

Graph Transforming Java Data

Confluence Detection for Transformations of Labelled Transition Systems

Contact Info

Product

Resources

About