Name
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. |
Year | DOI | Venue |
|---|---|---|
1999 | 10.1007/3-540-48119-2_47 | World Congress on Formal Methods |
Keywords | Field | DocType |
transitive closure,turing machine,expressive power,relational calculus,binary relation | Codd's theorem,Relational calculus,Programming language,Binary relation,Computer science,Computability,Turing machine,Equivalence (measure theory),Object Constraint Language,Transitive closure | Conference |
Volume | ISSN | ISBN |
1708 | 0302-9743 | 3-540-66587-0 |
Citations | PageRank | References |
42 | 4.88 | 4 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Luis Mandel | 1 | 45 | 6.78 |
| María Victoria Cengarle | 2 | 175 | 17.82 |