$$\hbox {OCL}_\textsf {FO}$$ OCL FO : first-order expressive OCL constraints for efficient integrity checking

摘要: OCL is the standard language for defining constraints in UML class diagrams. Unfortunately, as we show this paper, full so expressive that it not possible to check general efficiently. In particular, checking only polynomial, but even semidecidable. To overcome situation, identify $$\hbox {OCL}_\textsf {FO}$$ , a fragment of which expressively equivalent relational algebra (RA). By mean any constraint can be checked through RA query (which guarantees efficient, i.e., polynomial), and encoding some written an expressiveness ). paper define syntax concisely determine its semantics set theory, prove equivalence RA. Additionally, core language, minimal subset