Efficient analysis of pattern-based constraint specifications

Wahler, Michael; Basin, David; Brucker, Achim D.; Koehler, Jana

doi:10.1007/s10270-009-0123-6

Cited by 18 publications

(11 citation statements)

References 40 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A further experiment (employing Alloy) shows that the slicing procedure is independent both of the tool and of the formalism. Wahler et al [2010] introduces an implemented set of OCL patterns that capture real business constraints.…”

Section: Identificationmentioning

confidence: 99%

Finite satisfiability of UML class diagrams with constrained class hierarchy

Balaban

Maraee

2013

ACM Trans. Softw. Eng. Methodol.

View full text Add to dashboard Cite

Gurion University of the Negev Models lie at the heart of the emerging model-driven engineering approach. In order to guarantee precise, consistent, and correct models, there is a need for efficient powerful methods for verifying model correctness. Class diagram is the central language within UML. Its correctness problems involve issues of contradiction, namely the consistency problem, and issues of finite instantiation, namely the finite satisfiability problem.This article analyzes the problem of finite satisfiability of class diagrams with class hierarchy constraints and generalization-set constraints. The article introduces the FiniteSat algorithm for efficient detection of finite satisfiability in such class diagrams, and analyzes its limitations in terms of complex hierarchy structures. FiniteSat is strengthened in two directions. First, an algorithm for identification of the cause for a finite satisfiability problem is introduced. Second, a method for propagation of generalization-set constraints in a class diagram is introduced. The propagation method serves as a preprocessing step that improves FiniteSat performance, and helps developers in clarifying intended constraints. These algorithms are implemented in the FiniteSatUSE tool [BGU Modeling Group 2011b], as part of our ongoing effort for constructing a model-level integrated development environment [BGU Modeling Group 2010a]. ACM Reference Format: Balaban, M. and Maraee, A. 2013. Finite satisfiability of uml class diagrams with constrained class hierarchy.

show abstract

Section: Identificationmentioning

confidence: 99%

Finite satisfiability of UML class diagrams with constrained class hierarchy

Balaban

Maraee

2013

ACM Trans. Softw. Eng. Methodol.

View full text Add to dashboard Cite

show abstract

“…This kind of validation is complementary to the one we propose in this paper since we assume that the model to validate already satisfies such well-formedness rules. (Wahler et al 2010) propose consistency checking rules for constraints patterns. A constraint pattern is a parameterized constraint expression that can be instantiated to produce specific constraints.…”

Section: Tools For Checking the Correctness Of A Uml/ocl Conceptual Smentioning

confidence: 99%

“…Wahler et al also survey different notions of consistency for UML/OCL schemas. AuRUS' test that checks if all classes are lively corresponds to the notion of class consistency in (Wahler et al 2010).…”

Section: Tools For Checking the Correctness Of A Uml/ocl Conceptual Smentioning

confidence: 99%

AuRUS: explaining the validation of UML/OCL conceptual schemas

et al. 2013

View full text Add to dashboard Cite

Abstract:The validation and the verification of conceptual schemas have attracted a lot of interest during the last years, and several tools have been developed to automate this process as much as possible. This is achieved, in general, by assessing whether the schema satisfies different kinds of desirable properties which ensure that the schema is correct. In this paper we describe AuRUS, a tool we have developed to analyze UML/OCL conceptual schemas and to explain their (in)correctness. When a property is satisfied, AuRUS provides a sample instantiation of the schema showing a particular situation where the property holds. When it is not, AuRUS provides an explanation for such unsatisfiability, i.e., a set of integrity constraints which is in contradiction with the property.

show abstract

“…Constraint patterns (Ackermann and Turowski, 2006;Costal et al, 2006;Wahler et al, 2006;Wahler et al, 2010) are essential to developing constraint specifications for UML class models (OMG, 2006). Using constraint patterns accelerates the development and maintenance of constraint specifications.…”

Section: Introductionmentioning

confidence: 99%

Visualizing OCL Constraint Patterns with VOCL

Hamié

2013

Proceedings of the 1st International Conference on Model-Driven Engineering and Software Development

View full text Add to dashboard Cite

A specification pattern is a generic constraint expression that can be instantiated to solve a class of specification problems. It captures and generalizes frequently used logical expressions in models. Specification patterns have been defined and represented in the Object Constraint Language OCL for UML/OCL modelling. The notation of visual OCL (VOCL) is a visualization of OCL and can be considered as an alternative solution to the textual OCL. This paper provides the visualization of some OCL constraint patterns in VOCL. For this purpose, we introduce constraint pattern templates in VOCL to represent constraint patterns in a diagrammatic form. The benefits of the visualization is that some patterns will be available in a intuitive diagrammatic notation that follows the UML notation.

show abstract

Efficient analysis of pattern-based constraint specifications

Cited by 18 publications

References 40 publications

Finite satisfiability of UML class diagrams with constrained class hierarchy

Finite satisfiability of UML class diagrams with constrained class hierarchy

AuRUS: explaining the validation of UML/OCL conceptual schemas

Visualizing OCL Constraint Patterns with VOCL

Contact Info

Product

Resources

About