Fixing Up Non-executable Operations in UML/OCL Conceptual Schemas

Oriol, Xavier; Teniente, Ernest; Tort, Albert

doi:10.1007/978-3-319-12206-9_19

Cited by 4 publications

(8 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The expressiveness of the OCL UNIV language is already determined by a formal grammar in [19]. Incorporating distributive aggregation in OCL UNIV extends the expressiveness of the language beyond the newly supported aggregate operations sum, size, count since there are many OCL operations beyond OCL UNIV that can be rewritten in terms of aggregation (e.g.…”

Section: Expressiveness Of Ocl Univ With Aggregationmentioning

confidence: 99%

Incremental Checking of OCL Constraints with Aggregates Through SQL

Oriol

Teniente

2015

Conceptual Modeling

Self Cite

View full text Add to dashboard Cite

Abstract. Valid states of data are those satisfying a set of constraints. Therefore, efficiently checking whether some constraint has been violated after a data update is an important problem in data management. We tackle this problem by incrementally checking OCL constraint violations by means of SQL queries. Given an OCL constraint, we obtain a set of SQL queries that returns the data that violates the constraint. In this way, we can check the validity of the data by checking the emptiness of these queries. The queries that we obtain are incremental since they are only executed when some relevant data update may violate the constraint, and they only examine the data related to the update.

show abstract

Section: Expressiveness Of Ocl Univ With Aggregationmentioning

confidence: 99%

Incremental Checking of OCL Constraints with Aggregates Through SQL

Oriol

Teniente

2015

Conceptual Modeling

Self Cite

View full text Add to dashboard Cite

show abstract

“…In [23] we presented a particular application of this approach aimed at fixing up non-executable operations. We fix up a non-executable operation by means of computing the missing effects in the underspecified operation postcondition in a manner similar to how we compute the repairs for constraint violations.…”

Section: Contributionmentioning

confidence: 99%

“…Computing the missing effects in underspecified operation postconditions corresponds to apply an extended interpretation of an operation [24], in which the operation is assumed to apply all the events specified in the postcondition and any additional event required to maintain the consistency of the IB. We provide now several additional contributions with regards to our previous work in [23]. The most important ones are the following:…”

Section: Contributionmentioning

confidence: 99%

“…We assumed in our previous work [23] that the conclusion of an RGD was a disjunction of single structural events, where each structural event stands for a different way to repair a constraint. Given the restricted fragment of OCL considered in that paper, this assumption was enough to capture all possible repairs since each OCL constraint defined in that fragment could be repaired through the application of a single event.…”

Section: Specifying Repairs In Rgdsmentioning

confidence: 99%

“…We addressed this problem in [23], for a certain fragment of OCL, where the information to fix up the problem was given in terms of the missing effects underspecified on the operation postcondition that would ensure that all constraints would be satisfied after the execution of the operation. Missing effects were given as a set of structural events R i that should be applied together with those events E already implied by the postcondition.…”

Section: Applying Our Approach To Fix Up Non-executable Operationsmentioning

confidence: 99%

See 2 more Smart Citations

Computing repairs for constraint violations in UML/OCL conceptual schemas

Oriol¹,

Teniente²,

Tort³

2015

Data & Knowledge Engineering

Self Cite

View full text Add to dashboard Cite

Updating the contents of an information base may violate some of the constraints defined over the schema. The classical way to deal with this problem has been to reject the requested update when its application would lead to some constraint violation. We follow here an alternative approach aimed at automatically computing the repairs of an update, i.e., the minimum additional changes that, when applied together with the requested update, bring the information base to a new state where all constraints are satisfied. Our approach is independent of the language used to define the schema and the constraints, since it is based on a logic formalization of both, although we apply it to UML and OCL because they are widely used in the conceptual modeling community.Our method can be used for maintaining the consistency of an information base after the application of some update, and also for dealing with the problem of fixing up non-executable operations. The fragment of OCL that we use to define the constraints has the same expressiveness as relational algebra and we also identify a subset of it which provides some nice properties in the repair-computation process. Experiments are conducted to analyze the efficiency of our approach.

show abstract

Quality Improvement of Conceptual UML and OCL Schemata through Model Validation and Verification

Gogolla

Doan

2017

Conceptual Modeling Perspectives

View full text Add to dashboard Cite

Fixing Up Non-executable Operations in UML/OCL Conceptual Schemas

Cited by 4 publications

References 10 publications

Incremental Checking of OCL Constraints with Aggregates Through SQL

Incremental Checking of OCL Constraints with Aggregates Through SQL

Computing repairs for constraint violations in UML/OCL conceptual schemas

Quality Improvement of Conceptual UML and OCL Schemata through Model Validation and Verification

Contact Info

Product

Resources

About