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.
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 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.
@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 = {Topic: <b>Binary class relations</b>,
Rubrique : <b>relations binaires entre classes</b>,
Conference: 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
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.}
}
Downloads: 0
{"_id":"HzcNDoTshjB7KeRaD","bibbaseid":"guhneuc-albinamiot-recoveringbinaryclassrelationshipsputtingicingontheumlcake-2004","downloads":0,"creationDate":"2018-01-17T20:29:42.598Z","title":"Recovering Binary Class Relationships: Putting Icing on the UML Cake","author_short":["Gu�h�neuc, Y.","Albin-Amiot, H."],"year":2004,"bibtype":"inproceedings","biburl":"http://www.yann-gael.gueheneuc.net/Work/Publications/Biblio/complete-bibliography.bib","bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Yann-Ga�l"],"propositions":[],"lastnames":["Gu�h�neuc"],"suffixes":[]},{"firstnames":["Herv�"],"propositions":[],"lastnames":["Albin-Amiot"],"suffixes":[]}],"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":[{"firstnames":["Doug","C."],"propositions":[],"lastnames":["Schmidt"],"suffixes":[]}],"month":"October","note":"14 pages.","optnumber":"","optorganization":"","pages":"301–314","publisher":"ACM Press","optseries":"","optvolume":"","keywords":"Topic: <b>Binary class relations</b>, Rubrique : <b>relations binaires entre classes</b>, Conference: 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 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.","bibtex":"@INPROCEEDINGS{Gueheneuc04-OOPSLA-RecoveringBCR,\r\n AUTHOR = {Yann-Ga�l Gu�h�neuc and Herv� Albin-Amiot},\r\n BOOKTITLE = {Proceedings of the 19<sup>th</sup> Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA)},\r\n TITLE = {Recovering Binary Class Relationships: Putting Icing on \r\n the UML Cake},\r\n YEAR = {2004},\r\n OPTADDRESS = {},\r\n OPTCROSSREF = {},\r\n EDITOR = {Doug C. Schmidt},\r\n MONTH = {October},\r\n NOTE = {14 pages.},\r\n OPTNUMBER = {},\r\n OPTORGANIZATION = {},\r\n PAGES = {301–314},\r\n PUBLISHER = {ACM Press},\r\n OPTSERIES = {},\r\n OPTVOLUME = {},\r\n KEYWORDS = {Topic: <b>Binary class relations</b>, \r\n Rubrique : <b>relations binaires entre classes</b>, \r\n Conference: OOPSLA},\r\n URL = {http://www.ptidej.net/publications/documents/OOPSLA04.doc.pdf},\r\n PDF = {http://www.ptidej.net/publications/documents/OOPSLA04.ppt.pdf},\r\n ABSTRACT = {A discontinuity exists between object-oriented modeling \r\n and programming languages. This discontinuity arises from ambiguous \r\n concepts in modeling languages and a lack of corresponding concepts \r\n in programming languages. It is particularly acute for binary class \r\n relationships—association, aggregation, and composition. It \r\n hinders the traceability between software implementation and design, \r\n thus hampering software analysis. We propose consensual definitions \r\n of the binary class relationships with four minimal \r\n properties—exclusivity, invocation site, lifetime, \r\n multiplicity. We describe algorithms to detect automatically the \r\n properties in source code and apply these on several frameworks. \r\n Thus, we bridge the gap between implementation and design for the \r\n binary class relationships, easing software analysis.}\r\n}\r\n\r\n","author_short":["Gu�h�neuc, Y.","Albin-Amiot, H."],"editor_short":["Schmidt, D. C."],"key":"Gueheneuc04-OOPSLA-RecoveringBCR","id":"Gueheneuc04-OOPSLA-RecoveringBCR","bibbaseid":"guhneuc-albinamiot-recoveringbinaryclassrelationshipsputtingicingontheumlcake-2004","role":"author","urls":{"Paper":"http://www.ptidej.net/publications/documents/OOPSLA04.doc.pdf"},"keyword":["Topic: <b>Binary class relations</b>","Rubrique : <b>relations binaires entre classes</b>","Conference: OOPSLA"],"metadata":{"authorlinks":{"gu�h�neuc, y":"https://bibbase.org/show?bib=http%3A%2F%2Fwww.yann-gael.gueheneuc.net%2FWork%2FPublications%2FBiblio%2Fcomplete-bibliography.bib&msg=embed","guéhéneuc, y":"https://bibbase.org/show?bib=http://www.yann-gael.gueheneuc.net/Work/BibBase/guehene%20(automatically%20cleaned).bib"}},"downloads":0},"search_terms":["recovering","binary","class","relationships","putting","icing","uml","cake","gu�h�neuc","albin-amiot"],"keywords":["topic: <b>binary class relations</b>","rubrique : <b>relations binaires entre classes</b>","conference: oopsla"],"authorIDs":["AfJhKcg96muyPdu7S","xkviMnkrGBneANvMr"],"dataSources":["Sed98LbBeGaXxenrM","8vn5MSGYWB4fAx9Z4"]}