Publicação
Extending UML templates towards computability
| Resumo: | UML templates allow the specification of generic model elements that can be reproduced in domain models by means of the Bind relationship. Binding to a template encompasses the substitution of that template’s parameters by compatible domain elements. The requirement of compatibility, however, is checked over by UML in a very permissive way. As a consequence, binding to a template can result in badly-formed models and non-computable expressions. Such option in the design of UML was certainly intentional and meant to allow for richer semantics for the Bind relationship, as the specialization of the concept is advised at several points of the standard. This paper proposes one such specialization. One that guarantees well-formedness and computability for elements bound to a template. This is achieved by introducing the concept of Functional Conformance, which is imposed between every template’s parameter and its application domain substitute. Functional conformance is defined in terms of well-formedness rules, expressed as OCL constraints on top of OMG’s UML metamodel. |
|---|---|
| Autores principais: | Farinha, J. |
| Outros Autores: | Ramos, P. |
| Assunto: | UML Templates Verification Computability |
| Ano: | 2015 |
| País: | Portugal |
| Tipo de documento: | documento de conferência |
| Tipo de acesso: | acesso aberto |
| Instituição associada: | ISCTE |
| Idioma: | inglês |
| Origem: | Repositório ISCTE |
| _version_ | 1868443321432539136 |
|---|---|
| author | Farinha, J. |
| author2 | Ramos, P. |
| author2_role | author |
| author_facet | Farinha, J. Ramos, P. |
| author_role | author |
| country_str | PT |
| creators_json_txt | [{\"Person.name\":\"Farinha, J.\"},{\"Person.name\":\"Ramos, P.\"}] |
| datacite.creators.creator.creatorName.fl_str_mv | Farinha, J. Ramos, P. |
| datacite.date.Accepted.fl_str_mv | 2015-01-01T00:00:00Z |
| datacite.date.available.fl_str_mv | 2022-04-08T10:32:20Z |
| datacite.date.embargoed.fl_str_mv | 2022-04-08T10:32:20Z |
| datacite.rights.fl_str_mv | http://purl.org/coar/access_right/c_abf2 |
| datacite.subjects.subject.fl_str_mv | UML Templates Verification Computability |
| datacite.titles.title.fl_str_mv | Extending UML templates towards computability |
| dc.creator.none.fl_str_mv | Farinha, J. Ramos, P. |
| dc.date.Accepted.fl_str_mv | 2015-01-01T00:00:00Z |
| dc.date.available.fl_str_mv | 2022-04-08T10:32:20Z |
| dc.date.embargoed.fl_str_mv | 2022-04-08T10:32:20Z |
| dc.format.none.fl_str_mv | application/pdf |
| dc.identifier.none.fl_str_mv | http://hdl.handle.net/10071/25100 |
| dc.language.none.fl_str_mv | eng |
| dc.publisher.none.fl_str_mv | SCITEPRESS |
| dc.rights.none.fl_str_mv | http://purl.org/coar/access_right/c_abf2 |
| dc.subject.none.fl_str_mv | UML Templates Verification Computability |
| dc.title.fl_str_mv | Extending UML templates towards computability |
| dc.type.none.fl_str_mv | http://purl.org/coar/resource_type/c_c94f |
| description | UML templates allow the specification of generic model elements that can be reproduced in domain models by means of the Bind relationship. Binding to a template encompasses the substitution of that template’s parameters by compatible domain elements. The requirement of compatibility, however, is checked over by UML in a very permissive way. As a consequence, binding to a template can result in badly-formed models and non-computable expressions. Such option in the design of UML was certainly intentional and meant to allow for richer semantics for the Bind relationship, as the specialization of the concept is advised at several points of the standard. This paper proposes one such specialization. One that guarantees well-formedness and computability for elements bound to a template. This is achieved by introducing the concept of Functional Conformance, which is imposed between every template’s parameter and its application domain substitute. Functional conformance is defined in terms of well-formedness rules, expressed as OCL constraints on top of OMG’s UML metamodel. |
| dirty | 0 |
| eu_rights_str_mv | openAccess |
| format | conferenceObject |
| id | iscte_640be90e5978a198ee467b94667ea85e |
| identifier.url.fl_str_mv | http://hdl.handle.net/10071/25100 |
| instacron_str | iscte |
| institution | ISCTE |
| instname_str | ISCTE |
| language | eng |
| network_acronym_str | iscte |
| network_name_str | Repositório ISCTE |
| oai_identifier_str | oai:repositorio.iscte-iul.pt:10071/25100 |
| organization_str_mv | urn:organizationAcronym:iscte |
| person_str_mv | Farinha, J. Ramos, P. |
| publishDate | 2015 |
| publisher.none.fl_str_mv | SCITEPRESS |
| reponame_str | Repositório ISCTE |
| repository_id_str | urn:repositoryAcronym:iscte |
| service_str_mv | urn:repositoryAcronym:iscte |
| spelling | engUML templates allow the specification of generic model elements that can be reproduced in domain models by means of the Bind relationship. Binding to a template encompasses the substitution of that template’s parameters by compatible domain elements. The requirement of compatibility, however, is checked over by UML in a very permissive way. As a consequence, binding to a template can result in badly-formed models and non-computable expressions. Such option in the design of UML was certainly intentional and meant to allow for richer semantics for the Bind relationship, as the specialization of the concept is advised at several points of the standard. This paper proposes one such specialization. One that guarantees well-formedness and computability for elements bound to a template. This is achieved by introducing the concept of Functional Conformance, which is imposed between every template’s parameter and its application domain substitute. Functional conformance is defined in terms of well-formedness rules, expressed as OCL constraints on top of OMG’s UML metamodel.application/pdfengSCITEPRESSengExtending UML templates towards computabilityFarinha, J.Ramos, P.Handlehttp://hdl.handle.net/10071/25100ISBNIsPartOf978-989-758-083-3ISSNIsPartOf2184-4348DOIIsPartOf10.5220/00052571012201332022-04-08T10:32:20Z2015-01-01T00:00:00Z20152022-04-08T11:29:43Zhttp://purl.org/coar/access_right/c_abf2open accessengUMLengTemplatesengVerificationengComputability707482 byteshttp://purl.org/coar/access_right/c_abf2application/pdffulltexthttps://repositorio.iscte-iul.pt/bitstreams/f34b0c6f-367c-4e68-84db-4faf093af3b3/downloadother research producthttp://purl.org/coar/resource_type/c_c94fconference object |
| spellingShingle | Extending UML templates towards computability Farinha, J. UML Templates Verification Computability |
| status | SINGLETON |
| subject.fl_str_mv | UML Templates Verification Computability |
| title | Extending UML templates towards computability |
| title_full | Extending UML templates towards computability |
| title_fullStr | Extending UML templates towards computability |
| title_full_unstemmed | Extending UML templates towards computability |
| title_short | Extending UML templates towards computability |
| title_sort | Extending UML templates towards computability |
| topic | UML Templates Verification Computability |
| topic_facet | UML Templates Verification Computability |
| url | http://hdl.handle.net/10071/25100 |
| visible | 1 |