| Program |
 |
|
|
|
| Find in Program |
|
|
|
|
| Page |
|
|
|
|
| Basket |
|
|
view, help
"Recovering Binary Class Relationships: Putting Icing on the UML Cake"
|
|
|
|
Recovering Binary Class Relationships: Putting Icing on the UML Cake
Meeting Rooms 1-3
Wednesday, 15:30, 30 minutes | 7 | · | 8 | · | 9 | · | 10 | · | 11 | · | 12 | · | 13 | · | 14 | · | 15 | · | 16 | · | 17 | · | 18 | · | 19 | · | 20 | · | 21 |
Yann-Ga?l Gu?h?neuc, Universit? de Montr?al
Herv? Albin-Amiot, Ecole des Mines de Nantes
A discontinuity exists between object-oriented modeling and
programming languages. This discontinuity arises from ambiguous
concepts in modeling languages and a lack of corresponding
concepts in programming languages. It is particularly acute for
binary class relationships—association, aggregation, and
composition. It hinders the traceability between software
implementation and design, thus hampering software analysis. We
propose consensual definitions of the binary class relationships
with four minimal properties—exclusivity, invocation site,
lifetime, multiplicity. We describe algorithms to detect
automatically the properties in source code and apply these on
several frameworks. Thus, we bridge the gap between implementation
and design for the binary class relationships, easing software
analysis.
|
