Skip to main content
Conference ProceedingsOPEN ACCESS

On the expressive power of OCL

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1999) 1708 854-874
DOI: 10.1007/3-540-48119-2_47
48Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This paper examines the expressive power of OCL in terms of navigability and computability. First the expressive power of OCL is compared with the relational calculus; it is showed that OCL is not equivalent to the relational calculus. Then an algorithm computing the transitive closure of a binary relation -operation that cannot be encoded in the relational calculus- is expressed in OCL. Finally the equivalence of OCL with a Turing machine is pondered.

Cite

CITATION STYLE

APA

Mandel, L., & Cengarle, M. V. (1999). On the expressive power of OCL. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1708, pp. 854–874). Springer Verlag. https://doi.org/10.1007/3-540-48119-2_47

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free