Loading...
Loading...

Go to the content (press return)

OCLFO: first-order expressive OCL constraints for efficient integrity checking

Author
Franconi, E.; Mosca, A.; Oriol, X.; Rull, G.; Teniente, E.
Type of activity
Journal article
Journal
Software and systems modeling
Date of publication
2018-08-24
DOI
https://doi.org/10.1007/s10270-018-0688-z Open in new window
Project funding
Automated reasoning, model execution, data analytics from ontologies
Information Modeling and Processing
Repository
http://hdl.handle.net/2117/121545 Open in new window
URL
https://link.springer.com/article/10.1007/s10270-018-0688-z Open in new window
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 ...
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", 24 Agost 2018.
Keywords
Integrity checking, OCL, Relational algebra
Group of research
IMP - Information Modelling and Processing
inLab FIB

Participants