Show simple item record

dc.contributor.authorFranconi, Enrico
dc.contributor.authorMosca, Alessandro
dc.contributor.authorOriol Hilari, Xavier
dc.contributor.authorRull, Guillem
dc.contributor.authorTeniente López, Ernest
dc.contributor.otherFacultat d'Informàtica de Barcelona
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament d'Enginyeria de Serveis i Sistemes d'Informació
dc.date.accessioned2018-09-27T10:33:32Z
dc.date.issued2018-08-24
dc.identifier.citationFranconi, E., Mosca, A., Oriol, X., Rull, G., Teniente, E. OCLFO: first-order expressive OCL constraints for efficient integrity checking. "Software and systems modeling", 24 Agost 2018.
dc.identifier.issn1619-1366
dc.identifier.urihttp://hdl.handle.net/2117/121545
dc.description.abstractOCL 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.isoeng
dc.subjectÀrees temàtiques de la UPC::Informàtica::Informàtica teòrica
dc.subject.lcshAlgebra
dc.subject.lcshUML (Computer science)
dc.subject.otherOCL
dc.subject.otherRelational algebra
dc.subject.otherIntegrity checking
dc.titleOCLFO: first-order expressive OCL constraints for efficient integrity checking
dc.typeArticle
dc.subject.lemacÀlgebra
dc.subject.lemacUML (Informàtica)
dc.contributor.groupUniversitat Politècnica de Catalunya. IMP - Information Modeling and Processing
dc.identifier.doi10.1007/s10270-018-0688-z
dc.description.peerreviewedPeer Reviewed
dc.relation.publisherversionhttps://link.springer.com/article/10.1007/s10270-018-0688-z
dc.rights.accessRestricted access - publisher's policy
drac.iddocument23340939
dc.description.versionPostprint (author's final draft)
dc.relation.projectidinfo:eu-repo/grantAgreement/MICINN/TIN2017-87610-R
dc.relation.projectidinfo:eu-repo/grantAgreement/AGAUR/2017 SGR 1749
dc.date.lift2019-08-24
upcommons.citation.authorFranconi, E., Mosca, A., Oriol, X., Rull, G., Teniente, E.
upcommons.citation.publishedtrue
upcommons.citation.publicationNameSoftware and systems modeling


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder