Object-extending class transformations

Lieberherr, Karl; Hürsch, Walter L.; Xiao, Cun

doi:10.1007/bf01211306

Cited by 15 publications

(4 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Although multiple views can make classes belonging to individual concerns more understandable, they generally do not project a highlevel, simplified abstraction of the overall class structure. Lieberherr et al [1994] defined class transformation methods to capture evolution. They argue that class evolution is inevitable and results in new class models that, preferably, should be as consistent as possible with earlier versions.…”

Section: Related Workmentioning

confidence: 99%

Automated abstraction of class diagrams

Egyed¹

2002

ACM Trans. Softw. Eng. Methodol.

View full text Add to dashboard Cite

Designers can easily become overwhelmed with details when dealing with large class diagrams. This article presents an approach for automated abstraction that allows designers to "zoom out" on class diagrams to investigate and reason about their bigger picture. The approach is based on a large number of abstraction rules that individually are not very powerful, but when used together, can abstract complex class structures quickly. This article presents those abstraction rules and an algorithm for applying them. The technique was validated on over a dozen models where it was shown to be well suited for model understanding, consistency checking, and reverse engineering.

show abstract

Section: Related Workmentioning

confidence: 99%

Automated abstraction of class diagrams

Egyed¹

2002

ACM Trans. Softw. Eng. Methodol.

View full text Add to dashboard Cite

show abstract

“…The semantics formally defines the order of wrapper execution for prefix and suffix wrappers. The feasibility of the evolution framework is demonstrated for a representative set of primitive class structure transformations, mainly based on the extension relations identified in [12], [18]. Such extension relations are useful means for quality control of schema transformations.…”

Section: Related Researchmentioning

confidence: 99%

The role of polymorphic reuse mechanisms in schema evolution in an object-oriented database

Liu

Zicari

Hürsch³

et al. 1997

IEEE Trans. Knowl. Data Eng.

View full text Add to dashboard Cite

A seamless approach to the incremental design and reuse of object-oriented methods and query specifications is presented. We argue for avoiding or minimizing the effort required for manually reprogramming methods and queries due to schema modifications, and demonstrate how the role of polymorphic reuse mechanisms is exploited for enhancing the adaptiveness of database programs against schema evolution in an object-oriented database. The salient features of our approach are the use of propagation patterns and a mechanism for propagation pattern refinement. Propagation patterns are employed as an interesting specification formalism for modeling operational requirements. They encourage the reuse of operational specifications against the structural modification of an object-oriented schema. Propagation pattern refinement is suited for the specification of reusable operational modules. It promotes the reusability of propagation patterns toward the operational requirement changes. This approach has a formal basis and emphasizes structural derivation of specifications. The main innovations are in raising the level of abstraction for behavioral schema design, and for making possible the derivation of operational semantics from structural specifications. As a result, both the modularity and reusability of object-oriented schemas are increased.

show abstract

“…There are various efforts to formalize such refactorings [4,11,17,23]. Our work focuses on source code because the main application of refactoring is changing code quickly and correctly with all its intricacies For instance, method calls cannot be adjusted in class diagrams.…”

Section: Related Workmentioning

confidence: 99%

Changing Programs Correctly: Refactoring with Specifications

Bannwart

Müller

2006

FM 2006: Formal Methods

View full text Add to dashboard Cite

Abstract. Refactorings change the internal structure of code without changing its external behavior. For non-trivial refactorings, the preservation of external behavior depends on semantic properties of the program that are difficult to check automatically before the refactoring is applied. Therefore, existing refactoring tools either do not support non-trivial refactorings at all or force programmers to rely on (typically incomplete) test suites to check their refactorings. The technique presented in the paper allows one to show the preservation of external behavior even for complex refactorings. For a given refactoring, we prove once and for all that the refactoring is an equivalence transformation, provided that the refactored program satisfies certain semantic correctness conditions. These conditions can be added automatically as assertions to the refactored program and checked at runtime or verified statically. Our technique allows tools to apply even complex refactorings safely, and refactorings automatically improve program documentation by generating assertions.

show abstract

Object-extending class transformations

Cited by 15 publications

References 15 publications

Automated abstraction of class diagrams

Automated abstraction of class diagrams

The role of polymorphic reuse mechanisms in schema evolution in an object-oriented database

Changing Programs Correctly: Refactoring with Specifications

Contact Info

Product

Resources

About