## Are you sure?

This action might not be possible to undo. Are you sure you want to continue?

**Lecture 14: Advanced OCL Expressions
**

Copyright 2001-2002, Matt Dwyer, John Hatcliff, and Rod Howell. The syllabus and all lectures for this course are copyrighted materials and may not be used in other course settings outside of Kansas State University in their current form or modified form without the express written permission of one of the copyright holders. During this course, students are prohibited from selling notes to or being paid for taking notes by any person or commercial firm without the express written permission of one of the copyright holders.

Outline

n n n n

Coding transitive closure with recursion Useful expressions Undefined values Meta-modeling

**…with the Academia model as the running example.
**

CIS 771 -- Advanced OCL Expressions 2

1

Transitive Closure in OCL n n n OCL does not have a primitive operation for transitive closure OCL does allow recursion We must implement transitive closure directly in terms of recursion CIS 771 -.use) class A end association R between A role pred A role succ end We can attempt to code the transitive closure of R as follows class A operations closure() : Set(A) = succ.Advanced OCL Expressions 4 2 .Advanced OCL Expressions 3 Transitive Closure in OCL Consider the following definitions (transitive-closure-1.closure()->asSet()->including(self) end CIS 771 -.

succ = a2 2 call: self = a2.Transitive Closure in OCL Consider the following instantiation (transitive-closure-instantiation-1.Advanced OCL Expressions 5 Transitive Closure in OCL What is happening on a1.@a2.succ = {} 3 return: Set{@a3} 2 return: Set{@a2.@a2. a3.@a3} 6 CIS 771 -.a2) into R (a2.Advanced OCL Expressions 3 . a1.succ = a3 3 call: self = a3.closure() -> Set{@a1.@a3} 1 return: Set{@a1.a3) into R An example evaluation use> ? a1.closure()->asSet()->including(self) end Tracing the evaluation through the recursion… Level Level Level Level Level Level 1 call: self = a1. a2.cmd) !create !create !create !insert !insert a1:A a2:A a3:A (a1.@a3} : Set(A) CIS 771 -.closure? class A operations closure() : Set(A) = succ.

cmd Now give the following command at the USE command line use> ? a1.a2) into R (a2.use into USE Run the script transitive-closure-instantiation-1.a3) into R (a3.a1) into R An example evaluation use> ? a1.For You To Do… n n n n Pause the lecture… Load the model in transitive-closure-1.RuntimeException: StackOverflow… CIS 771 -.closure() n what happens? why? can you fix the problem? 7 CIS 771 -.Advanced OCL Expressions 8 4 .closure() …java.cmd) !create !create !create !insert !insert !insert a1:A a2:A a3:A (a1.lang.a1) into R use> ? a1.Advanced OCL Expressions Transitive Closure in OCL Consider the following instantiation (transitive-closure-instantiation-2.closure() n what happens? n Now give the following commands at the USE command line use> !insert (a3.

g.Assessment n n n The problem is that we have an infinite path through R and the closure operation doesn’t know how to stop. a1). we should stop when we don’t find anything “new” when walking across R. we should stop when we have collected all the elements that we encounter when walking across R starting from the initial value (e.Advanced OCL Expressions If-then-else n if bool-expr then expr1 else expr2 endif n n n Returns expr1 if bool-expr is true Returns expr2 if bool-expr if false Undefined if bool-expr is undefined …we can use the if-then-else construct to help us code an appropriate transitive closure operation CIS 771 -. Intuitively.. 9 CIS 771 -. In other words.Advanced OCL Expressions 10 5 .

@a3} 12 CIS 771 -.@a3}.Advanced OCL Expressions 6 . s.Transitive Closure in OCL The correct coding of (reflexive) transitive closure closure(s : Set(A)) : Set(A) = if s->includesAll(s. Note: the closure is reflexive because argument s must be included in the result An initial call to compute reflexive transitive closure of {self} reachableFromSelf() : Set(A) = closure(Set{self}) CIS 771 -.succ->asSet) then s else closure(s->union(s.succ->asSet)) endif Note: stop when we don’t find anything new via R (succ) to add to s.reachableFromSelf() ? class A operations closure(s : Set(A)) : Set(A) = if s->includesAll(s.succ = {@a2.succ = {@a2} 2 call: s = {@a1.succ->asSet)) endif reachableFromSelf() : Set(A) = closure(Set{self}) end Tracing the evaluation through the recursion… Level Level Level Level Level Level 1 call: s = {@a1}.@a2.@a2}.@a2.succ = {@a1.@a3} 3 return: Set{@a1.@a3} 1 return: Set{@a1.@a3} 3 call: s = {@a1.succ->asSet) then s else closure(s->union(s.@a2.@a2.@a2. s.Advanced OCL Expressions 11 Transitive Closure in OCL What is happening on a1. s.@a3} 2 return: Set{@a1.

#X. X. value2. D.cmd Note that this script adds (a3. #D. C. F.a1) to R to create a cycle in R Now give the following command at the USE command line use> ? a1. …. #W CIS 771 -.reachableFromSelf() n what happens? why? CIS 771 -.Advanced OCL Expressions 14 7 . B.use into USE Run the script transitive-closure-instantiation-2. #C. #B.For You To Do… n n n n Pause the lecture… Load the model in transitive-closure-2.Advanced OCL Expressions 13 Enumeration Types (per OCL spec) General Form enum {value1. valuen} Example: Academia Grades enum {A. #F. W} Enumeration Values #A.

value2. Example: association offspring between Person[0.2] role parents Person[*] role children ordered end n Then p.. at top of model) enum TypeName {value1.Advanced OCL Expressions 15 Ordered Associations n n Sometimes we want the result of navigating an association to be a sequence.children is a sequence.g. …. 16 CIS 771 -.grade = #A end CIS 771 -. C. D. F.Advanced OCL Expressions 8 . X. valuen} Example: Academia Grades enum Grade {A.Enumeration Types (per USE) General Form – declare an enum type (e. B.. W} … class TranscriptEntry attributes course : Course use> create e:TranscriptEntry grade : Grade use> !set e.

Operations on Sequences n n n n n n s->at(i) s->first() s->last() s->append(a) s->prepend(a) s->asSet() the ith element of s the first element of s the last element of s adds a to end adds a to front converts to a set CIS 771 -.Advanced OCL Expressions 18 9 .Advanced OCL Expressions 17 let Expressions n let x : Type = expr1 in expr2 n n evaluates expr2 with each occurrence of x replaced by the value of expr1 avoids evaluating the same expression multiple times CIS 771 -.

. let x : Type1 = expr1 in .. .....Example context Person inv: let income : Integer = self. .... .x.Advanced OCL Expressions 20 10 . ... f(expr1) ....x.. . . CIS 771 -.job. .Advanced OCL Expressions 19 Helper Operations ....x...salary->sum in if isUnemployed then income < 100 else income >= 100 endif CIS 771 -....... f(x : Type1) : Type2 = ... ....x..

22 CIS 771 -. In the Transcript association. declare transcriptEntries to be ordered.j lie outside the bounds of the sequence or when i > j n sequence->at(i) n n sequence->subSequence(i.j) n n etc. Using transitive closure. add a status attribute to Student that can take on the values #Normal or #Probation. you have to use implies twice and re verse the order of the arguments.oclAsType(T) n …undefined when type of object has no subtype T …undefined when i is greater than length of sequence …undefined when i. Write a script to test your extensions. Using an enumeration type. Write an invariant that says that a student’s status is normal iff they only have grades of A’s and B’s on their transcript.Advanced OCL Expressions 11 .For You To Do… n n Pause the lecture… Extend the model in academia-7.Advanced OCL Expressions Undefined Expressions n Some expressions that can be undefined n object. add an invariant that states that there are no cycles in the prerequisite structure for courses. 21 CIS 771 -. Specifically. you may want to use a let expression since USE has no iff construct as a primitive. Use a let to avoid duplicating large expressions.use that adds grades as an enumeration type to a TranscriptEntry class as done earlier in the lecture.use as follows… n n n n n n This model already contains an extension to academia-5. For this invariant.

Undefined Expressions n Undefined expressions tend to propagate n if bool-expr then expr-1 else expr-2 n …undefined if bool-expr is undefined n …many other examples n Exceptions: n n true or anything = true false and anything = false 23 CIS 771 -. CIS 771 -. Create some expressions where undefined values are propagated.Advanced OCL Expressions For You To Do… n n n n Pause the lecture… Create some expressions whose values are undefined. Create some examples where and and or absorb the undefined values.Advanced OCL Expressions 24 12 .

3} have the same value.. 2. n Bag(Set(Sequence(Person))).3 Section 7.20) 25 n CIS 771 -. Set{2. 3}} and Set {1.7. Set{Set{1.5.Collections are Flat (per OCL) n In OCL. (see OMG-UML v1. Collection types can be nested to any level. e. CIS 771 -.13 p. n Implicit flattening is only done when used with the shorthand notation for collect . This happens implicitly and is beyond your control.Advanced OCL Expressions Collections Are Usually Not Flat n (per USE) In USE. 2}.OCL in USE distribution) 26 13 .Advanced OCL Expressions (see README.g.

7.29) 28 14 .g.Advanced OCL Expressions (see README.employees)->flatten CIS 771 -.Advanced OCL Expressions (see OMG-UML v1.3 Section 7.1 po. This result value can be flattened into a Bag(Employee) by using the following expression: company.employees) results in Bag(Set(Employee)).1.branches->collect(c | c. company.28-7. For example..OCL in USE distribution) 27 For You To Do… n n n Pause the lecture… Try some examples of nested collections in USE (e. and then define collections as literals) Flatten them with the flatten operation CIS 771 -. you can even use the transitive-closure models.Collections Are Usually Not Flat n (per USE) n You can always explicitly flatten a collection with the flatten operation that has been added in USE.8.branches->collect(c | c.

CIS 771 -.name : String type.associationEnds : Set(String) type.3 – March 2000) CIS 771 -.allSupertypes : Set(OclType) type.Meta Properties n n n n n n n type.allInstances : Set(type) Note: it appears that only the last property is supported in USE.Advanced OCL Expressions 29 Acknowledgements n Material for this lecture is based on the following sources n Chapter 7 (the OCL chapter) of the OMG-UML specification (version 1.supertypes : Set(OclType) type.operations : Set(String) type.Advanced OCL Expressions 30 15 .attributes : Set(String) type.

- 9781849692304-Chapter-02_Custom_Character_Controller_Sample_Chapteruploaded byjagdevs7234
- Auto Genuploaded bysekadara
- The Ring programming language version 1.3 book - Part 12 of 88uploaded byMahmoud Samir Fayed
- Phpuploaded byLordan Bitao
- COMIntegrationC#Nutshell2ndEduploaded bysdk1712004
- 2. Program Control Structures_Part 1uploaded byThinagaran Mahendran
- UCLA cs class Lecture2 Postuploaded byManuel Sosaeta
- SCJP6_CoreAPIuploaded bysuthaz
- cuploaded byShahnawaz Javed
- Scilab and Scicos Revised pptx.pptxuploaded bybnataraj
- Visual Basic Va Picuploaded bynguyendaoctv
- CSE2123-Lecture-07-08uploaded byShahid Khattak
- 02 Data Typesuploaded bySourav Saha
- Chapter 8 Newuploaded byvaishuraks
- c - What Are the Applications of the ## Preprocessor Operator and Gotchas to Consider_ - Stack Overflowuploaded byaamya
- Tutorial Portofoliouploaded byNurryna Nisa Irtidyanti
- VHDL Operatorsuploaded byAli Ahmad
- 03 Slideuploaded byAnonymous ZntoXci
- Java Software Solutions, 5 e Source Codeuploaded byHoussem Alimi
- Classroom 4uploaded bynitcvishesh
- Closest Pairs Clusteringuploaded byMATAMALA13
- Appendix 4.1 ADT List Specificationuploaded byWong Kah Wai
- systemverilog_qref.pdfuploaded byVinay Singh
- Mathsuploaded bybluepasta
- 3-Goedel-imcompletenessuploaded bygodwsky
- 2009-9uploaded byYang Yi
- Solution 2uploaded byirinarm
- Excel VBA Notes for Professionals ElSaber21.Comuploaded byWendy Navarro Marquez
- Yuri Gurevich, Neil Immerman and Saharon Shelah- McColm's Conjectureuploaded byJgfm2
- An09005 Am42xx Sensor User Guide v1.0uploaded byAlberto Garcia

Close Dialog## Are you sure?

This action might not be possible to undo. Are you sure you want to continue?

Loading