Mostra el registre d'ítem simple
OCLFO: first-order expressive OCL constraints for efficient integrity checking
dc.contributor.author | Franconi, Enrico |
dc.contributor.author | Mosca, Alessandro |
dc.contributor.author | Oriol Hilari, Xavier |
dc.contributor.author | Rull, Guillem |
dc.contributor.author | Teniente López, Ernest |
dc.contributor.other | Facultat d'Informàtica de Barcelona |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament d'Enginyeria de Serveis i Sistemes d'Informació |
dc.date.accessioned | 2018-09-27T10:33:32Z |
dc.date.available | 2019-08-24T00:25:48Z |
dc.date.issued | 2019-08 |
dc.identifier.citation | Franconi, E., Mosca, A., Oriol, X., Rull, G., Teniente, E. OCLFO: first-order expressive OCL constraints for efficient integrity checking. "Software and systems modeling", Agost 2019, vol. 18, núm. 4, p.2655-2678. |
dc.identifier.issn | 1619-1366 |
dc.identifier.uri | http://hdl.handle.net/2117/121545 |
dc.description.abstract | OCL is the standard language for defining constraints in UML class diagrams. Unfortunately, as we show in this paper, full OCL is so expressive that it is not possible to check general OCL constraints efficiently. In particular, we show that checking general OCL constraints is not only not polynomial, but not even semidecidable. To overcome this situation, we identify OCLFO , a fragment of OCL which is expressively equivalent to relational algebra (RA). By equivalent we mean that any OCLFO constraint can be checked through a RA query (which guarantees that OCLFO checking is efficient, i.e., polynomial), and any RA query encoding some constraint can be written as an OCLFO constraint (which guarantees expressiveness of OCLFO ). In this paper we define the syntax of OCLFO , we concisely determine its semantics through set theory, and we prove its equivalence to RA. Additionally, we identify the core of this language, i.e., a minimal subset of OCLFO equivalent to RA. |
dc.language.iso | eng |
dc.subject | Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica |
dc.subject.lcsh | Algebra |
dc.subject.lcsh | UML (Computer science) |
dc.subject.other | OCL |
dc.subject.other | Relational algebra |
dc.subject.other | Integrity checking |
dc.title | OCLFO: first-order expressive OCL constraints for efficient integrity checking |
dc.type | Article |
dc.subject.lemac | Àlgebra |
dc.subject.lemac | UML (Informàtica) |
dc.contributor.group | Universitat Politècnica de Catalunya. IMP - Information Modeling and Processing |
dc.identifier.doi | 10.1007/s10270-018-0688-z |
dc.description.peerreviewed | Peer Reviewed |
dc.relation.publisherversion | https://link.springer.com/article/10.1007/s10270-018-0688-z |
dc.rights.access | Open Access |
local.identifier.drac | 23340939 |
dc.description.version | Postprint (author's final draft) |
dc.relation.projectid | info:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2013-2016/TIN2017-87610-R/ES/RAZONAMIENTO AUTOMATICO, EJECUCION DE MODELOS Y ANALISIS DE DATOS A PARTIR DE ONTOLOGIAS/ |
dc.relation.projectid | info:eu-repo/grantAgreement/AGAUR/2017 SGR 1749 |
local.citation.author | Franconi, E.; Mosca, A.; Oriol, X.; Rull, G.; Teniente, E. |
local.citation.publicationName | Software and systems modeling |
local.citation.volume | 18 |
local.citation.number | 4 |
local.citation.startingPage | 2655 |
local.citation.startingPage | 2655 |
local.citation.endingPage | 2678 |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
Articles de revista [222]
-
Articles de revista [126]