Details
| Originalsprache | Englisch |
|---|---|
| Titel des Sammelwerks | Proceedings of the 6th International Workshop - MoDeVVa - Model-Driven Engineering, Verification and Validation |
| Publikationsstatus | Veröffentlicht - 5 Okt. 2009 |
| Extern publiziert | Ja |
| Veranstaltung | 6th International Workshop on MoDeVVa - Model-Driven Engineering, Verification and Validation - Denver, CO, USA / Vereinigte Staaten Dauer: 5 Okt. 2009 → 5 Okt. 2009 |
Publikationsreihe
| Name | ACM International Conference Proceeding Series |
|---|---|
| Band | 413 |
Abstract
Models lie at the heart of the emerging Model Driven Development (MDD) approach, in which software is developed by repeated transformations of models. Since models are intended as executable specifications, there is a need to provide correctness management on the model level. The underlying hypothesis of this research is that model level tools should be strengthened, to support model elements in a way that would encourage users to take advantage of their features. Furthermore, model transformations should not neglect the translation of model features. This paper explores the practical relevance of detecting Finite Satisfiability problems on the model level. The frequency of occurrence of Finite Satisfiability problems, and the scalability of the efficient FiniteSat algorithm are studied on a set of synthetic class diagrams, created along designed metrics. The contribution of this work is twofold, first in advancing towards creating a benchmark of class diagrams, and second, in the empirical study of the Finite Satisfiability problem.
ASJC Scopus Sachgebiete
- Informatik (insg.)
- Software
- Informatik (insg.)
- Mensch-Maschine-Interaktion
- Informatik (insg.)
- Maschinelles Sehen und Mustererkennung
- Informatik (insg.)
- Computernetzwerke und -kommunikation
Zitieren
- Standard
- Harvard
- Apa
- Vancouver
- BibTex
- RIS
Proceedings of the 6th International Workshop - MoDeVVa - Model-Driven Engineering, Verification and Validation. 2009. 1 (ACM International Conference Proceeding Series; Band 413).
Publikation: Beitrag in Buch/Bericht/Sammelwerk/Konferenzband › Aufsatz in Konferenzband › Forschung › Peer-Review
}
TY - GEN
T1 - Finite satisfiability of class diagrams
T2 - 6th International Workshop on MoDeVVa - Model-Driven Engineering, Verification and Validation
AU - Makarenkov, Victor
AU - Jelnov, Pavel
AU - Maraee, Azzam
AU - Balaban, Mira
PY - 2009/10/5
Y1 - 2009/10/5
N2 - Models lie at the heart of the emerging Model Driven Development (MDD) approach, in which software is developed by repeated transformations of models. Since models are intended as executable specifications, there is a need to provide correctness management on the model level. The underlying hypothesis of this research is that model level tools should be strengthened, to support model elements in a way that would encourage users to take advantage of their features. Furthermore, model transformations should not neglect the translation of model features. This paper explores the practical relevance of detecting Finite Satisfiability problems on the model level. The frequency of occurrence of Finite Satisfiability problems, and the scalability of the efficient FiniteSat algorithm are studied on a set of synthetic class diagrams, created along designed metrics. The contribution of this work is twofold, first in advancing towards creating a benchmark of class diagrams, and second, in the empirical study of the Finite Satisfiability problem.
AB - Models lie at the heart of the emerging Model Driven Development (MDD) approach, in which software is developed by repeated transformations of models. Since models are intended as executable specifications, there is a need to provide correctness management on the model level. The underlying hypothesis of this research is that model level tools should be strengthened, to support model elements in a way that would encourage users to take advantage of their features. Furthermore, model transformations should not neglect the translation of model features. This paper explores the practical relevance of detecting Finite Satisfiability problems on the model level. The frequency of occurrence of Finite Satisfiability problems, and the scalability of the efficient FiniteSat algorithm are studied on a set of synthetic class diagrams, created along designed metrics. The contribution of this work is twofold, first in advancing towards creating a benchmark of class diagrams, and second, in the empirical study of the Finite Satisfiability problem.
KW - Benchmarking
KW - Detection
KW - Finite satisfiability occurrence
KW - Large models
KW - Linear programming reduction
KW - Multiplicity constraints
KW - Scalability
KW - Statistical significance
KW - UML class diagram
UR - http://www.scopus.com/inward/record.url?scp=74949101894&partnerID=8YFLogxK
U2 - 10.1145/1656485.1656486
DO - 10.1145/1656485.1656486
M3 - Conference contribution
AN - SCOPUS:74949101894
SN - 9781605588766
T3 - ACM International Conference Proceeding Series
BT - Proceedings of the 6th International Workshop - MoDeVVa - Model-Driven Engineering, Verification and Validation
Y2 - 5 October 2009 through 5 October 2009
ER -