Removing Redundancies and Deducing Equivalences in UML Class Diagrams

Maraee, Azzam; Balaban, Mira

doi:10.1007/978-3-319-11653-2_15

Cited by 11 publications

(6 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It is currently also used in engineering, ontology, DBMS, and other areas [32]. UML class model is an integral part of UML [4] [22] [23] [27]- [32], and it is widely used in the industry [27]. It describes the system through concepts, their relationship, and constraint [6].…”

Section: A Rq1-what Are the Importance Of Uml And Uml Class Model In ...mentioning

confidence: 99%

“…This study is mainly divided into 3 sub-studies (SS3.1, SS3.2, and SS3.3). The SS3.1 compiles the work of Cal'I et al and D. Calvanese [21]- [26], SS3.2 collected the work of Maraee and Balaban [27]- [32], and SS3.3 presented the work of Efiizoni et al [33]. The SS3.4 compiles the work of Abdul et al [34]- [36].…”

Section: ) Description Logicmentioning

confidence: 99%

“…In [29], the authors formalized their approach, which they presented in [31] [32] through description logic, and built a DL formula for the multiplicity constraint. In [27], they further expanded the work and presented methods for eliminating redundancy in wider constraints (Universal and Extensional).…”

Section: ) Description Logicmentioning

confidence: 99%

See 2 more Smart Citations

More Than Two Decades of Research on Verification of UML Class Models: A Systematic Literature Review

et al. 2021

View full text Add to dashboard Cite

show abstract

Section: A Rq1-what Are the Importance Of Uml And Uml Class Model In ...mentioning

confidence: 99%

Section: ) Description Logicmentioning

confidence: 99%

See 1 more Smart Citation

More Than Two Decades of Research on Verification of UML Class Models: A Systematic Literature Review

et al. 2021

View full text Add to dashboard Cite

show abstract

“…These include graph-based approaches, SAT/SMT (constraint solving), constraint programming, Alloy (kodkod) and others. Graph-based approaches A metamodel or UML class diagram can be considered as a graph so graph-based approaches are naturally employed for reasoning about consistencies of a metamodel [5,29,41,42,57]. Among them, Ehrig et al propose an instance-generating graph grammar for creating instances of a metamodel.…”

Section: Related Workmentioning

confidence: 99%

A formal approach to finding inconsistencies in a metamodel

Farrell

2021

Softw Syst Model

View full text Add to dashboard Cite

Checking the consistency of a metamodel involves finding a valid metamodel instance that provably meets the set of constraints that are defined over the metamodel. These constraints are often specified in Object Constraint Language. Often, a metamodel is inconsistent due to conflicts among the constraints. Existing approaches and tools are typically incapable of pinpointing the conflicting constraints, and this makes it difficult for users to debug and fix their metamodels. In this paper, we present a formal approach for locating conflicting constraints in inconsistent metamodels. Our approach has four distinct features: (1) users can rank individual metamodel features using their own domain-specific knowledge, (2) we transform these ranked features to a weighted maximum satisfiability modulo theories problem and solve it to compute the set of maximum achievable features, (3) we pinpoint the conflicting constraints by solving the set cover problem using a novel algorithm, and (4) we have implemented our approach into a fully automated tool called MaxUSE. Our evaluation results, using our assembled set of benchmarks, demonstrate the scalability of our work and that it is capable of efficiently finding conflicting constraints.

show abstract

“…In a similar manner, Balaban et al [29] propose a method to tighten the cardinality constraints. For instance, they tight a maximum cardinality constraint to a lower value when they identify that the maximum value can never be reached.…”

Section: Other Techniquesmentioning

confidence: 99%

Simplification of UML/OCL schemas for efficient reasoning

Oriol

Teniente

2017

Journal of Systems and Software

View full text Add to dashboard Cite

Ensuring the correctness of a conceptual schema is an essential task in order to avoid the propagation of errors during software development. The kind of reasoning required to perform such task is known to be exponential for UML class diagrams alone and even harder when considering OCL constraints. Motivated by this issue, we propose an innovative method aimed at removing constraints and other UML elements of the schema to obtain a simplified one that preserve the same reasoning outcomes. In this way, we can reason about the correctness of the initial artifact by reasoning on a simplified version of it. Thus, the efficiency of the reasoning process is significantly improved. In addition, since our method is independent from the reasoning engine used, any reasoning method may benefit from it.Peer ReviewedPostprint (author's final draft

show abstract

Removing Redundancies and Deducing Equivalences in UML Class Diagrams

Cited by 11 publications

References 20 publications

More Than Two Decades of Research on Verification of UML Class Models: A Systematic Literature Review

More Than Two Decades of Research on Verification of UML Class Models: A Systematic Literature Review

A formal approach to finding inconsistencies in a metamodel

Simplification of UML/OCL schemas for efficient reasoning

Contact Info

Product

Resources

About