Efficient reasoning about finite satisfiability of UML class diagrams with constrained generalization sets

Azzam Maraee; Mira Balaban

doi:10.1007/978-3-540-72901-3_2

Efficient reasoning about finite satisfiability of UML class diagrams with constrained generalization sets

Azzam Maraee
, Mira Balaban

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

31 Scopus citations

Abstract

UML class diagrams play a central role in the design and specification of software, databases and ontologies. The model driven architecture approach emphasizes the central role that models play, towards achieving reliable software. It is important that models aire correct and that problems are detected as early as possible in the software design process. However, current case tools do not support reasoning tasks about class diagrams and enable the construction of erroneous models. There is an urgent need for methods for detecting analysis and design problems. In this paper, we present a linear programming based method for reasoning about finite satisfiability of UML class diagrams with constrained generalization sets. The method is simple and efficient and can be easily added to a case tool. It improves over existing methods that require exponential resources and extends them to new elements of class diagrams.

Original language	English
Title of host publication	Model Driven Architecture - Foundations and Applications
Subtitle of host publication	Third European Conference, ECMDA-FA 2007, Proceedings
Publisher	Springer Verlag
Pages	17-31
Number of pages	15
ISBN (Print)	3540729003, 9783540729006
DOIs	https://doi.org/10.1007/978-3-540-72901-3_2
State	Published - 1 Jan 2007
Event	3rd European Conference on Model-Driven Architecture - Foundations and Applications, ECMDA-FA 2007 - Haifa, Israel Duration: 11 Jun 2007 → 15 Jun 2007

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	4530 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	3rd European Conference on Model-Driven Architecture - Foundations and Applications, ECMDA-FA 2007
Country/Territory	Israel
City	Haifa
Period	11/06/07 → 15/06/07

Keywords

Cardinality constraints
Class hierarchy structure
Consistency
Finite satisfiability
Generalization set constraints
Reasoning about class diagram
UML class diagram

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-540-72901-3_2

Cite this

Maraee, A., & Balaban, M. (2007). Efficient reasoning about finite satisfiability of UML class diagrams with constrained generalization sets. In Model Driven Architecture - Foundations and Applications: Third European Conference, ECMDA-FA 2007, Proceedings (pp. 17-31). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4530 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-540-72901-3_2

Maraee, Azzam ; Balaban, Mira. / Efficient reasoning about finite satisfiability of UML class diagrams with constrained generalization sets. Model Driven Architecture - Foundations and Applications: Third European Conference, ECMDA-FA 2007, Proceedings. Springer Verlag, 2007. pp. 17-31 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{5f16bdcb3ddc4d418f5fc87c81674d76,

title = "Efficient reasoning about finite satisfiability of UML class diagrams with constrained generalization sets",

abstract = "UML class diagrams play a central role in the design and specification of software, databases and ontologies. The model driven architecture approach emphasizes the central role that models play, towards achieving reliable software. It is important that models aire correct and that problems are detected as early as possible in the software design process. However, current case tools do not support reasoning tasks about class diagrams and enable the construction of erroneous models. There is an urgent need for methods for detecting analysis and design problems. In this paper, we present a linear programming based method for reasoning about finite satisfiability of UML class diagrams with constrained generalization sets. The method is simple and efficient and can be easily added to a case tool. It improves over existing methods that require exponential resources and extends them to new elements of class diagrams.",

keywords = "Cardinality constraints, Class hierarchy structure, Consistency, Finite satisfiability, Generalization set constraints, Reasoning about class diagram, UML class diagram",

author = "Azzam Maraee and Mira Balaban",

year = "2007",

month = jan,

day = "1",

doi = "10.1007/978-3-540-72901-3\_2",

language = "English",

isbn = "3540729003",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "17--31",

booktitle = "Model Driven Architecture - Foundations and Applications",

address = "Germany",

note = "3rd European Conference on Model-Driven Architecture - Foundations and Applications, ECMDA-FA 2007 ; Conference date: 11-06-2007 Through 15-06-2007",

}

Maraee, A & Balaban, M 2007, Efficient reasoning about finite satisfiability of UML class diagrams with constrained generalization sets. in Model Driven Architecture - Foundations and Applications: Third European Conference, ECMDA-FA 2007, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4530 LNCS, Springer Verlag, pp. 17-31, 3rd European Conference on Model-Driven Architecture - Foundations and Applications, ECMDA-FA 2007, Haifa, Israel, 11/06/07. https://doi.org/10.1007/978-3-540-72901-3_2

Efficient reasoning about finite satisfiability of UML class diagrams with constrained generalization sets. / Maraee, Azzam; Balaban, Mira.
Model Driven Architecture - Foundations and Applications: Third European Conference, ECMDA-FA 2007, Proceedings. Springer Verlag, 2007. p. 17-31 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4530 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Efficient reasoning about finite satisfiability of UML class diagrams with constrained generalization sets

AU - Maraee, Azzam

AU - Balaban, Mira

PY - 2007/1/1

Y1 - 2007/1/1

N2 - UML class diagrams play a central role in the design and specification of software, databases and ontologies. The model driven architecture approach emphasizes the central role that models play, towards achieving reliable software. It is important that models aire correct and that problems are detected as early as possible in the software design process. However, current case tools do not support reasoning tasks about class diagrams and enable the construction of erroneous models. There is an urgent need for methods for detecting analysis and design problems. In this paper, we present a linear programming based method for reasoning about finite satisfiability of UML class diagrams with constrained generalization sets. The method is simple and efficient and can be easily added to a case tool. It improves over existing methods that require exponential resources and extends them to new elements of class diagrams.

AB - UML class diagrams play a central role in the design and specification of software, databases and ontologies. The model driven architecture approach emphasizes the central role that models play, towards achieving reliable software. It is important that models aire correct and that problems are detected as early as possible in the software design process. However, current case tools do not support reasoning tasks about class diagrams and enable the construction of erroneous models. There is an urgent need for methods for detecting analysis and design problems. In this paper, we present a linear programming based method for reasoning about finite satisfiability of UML class diagrams with constrained generalization sets. The method is simple and efficient and can be easily added to a case tool. It improves over existing methods that require exponential resources and extends them to new elements of class diagrams.

KW - Cardinality constraints

KW - Class hierarchy structure

KW - Consistency

KW - Finite satisfiability

KW - Generalization set constraints

KW - Reasoning about class diagram

KW - UML class diagram

UR - https://www.scopus.com/pages/publications/37149008154

U2 - 10.1007/978-3-540-72901-3_2

DO - 10.1007/978-3-540-72901-3_2

M3 - Conference contribution

AN - SCOPUS:37149008154

SN - 3540729003

SN - 9783540729006

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 17

EP - 31

BT - Model Driven Architecture - Foundations and Applications

PB - Springer Verlag

T2 - 3rd European Conference on Model-Driven Architecture - Foundations and Applications, ECMDA-FA 2007

Y2 - 11 June 2007 through 15 June 2007

ER -

Maraee A, Balaban M. Efficient reasoning about finite satisfiability of UML class diagrams with constrained generalization sets. In Model Driven Architecture - Foundations and Applications: Third European Conference, ECMDA-FA 2007, Proceedings. Springer Verlag. 2007. p. 17-31. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-540-72901-3_2

Efficient reasoning about finite satisfiability of UML class diagrams with constrained generalization sets

Abstract

Publication series

Conference

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this