Reasoning on UML Class Diagrams with OCL Constraints

Queralt, Anna; Teniente, Ernest

doi:10.1007/11901181_37

Cited by 52 publications

(49 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Typically, approaches devoted to the verification of UML/OCL models (as [1,4,7,10,13,16,17] or our own approach among others) transform the diagram into a formalism where efficient solvers or theorem provers are available. However, there are complexity and decidability issues to be considered.…”

Section: Related Workmentioning

confidence: 99%

Verifying UML/OCL Operation Contracts

Cabot

Clarisó

Riera

2009

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. In current model-driven development approaches, software models are the primary artifacts of the development process. Therefore, assessment of their correctness is a key issue to ensure the quality of the final application. Research on model consistency has focused mostly on the models' static aspects. Instead, this paper addresses the verification of their dynamic aspects, expressed as a set of operations defined by means of pre/postcondition contracts. This paper presents an automatic method based on Constraint Programming to verify UML models extended with OCL constraints and operation contracts. In our approach, both static and dynamic aspects are translated into a Constraint Satisfaction Problem. Then, compliance of the operations with respect to several correctness properties such as operation executability or determinism are formally verified.

show abstract

Section: Related Workmentioning

confidence: 99%

Verifying UML/OCL Operation Contracts

Cabot

Clarisó

Riera

2009

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…A translation of specific UML and OCL features into constraint satisfaction problems (CSP) is done in [6]. Answer set programming (ASP) [21], the constructive query containment (CQC) method [22], or rewriting-based techniques [23,7] are applied for analyzing static and dynamic model aspects. The named approaches differ from more interactive approaches like [5] involving verification by theorem proving.…”

Section: Related Workmentioning

confidence: 99%

From UML and OCL to Relational Logic and Back

Kuhlmann

Gogolla

2012

Model Driven Engineering Languages and Systems

View full text Add to dashboard Cite

Abstract. Languages like UML and OCL are used to precisely model systems. Complex UML and OCL models therefore represent a crucial part of model-driven development, as they formally specify the main system properties. Consequently, creating complete and correct models is a critical concern. For this purpose, we provide a lightweight model validation method based on efficient SAT solving techniques. In this paper, we present a transformation from UML class diagram and OCL concepts into relational logic. Relational logic in turn represents the source for advanced SAT-based model instance finders like Kodkod. This paper focuses on a natural transformation approach which aims to exploit the features of relational logic as directly as possible through straitening the handling of main UML and OCL features. This approach allows us to explicitly benefit from the efficient handling of relational logic in Kodkod and to interpret found results backwards in terms of UML and OCL.

show abstract

“…In contrast, our technique is especially tailored to consider OCL expressions, and hence is very appropriate for its use in meta-modelling environments. Furthermore, the use of OCL allows the application of tools for the simulation, analysis and verification on UML/OCL models [1,2,8,15]. Regarding the drawbacks of our proposal, it is not complete (some OCL constraints have no translation for rules that create objects) and we do not have a formal proof of its correctness yet.…”

Section: Related Workmentioning

confidence: 99%

Synthesis of OCL Pre-conditions for Graph Transformation Rules

Cabot

Clarisó

Guerra

et al. 2010

Theory and Practice of Model Transformations

View full text Add to dashboard Cite

Abstract. Graph transformation (GT) is being increasingly used in ModelDriven Engineering (MDE) to describe in-place transformations like animations and refactorings. For its practical use, rules are often complemented with OCL application conditions. The advancement of rule post-conditions into pre-conditions is a well-known problem in GT, but current techniques do not consider OCL. In this paper we provide an approach to advance post-conditions with arbitrary OCL expressions into pre-conditions. This presents benefits for the practical use of GT in MDE, as it allows: (i) to automatically derive pre-conditions from the meta-model integrity constraints, ensuring rule correctness, (ii) to derive pre-conditions from graph constraints with OCL expressions and (iii) to check applicability of rule sequences with OCL conditions.

show abstract

Reasoning on UML Class Diagrams with OCL Constraints

Cited by 52 publications

References 12 publications

Verifying UML/OCL Operation Contracts

Verifying UML/OCL Operation Contracts

From UML and OCL to Relational Logic and Back

Synthesis of OCL Pre-conditions for Graph Transformation Rules

Contact Info

Product

Resources

About