On the verification of UML/OCL class diagrams using constraint programming

Cabot, Jordi; Clarisó, Robert; Riera, Daniel

doi:10.1016/j.jss.2014.03.023

Cited by 136 publications

(146 citation statements)

References 17 publications

Supporting

Mentioning

139

Contrasting

Order By: Relevance

“…We slice the model in the memory before checking satisfiability and this is the major reason for speedups in verification. In this paper, the experiments are conducted in Alloy [20] and UMLtoCSP [9]. The underlying satisfiability analyser used in Alloy is the Kodkod model finder and a variety of SAT solvers [47] whereas UMLtoCSP uses CSP [10].…”

Section: Contributionsmentioning

confidence: 99%

“…Complex integrity constraints will be expressed in OCL. In this context, the fundamental correctness property of a model is satisfiability [9], [3], [37] and whether it is possible to instantiate the model without violating any integrity constraints. Constraints can be either textual OCL invariants or graphical restrictions like multiplicities of association ends.…”

Section: Introductionmentioning

confidence: 99%

“…Current solutions for checking satisfiability employ formalisms such as description logics [3], higher-order logics [8], database deduction systems [4], linear programming [35], SAT [21] 2 , or constraint satisfaction problems (CSP) [5], [9]. Each method provides different trade-offs in terms of decidability, completeness, expressiveness, and efficiency, which depend on the underlying formalism and tool support.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

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

Section: Contributionsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Efficient Verification-Driven Slicing of UML/OCL Class Diagrams

Shaikh¹,

Wiil²

2016

ijacsa

View full text Add to dashboard Cite

show abstract

“…EMFtoCSP [CCR07,GBCC12]. Other validation and verification tools for OCL which are possible candidates to be examined under the benchmark are UML2Alloy [ABGR10], the planned USE extension arising from [MB07], the ITP/OCL tool [CE06] and mOdCL [RD11].…”

Section: Potential Tools To Be Considered and Related Workmentioning

confidence: 99%

Initiating a Benchmark for UML and OCL Analysis Tools

2013

View full text Add to dashboard Cite

Abstract. The Object Constraint Language (OCL) is becoming more and more popular for model-based engineering, in particular for the development of models and model transformations. OCL is supported by a variety of analysis tools having different scopes, aims and technological corner stones. The spectrum ranges from treating issues concerning formal proof techniques to testing approaches, from validation to verification, and from logic programming and rewriting to SAT-based technologies. This paper is a first step towards a well-founded benchmark for assessing validation and verification techniques on UML and OCL models. The paper puts forward a set of UML and OCL models together with particular questions for these models roughly characterized by the notions consistency, independence, consequences, and reachability. The paper sketches how these questions are handled by two OCL tools, USE and EMFtoCSP. The claim of the paper is not to present a complete benchmark right now. The paper is intended to initiate the development of further UML and OCL models and accompanying questions within the UML and OCL community. The OCL community is invited to check the presented UML and OCL models with their approaches and tools and to contribute further models and questions which emphasize the possibilities offered by their own tools. IntroductionModel-driven engineering (MDE) as a paradigm for software development is gaining more and more importance. Models and model transformations are central notions in modeling languages like UML, SysML, or EMF and transformation languages like QVT or ATL. In these approaches, the Object Constraint Language (OCL) can be employed for expressing constraints and operations, thus OCL plays a central role in MDE. A variety of OCL tools is currently available, but it is an open issue how to compare these tools and how to support developers in choosing the OCL tool appropriate for their project. This paper puts forward a set of UML and OCL models together with particular questions for these models. This set of models is intended to be a first version of an OCL analysis tool benchmark to be developed within the OCL and UML community.⋆ This research was partially funded by the Nouvelles Equipes program of the Pays de la Loire region (France).

show abstract

“…However, non-deterministic constrained search offers an original combination of properties: flexibility of having a single specification for different scenarios, ability to provide various solutions, automatic checking/optimizing capabilities, and in our case the sole use of existing modeling concepts. Finally, the MDE community has also been using constraint-based solvers for various model operations such as model checking [12,5,30], finding optimized transformations [20], or extending transformation capabilities [26]. Although there are definitely similarities in the use of constraint tools, and in particular alternative mappings to solver languages, the pursued goals are different.…”

Section: Related Workmentioning

confidence: 99%

Transformation as Search

Kleiner

Fabro

Santos

2013

Modelling Foundations and Applications

View full text Add to dashboard Cite

is an open access repository that collects the work of Arts et Métiers ParisTech researchers and makes it freely available over the web where possible. Abstract. In model-driven engineering, model transformations are considered a key element to generate and maintain consistency between related models. Rule-based approaches have become a mature technology and are widely used in different application domains. However, in various scenarios, these solutions still suffer from a number of limitations that stem from their injective and deterministic nature. This article proposes an original approach, based on non-deterministic constraint-based search engines, to define and execute bidirectional model transformations and synchronizations from single specifications. Since these solely rely on basic existing modeling concepts, it does not require the introduction of a dedicated language. We first describe and formally define this model operation, called transformation as search, then describe a proof-of-concept implementation and discuss experiments on a reference use case in software engineering.

show abstract

On the verification of UML/OCL class diagrams using constraint programming

Abstract: In the MDD and MDA approaches, models

Cited by 136 publications

References 17 publications

Efficient Verification-Driven Slicing of UML/OCL Class Diagrams

Efficient Verification-Driven Slicing of UML/OCL Class Diagrams

Initiating a Benchmark for UML and OCL Analysis Tools

Transformation as Search

Contact Info

Product

Resources

About