Refactoring Object-Oriented Specifications with Data and Processes

Ruhroth, Thomas; Wehrheim, Heike

doi:10.1007/978-3-540-72952-5_15

Cited by 7 publications

(3 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As Object-Z is not wide-spectrum, this would require an extension to the language, or a mapping of our method to another object-oriented specification language that supports low-level programming constructs. In ongoing work, Ruhroth et al are investigating refactoring transformations of Object-Z specifications in the presence of CSP [13], particularly with respect to those refactoring transformations we refer to as non-structural. Other work by Estler et al incorporates model-checking technologies for the verification of refactorings in Object-Z without CSP [4].…”

Section: Resultsmentioning

confidence: 99%

A Minimal Set of Refactoring Rules for Object-Z

McComb

Smith

2008

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. This paper presents a minimal and complete set of structural refactoring rules for the Object-Z specification language that allow for the derivation of arbitrary object-oriented architectures. The rules are equivalence preserving and work in concert with existing class refinement theory, so that any design derived using the rule set can be shown to be equivalent to, or a refinement of, the original specification.

show abstract

Section: Resultsmentioning

confidence: 99%

A Minimal Set of Refactoring Rules for Object-Z

McComb

Smith

2008

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…The employment of a congruence result is also proposed in [3] which uses the process algebra CSP as a semantic domain. The techniques used in [15,23] mainly treat state-based models, using set theory and predicate logic to show equivalences. In [2] it is shown how to exploit confluence results for graph transformation systems in order to show correctness of refactorings.…”

Section: Discussion and Evaluationmentioning

confidence: 99%

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

Hülsbusch

König

Rensink

et al. 2010

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Model transformation is a prime technique in modern, model-driven software design. One of the most challenging issues is to show that the semantics of the models is not affected by the transformation. So far, there is hardly any research into this issue, in particular in those cases where the source and target languages are different.In this paper, we are using two different state-of-the-art proof techniques (explicit bisimulation construction versus borrowed contexts) to show bisimilarity preservation of a given model transformation between two simple (self-defined) languages, both of which are equipped with a graph transformation-based operational semantics. The contrast between these proof techniques is interesting because they are based on different model transformation strategies: triple graph grammars versus in situ transformation. We proceed to compare the proofs and discuss scalability to a more realistic setting.Partially supported by DFG project Behaviour-GT.

show abstract

“…Behaviour preservation, addressed here, is different from all these -in fact it presupposes that the transformations are already correct in the above senses -and is particularly challenging. An area where behaviour preservation has received some interest is refactoring, a specific kind of model transformation improving the structure of models [7,8]. Contrary to our interest here, transformations during refactorings do not operate on different meta-models but stay within one language.…”

Section: Introductionmentioning

confidence: 97%

From UML Activities to TAAL - Towards Behaviour-Preserving Model Transformations

Engels

Kleppe

Rensink

et al. 2008

Model Driven Architecture – Foundations and Applications

Self Cite

View full text Add to dashboard Cite

Model transformations support a model-driven design by providing an automatic translation of abstract models into more concrete ones, and eventually program code. Crucial to a successful application of model transformations is their correctness, in the sense that the meaning (semantics) of the models is preserved. This is especially important if the models not only describe the structure but also the intended behaviour of the systems. Reasoning about and showing correctness is, however, often impossible as the source and target models typically lack a precise definition of their semantics.In this paper, we take a first step towards provably correct behavioural model transformations. In particular, we develop transformations from UML Activities (which are visual models) to programs in TAAL, which is a textual Java-like programming language. Both languages come equipped with formal behavioural semantics, which, moreover, have the same semantic domain. This sets the stage for showing correctness, which in this case comes down to showing that the behaviour of every (well-formed) UML Activity coincides with that of the corresponding TAAL program, in a well-defined sense.

show abstract

Refactoring Object-Oriented Specifications with Data and Processes

Cited by 7 publications

References 15 publications

A Minimal Set of Refactoring Rules for Object-Z

A Minimal Set of Refactoring Rules for Object-Z

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

From UML Activities to TAAL - Towards Behaviour-Preserving Model Transformations

Contact Info

Product

Resources

About