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{\"e}l Gu{\'e}h{\'e}neuc and Herv{\'e} Albin-Amiot},
title = {Recovering Binary Class Relationships: {P}utting Icing on the {UML} Cake},
booktitle = {Proceedings of the 19<sup>{th}</sup> Conference on Object-Oriented Programming, Systems, Languages, and Applications ({OOPSLA})},
year = {2004},
month = {October},
editor = {Doug C. Schmidt},
publisher = {ACM Press},
note = {14 pages.},
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.},
grant = {NSERC DG},
keywords = {Binary class relations ; OOPSLA},
kind = {MISA},
language = {english},
url = {http://www.ptidej.net/publications/documents/OOPSLA04.doc.pdf},
pdf = {http://www.ptidej.net/publications/documents/OOPSLA04.ppt.pdf},
pages = {301--314}
}
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/BibBase/guehene (automatically cleaned).bib","bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Yann-Gaël"],"propositions":[],"lastnames":["Guéhéneuc"],"suffixes":[]},{"firstnames":["Hervé"],"propositions":[],"lastnames":["Albin-Amiot"],"suffixes":[]}],"title":"Recovering Binary Class Relationships: Putting Icing on the UML Cake","booktitle":"Proceedings of the 19<sup>th</sup> Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA)","year":"2004","month":"October","editor":[{"firstnames":["Doug","C."],"propositions":[],"lastnames":["Schmidt"],"suffixes":[]}],"publisher":"ACM Press","note":"14 pages.","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.","grant":"NSERC DG","keywords":"Binary class relations ; OOPSLA","kind":"MISA","language":"english","url":"http://www.ptidej.net/publications/documents/OOPSLA04.doc.pdf","pdf":"http://www.ptidej.net/publications/documents/OOPSLA04.ppt.pdf","pages":"301–314","bibtex":"@INPROCEEDINGS{Gueheneuc04-OOPSLA-RecoveringBCR,\n author = {Yann-Ga{\\\"e}l Gu{\\'e}h{\\'e}neuc and Herv{\\'e} Albin-Amiot},\n title = {Recovering Binary Class Relationships: {P}utting Icing on the {UML} Cake},\n booktitle = {Proceedings of the 19<sup>{th}</sup> Conference on Object-Oriented Programming, Systems, Languages, and Applications ({OOPSLA})},\n year = {2004},\n month = {October},\n editor = {Doug C. Schmidt},\n publisher = {ACM Press},\n note = {14 pages.},\n 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.},\n grant = {NSERC DG},\n keywords = {Binary class relations ; OOPSLA},\n kind = {MISA},\n language = {english},\n url = {http://www.ptidej.net/publications/documents/OOPSLA04.doc.pdf},\n pdf = {http://www.ptidej.net/publications/documents/OOPSLA04.ppt.pdf},\n pages = {301--314}\n}\n\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":["Binary class relations ; 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,"html":""},"search_terms":["recovering","binary","class","relationships","putting","icing","uml","cake","guéhéneuc","albin-amiot"],"keywords":["binary class relations ; oopsla"],"authorIDs":["AfJhKcg96muyPdu7S","xkviMnkrGBneANvMr"],"dataSources":["Sed98LbBeGaXxenrM","8vn5MSGYWB4fAx9Z4"]}