Slicing Techniques for UML Models.

Lano, Kevin; Kolahdouz-Rahimi, Shekoufeh

doi:10.5381/jot.2011.10.1.a11

Cited by 21 publications

(24 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The techniques defined here have been applied to many cases of transformation verification. Examples include the class diagram refactoring case study of [27], the computation of the transitive closure of a relation [39], a large-scale migration transformation [33], and the slicing of state machines [34]. The example of [27] is a semantically complex update-in-place transformation (of which the simplest rule is discussed in Section 11).…”

Section: Discussionmentioning

confidence: 99%

“…The effort required was approximately 3 person days. The state machine slicing algorithms of [34] form part of a large and complex software engineering tool for model slicing. The model-level semantic preservation of the slicing algorithms was shown by induction over the individual transformation steps which rewrite state machines into simpler forms.…”

Section: Discussionmentioning

confidence: 99%

See 1 more Smart Citation

A framework for model transformation verification

2015

Self Cite

View full text Add to dashboard Cite

Abstract. A model transformation verification task may involve a number of different transformations, from one or more of a wide range of different model transformation languages, each transformation may have a particular transformation style, and there are a number of different verification properties which can be verified for each language and style of transformation. Transformations may operate upon many different modelling languages. This diversity of languages and properties indicates the need for a suitably generic framework for model transformation verification, independent of particular model transformation languages, and able to provide support for systematic procedures for verification across a range of languages, and for a range of properties. In this paper we describe the elements of such a framework, and apply this framework to a range of transformation verification problems. Our particular contributions are (i) languageindependent verification techniques based around the concepts of transformation invariants and variants; (ii) language-independent representation metamodels for transformation specifications and implementations, (iii) mappings from these representations to the B and Z3 formalisms, (iv) the use of transformation patterns to facilitate verification. The paper is novel in covering a wide range of different verification techniques for a wide range of MT languages, within an integrated framework.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Discussionmentioning

confidence: 99%

A framework for model transformation verification

2015

Self Cite

View full text Add to dashboard Cite

show abstract

“…Recent work on the slicing of UML models using model transformation has been presented by Kevin Lano [32], [33]. The purpose of slicing is to break the model into several submodels for better analysis and understanding.…”

Section: Slicing Alloy Specification (Dblp)mentioning

confidence: 99%

Efficient Verification-Driven Slicing of UML/OCL Class Diagrams

Shaikh¹,

Wiil²

2016

ijacsa

View full text Add to dashboard Cite

Abstract-Model defects are a significant concern in the Model-Driven Development (MDD) paradigm, as model transformations and code generation may propagate errors present in the model to other notations where they are harder to detect and trace. Formal verification techniques can check the correctness of a model, but their high computational complexity can limit their scalability.Current approaches to this problem have an exponential worst-case run time. In this paper, we propose a slicing technique which breaks a model into several independent submodels from which irrelevant information can be abstracted to improve the scalability of the verification process. We consider a specific static model (UML class diagrams annotated with unrestricted OCL constraints) and a specific property to verify (satisfiability, i.e., whether it is possible to create objects without violating any constraints). The definition of the slicing procedure ensures that the property under verification is preserved after partitioning. Furthermore, the paper provides an evaluation of experimental results from a real-world case study.

show abstract

“…It involves extracting a subset of a model, called a slice, which retains some properties of interest. Slicers are typically bound to concrete meta-models, for instance UML [39]. This technique can be seen as a particular case of our view abstraction, when the obtained view conforms to the original meta-model.…”

Section: Related Workmentioning

confidence: 99%

Reusable abstractions for modeling languages

Lara

Guerra

Cuadrado

2013

Information Systems

View full text Add to dashboard Cite

El acceso a la versión del editor puede requerir la suscripción del recurso Access to the published version may require subscription AbstractModel-Driven Engineering proposes the use of models to describe the relevant aspects of the system to be built and synthesize the final application from them. Models are normally described using Domain-Specific Modelling Languages (DSMLs), which provide primitives and constructs of the domain. Still, the increasing complexity of systems has raised the need for abstraction techniques able to produce simpler versions of the models while retaining some properties of interest. The problem is that developing such abstractions for each DSML from scratch is time and resource consuming. In this paper, our goal is reducing the effort to provide modelling languages with abstraction mechanisms. For this purpose, we have devised some techniques, based on generic programming and domain-specific meta-modelling, to define generic abstraction operations that can be reused over families of modelling languages sharing certain characteristics. Abstractions can make use of clustering algorithms as similarity criteria for model elements. These algorithms can be made generic as well, and customised for particular languages by means of annotation models.As a result, we have developed a catalogue of reusable abstractions using the proposed techniques, together with a working implementation in the MetaDepth multi-level meta-modelling tool. Our techniques and prototypes demonstrate that it is feasible to build reusable and adaptable abstractions, so that similar abstractions need not be developed from scratch, and their integration in new or existing modelling languages is less costly.

show abstract

Slicing Techniques for UML Models.

Cited by 21 publications

References 26 publications

A framework for model transformation verification

A framework for model transformation verification

Efficient Verification-Driven Slicing of UML/OCL Class Diagrams

Reusable abstractions for modeling languages

Contact Info

Product

Resources

About