Recovering Binary Class Relationships: Putting Icing on the UML Cake. Gu�h�neuc, Y. & Albin-Amiot, H. In Proceedings of the 19<sup>th</sup> Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA), pages 301–314, October, 2004. ACM Press. 14 pages.
Recovering Binary Class Relationships: Putting Icing on the UML Cake [pdf]Paper  abstract   bibtex   
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 relation­ships—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.
@INPROCEEDINGS{Gueheneuc04-OOPSLA-RecoveringBCR,
   AUTHOR       = {Yann-Ga�l Gu�h�neuc and Herv� Albin-Amiot},
   BOOKTITLE    = {Proceedings of the 19<sup>th</sup> Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA)},
   TITLE        = {Recovering Binary Class Relationships: Putting Icing on 
      the UML Cake},
   YEAR         = {2004},
   OPTADDRESS   = {},
   OPTCROSSREF  = {},
   EDITOR       = {Doug C. Schmidt},
   MONTH        = {October},
   NOTE         = {14 pages.},
   OPTNUMBER    = {},
   OPTORGANIZATION = {},
   PAGES        = {301--314},
   PUBLISHER    = {ACM Press},
   OPTSERIES    = {},
   OPTVOLUME    = {},
   KEYWORDS     = {Binary class relations, OOPSLA},
   URL          = {http://www.ptidej.net/publications/documents/OOPSLA04.doc.pdf},
   PDF          = {http://www.ptidej.net/publications/documents/OOPSLA04.ppt.pdf},
   ABSTRACT     = {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 
      relation\-ships---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.}
}
Downloads: 0