Issue 1790: Lack of features commonly used in OCL
Issue 3513: OCL: Usage of qualifiers
Issue 5971: OCL 2: OrderedSet
Issue 5973: OCL 2: what is a collection?
Issue 6528: Provide access to the sender of a message
Issue 6530: status of objects and tuples
Issue 6533: Template return types in operation signatures
Issue 6534: Up- and Down-casts with oclAsType().
Issue 6535: Lack of operation specifications
Issue 6536: Additional annotations in the OCL Standard Library
Issue 6538: Exception of strict evaluation (implies)
Issue 6539: Exception of strict evaluation (forAll, exists)
Issue 6540: Exception of strict evaluation (queries)
Issue 6541: Exception of strict evaluation (=)
Issue 6547: Incomplete and missing well-formedness rules
Issue 6548: Satisfaction of Operation Specifications
Issue 6549: Satisfaction of Operation Specifications (2)
Issue 6550: Satisfaction of Operation Specifications (3)
Issue 6551: Add select/reject/collectNested to Collection
Issue 6553: Clarify the semantics of forAll
Issue 6554: Clarify the UML semantics of IfExpEval
Issue 6557: Introduce a "tuplejoin" operator
Issue 6559: Issue: Virtual machine
Issue 6561: Issue: Unspecified syntax and semantics for Integer, Real, and String
Issue 6563: Issue: Comments
Issue 6565: Issue: Grammar of OCL
Issue 6566: Issue: Abstract syntax tree
Issue 6571: Issue: Syntax of Operation Call, Iterator, and Iterate Expressions
Issue 6572: Issue: Parsing Tuple Types and Collection Types as Arguments
Issue 6573: Issue: OclAny operations of tuples and collections
Issue 6574: Issue: Signature of Environment
Issue 6600: The index seems incomplete
Issue 6601: compliance points strategies
Issue 6609: OclUndefined / allInstances() clarification.
Issue 6614: Example with TupleType
Issue 6879: The notation for testing the type of a metaclass is too verbose
Issue 6880: The notation for selecting elements should be more intuitive
Issue 6881: notation for selecting unique element within a list should be more concise
Issue 6882: There is no simple way to invoke an "if then else" on a collection
Issue 6883: The notation when nesting "if then else" is too verbose
Issue 6884: The notation when nesting "if then else" is too verbose
Issue 6885: Improve the notation when defining local variables
Issue 6886: Allow applying iteration operations on single objects
Issue 6887: Allow implicit type casting to boolean when a boolean is expected
Issue 6889: Automatic casting between strings and enumeration values
Issue 6890: Suppress the usage of an Ocl prefix in standard library operations
Issue 6891: Allow defining standard library functions
Issue 6892: Allow defining default values for parameters in operations
Issue 6893: Provide specific notational support when testing stereotypes
Issue 6894: Add a generic text formatter operator '%
Issue 6895: Make usage of tuples less complex and less verbose
Issue 7455: Add an import statement to OCL files (with package - endpackage block)
Issue 7457: Add a concrete syntax to allow OCL users to add additional IteratorExp’s
Issue 7466: rewrite well-formedness
Issue 7500: context Classifier (02)
Issue 7501: context Operation
Issue 7502: context Parameter::asAttribute(): Attribute
Issue 7503: context State::getStateMachine() : StateMachine
Issue 7504: context VariableDeclaration::asAttribute() : Attribute
Issue 7505: parameters of the referredOperation
Issue 7506: parameters of the referredOperation
Issue 7507: An additional attribute refParams lists all parameters of the referred
Issue 7508: 1] The type of the attribute is the type of the value expression.
Issue 7509: context LocalSnapshot
Issue 7510: outgoingMessages results in the sequence of OclMessageValues
Issue 7511: context IfExpEval inv:
Issue 7512: sub evaluations (in the sequence bodyEvals)
Issue 7513: sub evaluations (in sequence bodyEvals) have different environment.
Issue 7514: ocl message expression
Issue 7515: isSent attribute
Issue 7516: add ’and’ between both expression parts
Issue 7517: result value of an association class call expression evaluation
Issue 7518: value of an association end call expression evaluation
Issue 7519: missing ’inv:’ twice
Issue 7520: an iterate expression evaluation
Issue 7521: arguments
Issue 7522: inv: model.sentSignal->size() = 1 implies
Issue 7523: arguments of the return message of an ocl message expression
Issue 7524: Only one of the attributes isPost and isPre may be true at the same time.
Issue 7525: ’element’ should be ’elements’
Issue 7526: ’element’ should be ’elements’ (02)
Issue 7527: ’Element’ should be ’NameValueBinding’
Issue 7528: history of an object is ordered.
Issue 7529: The history of an object is ordered.(02)
Issue 7530: The operation allPredecessors
Issue 7531: elements in a tuple value
Issue 7532: value of an association class call expression
Issue 7533: result value of an association end call expression
Issue 7534: result value of an association class call expression
Issue 7535: result value of an association end call expression
Issue 7536: result value of an association end call expression (02)
Issue 7537: result value of an attribute call expression
Issue 7538: value of a collection item
Issue 7539: result value of a collection literal expression evaluation
Issue 7540: number of elements in the result value
Issue 7541: value of a collection range
Issue 7542: result value of an if expression
Issue 7543: elements in the result value
Issue 7544: value of a collection range
Issue 7545: sub evaluations
Issue 7546: sub evaluations (02)
Issue 7722: Section: 6.5.4.3 Combining Properties
Issue 7972: OCL Constraints in many levels
Issue 8620: Section: 7.4
Issue 8621: Section: 7.4.5
Issue 8622: Section: 7.5.3
Issue 8623: Section: 7.5.8
Issue 8624: Section: 7.5.9
Issue 8625: Section: 7.5.11
Issue 8626: Section: 7.5.13
Issue 8627: Section: 7.6.2
Issue 8628: Section: 8.2
Issue 8634: Section: 8.3
Issue 8635: Section: 8.3.4
Issue 8636: Section: 8.3.5
Issue 8637: Section: 8.3.1
Issue 8638: Section: 8.3.8
Issue 8639: Section: 9.1
Issue 8640: Section: 9.3 CollectionLiteralPartsCS
Issue 8641: Section: 10.1
Issue 8642: Section: 10.2
Issue 8643: Section: 10.2.1 Element
Issue 8644: Section: 10.2.1 NameValueBinding
Issue 8645: Section: 10.2.2 LocalSnapshot
Issue 8646: Section: 10.2.3 ObjectValue
Issue 8647: Section: 10.3
Issue 8648: Section: 10.3.1 LoopExpEval
Issue 8649: Section: 10.3.1 VariableExpEval
Issue 8650: Section: 10.3.2 AssociationEndCallExpEval
Issue 8651: Section: 10.3.2 OperationCallExp
Issue 8652: Section: 10.3.2 NavigationCallExpEval
Issue 8653: Section: 10.3.4 OclMessageArgEval
Issue 8654: Section: 10.3.4 OclMessageArgEval
Issue 8655: Section: 10.3.4 OclMessageExpEval
Issue 8656: Section: 10.3.5
Issue 8657: Section: 10.4
Issue 8658: Section: 10.4.3 IntegerLiteralExpEval
Issue 8659: Section: 11.2.1
Issue 8660: Section: 11.5.1
Issue 8661: Section: 11.5.4
Issue 8665: Section: 11.9.2 sortedBy
Issue 8666: Section: 11.9.3 & 11.9.4
Issue 8667: Section: 1 - 13
Issue 8789: The spec does not describes the syntax of integer, real or string literals
Issue 8808: Container of additional operations
Issue 8902: Section 8.3.9 of the final Adopted Version of the OCL 2.0 Spec
Issue 8917: allInstances
Issue 8918: Navigating across non navigable associations
Issue 8922: Section 8.3.9 of the final Adopted Version of the OCL 2.0 Spec
Issue 8937: Notation for accessing class operations is inconsistent
Issue 8982: Circular imports
Issue 9171: Introduction and oclType()
Issue 9404: inability to uniquely reference association ends
Issue 9405: Wrong subtyping of PropertyCallExp and NavigationCallExp
Issue 9796: Section: 7.3.4
Issue 9913: Section: 8.3.5
Issue 9914: Section: 7.5.9
Issue 9915: Using "def"
Issue 10344: Section: 7.4.9
Issue 10346: Section: 7.8
Issue 10430: Section 7.6.3
Issue 10431: Section 9.2.2
Issue 10432: Section "IteratorExpCS"
Issue 10433: 11.2.3
Issue 10434: 11.2.4 (OclInvalid) - similar criticism as 11.2.3
Issue 10435: 11.8.1
Issue 10436: 11.2.5
Issue 10437: 11.2.5 (02)
Issue 10438: 11.7.1
Issue 10439: Recommendations re ptc/2005-06-06
Issue 10561: inclusion of Regular Expression support
Issue 10782: Naming of Constraints in OCL
Issue 10786: Naming of Constraints in OCL (02)
Issue 10787: OCL Collections applied to Properties
Issue 10825: ownership of association ends does not matter for traversal in OCL
Issue 10921: TypeType
Issue 10946: Collection element type serialization
Issue 10969: Usage of initialization and derivation constraints on the same property
Issue 11085: 8.2.2 Well-formedness Rules for the Types Package
Issue 11086: missing closing parethesis inthese two expressions
Issue 11097: Dynamic typing with allInstances()
Issue 11098: Section: 7.4.7, 7.4.9, 9.3.2
Issue 12378: Section 8.2 InvalidType
Issue 12419: CollectionType and CollectionKind
Issue 12438: last line on page 28
Issue 12439: Section: A/1.1.1 Types
Issue 12440: Section: A/1.1.5 Associations
Issue 12441: Section: A/1.1.5 Associations -- missing word
Issue 12442: Section: A/1.1.5 Associations
Issue 12443: Section: A/1.1.6 Generalization
Issue 12444: Section: A/1.1.6 Generalization - editorial issues
Issue 12445: Section: A/1.2.1 Objects
Issue 12446: Section: A/1.2.4 System State
Issue 12447: Section: A/2.2 Common Operations on All Types
Issue 12448: section 7.4.6 (p. 12)
Issue 12449: no explanations about how to manipulate optional and multivalued attributes
Issue 12450: The Tuple constructor is problematic
Issue 12451: OrderedSet collection
Issue 12452: Recursivity is not explicitly addressed with examples
Issue 12453: Mismatch between the definition of operators in, e.g., Section 11.7.1 and i
Issue 12454: The constraint [1] on the TupleLiteralPart metaclass is overconstrained
Issue 12456: Errors in examples
Issue 12457: Section: A/2.3 Enumeration Types
Issue 12458: Section: A/2.3 Enumeration Types -- editorial
Issue 12459: Section: Definition A.23 (Semantics of Navigation Operations)
Issue 12460: Section: A.2.5.2 Definition A.24 (Type Expressions)
Issue 12461: Section: A.2.5.5 Collection Operations
Issue 12464: Section: A/2.5.5 Collection Operations - just before table A.3
Issue 12468: Section: A/2.5.5 Collection Operations - Table A.3
Issue 12469: A.2.5.5 Collection Operations
Issue 12470: There are two instances of missing and misplaced parentheses
Issue 12471: Section: A.2.5.6 Set Operations
Issue 12472: Section: A.2.5.6 Set Operations Table A.4
Issue 12473: Section: A.2.5.8 Sequence Operations
Issue 12474: Section: A.3.1.1 Syntax of Expressions
Issue 12475: Section: A.3.1.1 Syntax of Expressions
Issue 12476: Section: A.3.1.1 Syntax of Expressions (Definition A.29)
Issue 12477: Syntax of Expressions (second sentence after Definition A..29)
Issue 12478: Section: A.2.6 Special Types
Issue 12479: Section: A.2.6.1 Definition A.26 (Special Types)
Issue 12484: Section 8.2.1 Type Conformance on page 37
Issue 12485: Section 8.2 page 35 InvalidType
Issue 12486: Section: A.2.7 Type Hierarchy
Issue 12487: Section: A.3.1.1 Syntax of Expressions
Issue 12488: Section: A.3.1.2 Semantics of Expressions
Issue 12489: Section: A.3.1.2 Semantics of Expressions, Definition A.30 part ii
Issue 12490: Section: A.2.5.8 Sequence Operations
Issue 12491: Section: A.3.1.2 Semantics of Expressions
Issue 12493: Section: A.3.2.2 Syntax and Semantics of Postconditions
Issue 12494: Section: A.3.2.2 Syntax and Semantics of Postconditions (02)
Issue 12495: Section: A.3.2.2 Syntax and Semantics of Postconditions (03)
Issue 12496: Section: A.3.2.2 Syntax and Semantics of Postconditions (04)
Issue 12562: CMOF serializations of its metamodels not published
Issue 12581: OCL 2.0 8.2 Collection Type name distinguishability
Issue 12582: OCL 2.0 8.2 Collection Type packaging
Issue 12795: Special Types violate UML Generalization Semantics
Issue 12854: OCL 2.0 Issue: References to Additional Attributes and Operations
Issue 12943: OCL 2.0: CollectionType constraint for invalid elements is incorrect
Issue 12944: Type of a type expression
Issue 12945: Missing definition of of iterators for OrderedSets
Issue 12946: The operation asSet, asSequence, asBag and asOrderedSet missing for OrderedSets
Issue 12947: Clarify the common supertype of Bag and Sequence
Issue 12948: Making OclAny denote any object
Issue 12949: Incosistency between UnlimitedInteger and UnlimitedNatural
Issue 12950: No way to represent type parameters in the standard library
Issue 12951: Use of MOF reflection in EssentialOCL should be clarified
Issue 12952: Use of simple quotes and double quotes in strings
Issue 12953: Exact type of Set{} and missing Set(MyType){} literal definitions
Issue 13057: Section: 7.5.15
Issue 13076: The concrete syntax given is extremely difficult to implement
Issue 13077: The following collection operations would be useful for the HL7 GELLO project:
Issue 13225: Redundant CollectionLiteralExp::kind complicates collection type extension
Issue 13535: doubts about the iterator variables
Issue 13536: type of the iterator variable is expected or not?
Issue 13537: have tuple fields and let variables to have the declaration of their types explicity?
Issue 13915: Role 'collectionTypes' should be 'collectionType'
Issue 13944: [OCL-2.1 RTF] Transitive closure operator
Issue 14094: Erroneous operation names 'isOclType' and 'asOclType'
Issue 14196: Missing specification of UnlimitedNatural
Issue 14197: OCL 2.0, 2.1 inconsistent definition of null and invalid
Issue 14199: OCL 2.0, 2.1 Inaccurate well-formedness constraints for IteratorExp
Issue 14200: OCL 2.0 Inadequate Headings and PDF index
Issue 14222: OCL 2.1 Inconsistent implementation of Issue 6532 and contradictory resolution of Issues 7341 and 10437
Issue 14224: Inconsistent lookup for underscored symbols
Issue 14225: Set operations for OrderedSet
Issue 14236: OCL 2.1 Incomplete resolution 9913 InvalidLiteralExpCS and NullLiteralExpCS
Issue 14237: OCL 2.0 and 2.1 Section 9.3 CollectionRangeCS incorrect operator spelling
Issue 14357: OCL 2.1 Resolution of missing Concrete Syntaxes and Reserved Words
Issue 14576: OCL 2.1 11.7: Clarifying Collection Well-formedness rules
Issue 14577: OCL 2.1 11.7 Inflexible Collection operation signatures
Issue 14582: OCL 2.1 7.4.7 Inconsistent Operator Associativity and Precedence
Issue 14583: OCL 2.1 7.4.9 true, self, Bag and String are not reserved words
Issue 14584: OCL 2.1 9.3 Inferred TupleLiteralExp part type
Issue 14585: OCL 2.1 9.3 Missing TypeLiteralExpCS
Issue 14586: OCL 2.1 12.2.5 named-self classifierContextDeclCS
Issue 14587: OCL 2.1 12.2.3 Incomplete resolution of Issue 9796 for attrOrAssocContextCS
Issue 14591: OCL 2.1 12 Definition Accessibility Semantics
Issue 14592: OCL 2.1 12 Definition Referencability Semantics
Issue 14593: OCL 2.1 12 UML alignment
Issue 14594: OCL 2.1 12 Definition uses LetExp
Issue 14595: OCL 2.1 12 Inconsistencies
Issue 14596: OCL 2.1 12 Essential MOF support
Issue 14597: OCL 2.1 12 Typos
Issue 14598: OCL 2.1 12 Incompleteness
Issue 14599: OCL 2.1 12 Documents
Issue 14639: OCL 2.1 Loop iterators are not ordered and other inconsistencies
Issue 14642: OCL 2.1 13.2 Reflection in OCL meta-models (correction to Issue 1 2951)
Issue 14851: OCL 2.1 Nested Collection Iteration
Issue 14861: OCL 2.1 Inadequate definition of run-time meta-model
Issue 14881: Undefined operation tail()
Issue 14882: Undefined operation tail()
Issue 14883: Undefined operation tail() on p 130
Issue 14884: wrong parameter type for addNamespace operation call
Issue 14885: lookupProperty instead of lookupAttribute
Issue 14886: wrong variable name
Issue 14887: Issue 14593 (UML alignment: Attribute)
Issue 14888: No postcondition for NamedElement::getType() when self.oclIsKindOf(Namespace)
Issue 14918: OCL 2.1 11.2.5 Numeric = and <> operations should compare values rather than objects
Issue 14980: OCL 2.1 11.7.3 OrderedSet addition well-formedness rules
Issue 14981: OCL 2.1 Implicit Conversion to Collection Literal
Issue 14982: OCL 2.1 11.7.3 Missing OrderedSet::flatten overload
Issue 14983: OCL 2.1 11.7 Missing OrderedSet::excluding and including
Issue 14984: OCL 2.1 11.7.3 Missing OrderedSet::-
Issue 14985: OCL 2.1 11.2 Conflicting {OclVoid, OclInvalid}::{oclIsTypeOf, oclIsKindOf, oclAsType} semantics
Issue 14986: OCL 2.1 Feature Overloading Semantics are not defined
Issue 15005: OCL 2.1 8.3.8 OclInvalid::allInstances
Issue 15009: OCL 2.1 11.2.3 Navigated Implicit Conversion to Collection Literal
Issue 15010: Collection::sum is not realisable for empty collection of user defined type
Issue 15013: OCL 2.1 Overload resolution
Issue 15037: OCL 2.1 Section 10 problems
Issue 15072: OCL 2.1 12 Missing specification of initial and derived value constraints
Issue 15092: OCL 2.1 conformsTo definition suggestion
Issue 15134: String.equalsIgnoreCase(String) should result in Boolean
Issue 15156: OCL 2.1 Parametric references
Issue 15175: OCL 2.1 Navigation of opposites
Issue 15218: OCL 2.2 UML-alignment of redefinition
Issue 15219: OCL 2.2 Clarity of qualified path names
Issue 15220: OCL 2.2 7.5.4 Property-qualified association navigation has no concrete or abstract syntax
Issue 15222: OCL 2.2 11.7.1 Why must + be associative for Collection::sum()
Issue 15223: OCL 2.2 11.7.1 Why must + be commutative for Collection::sum()
Issue 15224: OCL 2.2 11.5.3 What is a locale?
Issue 15232: OCL 2.2 Correction to Issue 9796 for isPre
Issue 15233: OCL 2.2 Correction to Issue 9796 for AssociationEndCall
Issue 15234: OCL 2.2 Generalisation of Issue 7341 PathNames
Issue 15235: OCL 2.2 UML Alignment of association names
Issue 15249: Why OCL does not have "super" reference?
Issue 15254: the use of the keyword 'attr'
Issue 15257: OCL 2.2 OclState and oclIsInState
Issue 15258: OCL 2.2 OclMessage types are not statically derivable
Issue 15270: Definition for symmetric difference is wrong
Issue 15357: OCL 2.2 OclState, State, StateExp, StateExpCS, StateValue and StateExpEval
Issue 15367: OCL 2.2 Add endlet to make grammar extensible
Issue 15368: OCL 2.2: Section: 7.5.3 Clarification required for Qualifying association ends with association names
Issue 15387: OCL 2.2: AST is an ASG
Issue 15412: OCL Constraint violation messages
Issue 15420: OCL Enumeration allInstances
Issue 15425: OCL Generics
Issue 15426: OCL Stereotypes
Issue 15527: toLowerCase referred to as toLower (similarly for toUpperCase)
Issue 15528: toLowerCase() declared as returning Integer
Issue 15710: OCL 2.2 forAllAt suggestion
Issue 15712: OCL 2.2 Allow optional let type
Issue 15761: OCL 2.3 Ballotted: Retracting resolutions for Issue 10439/13076
Issue 15780: OCL 2.2 Unlimited and Infinity
Issue 15789: Vagueness about meaning of 0..1 multiplicity in OCL and UML
Issue 15790: OCL 2.2 Missing definition of navigation
Issue 15836: OCL 2.3 Incomplete CollectionRange well-formedness rules
Issue 15838: OCL 2.3 max, min iterations
Issue 15877: Issue on Alignment of next OCL version and references UML 2.4/ MOF 2.4
Issue 15920: OCL 2.3.TupleType semantics and AST
Issue 15922: typo in ptc/2010-11-42 and pas/2010-08-02
Issue 15980: The opertion "collect" is confused with the operation "reject"
Issue 16018: OCL 2.3 : Introduce Lambda functions
Issue 16019: OCL 2.3 Introduce a reserved OclSelf template parameter
Issue 16044: OCL 2.3 Pathname syntax does not allow access to hidden names
Issue 16048: oclIsInState()
Issue 16106: OCL 2.3 - heterogeneous collections cannot be typed
Issue 16121: US PAS Ballot Comment 1
Issue 16122: US PAS Ballot Comment 2 (ocl2-rtf) References
Issue 16123: US PAS Ballot Comment 3 (ocl2-rtf) paragraph 1
Issue 16124: Japan PAS Ballot Comment 1 (ocl2-rtf)
Issue 16125: Issue nnnn: Japan PAS Ballot Comment 2 (ocl2-rtf)
Issue 16126: Issue nnnn: Japan PAS Ballot Comment 3 (ocl2-rtf)
Issue 16127: Issue nnnn: Japan PAS Ballot Comment 4 (ocl2-rtf)
Issue 16128: Issue nnnn: Japan PAS Ballot Comment 5 (ocl2-rtf)
Issue 16129: Issue nnnn: Japan PAS Ballot Comment 6 (ocl2-rtf)
Issue 16130: Issue nnnn: Japan PAS Ballot Comment 7 (ocl2-rtf) Section 7.4.5 table 7.3
Issue 16131: Issue nnnn: Japan PAS Ballot Comment 8 (ocl2-rtf) Section 10.3.2 OperationCallExpEval P127
Issue 16132: Issue nnnn: Japan PAS Ballot Comment 9 (ocl2-rtf) Section 7.4.8
Issue 16133: Issue nnnn: Japan PAS Ballot Comment 10 (ocl2-rtf) Section 7.4.9 list of keywords
Issue 16134: Issue nnnn: Japan PAS Ballot Comment 11 (ocl2-rtf) p 35 line 1
Issue 16135: Issue nnnn: Japan PAS Ballot Comment 12 (ocl2-rtf) Section 8.3.1 Fig 8.2 & FeatureCallExp in p43
Issue 16136: Issue nnnn: Japan PAS Ballot Comment 13 (ocl2-rtf) - Section 8.3.1 OclExpression (l16, p44)
Issue 16137: Japan PAS Ballot Comment 14 (ocl2-rtf) - Section 8.3.2 Fig8.3 & AssociationClassCallExp
Issue 16138: Japan PAS Ballot Comment 15 (ocl2-rtf) Section 8.3.5 Fig8.7 & following class description (p50-p51)
Issue 16139: Japan PAS Ballot Comment 16 (ocl2-rtf) - Section 9.3.3 VariableExpCS
Issue 16140: Japan PAS Ballot Comment 17 (ocl2-rtf) Section 9.3.4 simpleNameCS
Issue 16141: Japan PAS Ballot Comment 18 (ocl2-rtf)
Issue 16142: Issue from PAS Ballot comment for ISO/IEC DIS 19507 Section 9.3.29 OperationCallExpCS
Issue 16143: Japan PAS Ballot Comment 20 Section 9.3.29 OperationCallExpCS
Issue 16144: Japan PAS Ballot Comment 21 (ocl2-rtf) Section 9.3.37 OclMessageExpCS
Issue 16145: Japan PAS Ballot Comment 22 (ocl2-rtf) .4.2 NamedElement 9.4.3 Namespace, 11.2.5(p.135), 12.8.1(p.173)
Issue 16146: Japan PAS Ballot Comment 23 (ocl2-rtf) 10 Semantics Described Using UML
Issue 16147: Japan PAS Ballot Comment 24 (ocl2-rtf) 10.1 Introduction
Issue 16148: Japan PAS Ballot Comment 25 (ocl2-rtf) 10.1 Introduction, 3rd and 4th paragraphs
Issue 16149: Japan PAS Ballot Comment 26 (ocl2-rtf) 10.2 The Values Package, 1st paragraph
Issue 16150: Japan PAS Ballot Comment 27 (ocl2-rtf) Section 10.2.1 Definitions of Concepts for the Values Package
Issue 16151: Japan PAS Ballot Comment 28 (ocl2-rtf) 10.2.3 Additional Operations for the Values Package
Issue 16152: Japan PAS Ballot Comment 29 (ocl2-rtf) 10.2.4 Overview of the Values Package
Issue 16153: Japan PAS Ballot Comment 30 (ocl2-rtf) 10.3 The Evaluations Package, 2nd paragraph
Issue 16154: Japan PAS Ballot Comment 31 (ocl2-rtf): 10.3.1 Definitions of Concepts for the Evaluations Package
Issue 16155: Japan PAS Ballot Comment 32 (ocl2-rtf): 10.3.1 Definitions of Concepts for the Evaluations Package, figure 10.11
Issue 16156: Japan PAS Ballot Comment 33 (ocl2-rtf) 13.3.3 String page 144
Issue 16157: Japan PAS Ballot Comment 34 (ocl2-rtf) 13.3 Diagrams figure 13.8
Issue 16161: OCL 2.3 7.5.3 Missing Association End name problems
Issue 16168: OCL 2.3 Enumeration::allInstances() does not return instances
Issue 16235: Use of the word meta
Issue 16260: on page 153 oclIsInState is used instead of oclInState
Issue 16291: Confusing usage of the "precedes" symbol for generalization hierarchy
Issue 16302: Prime symbol lacking in the explanation preceding the formula
Issue 16303: Unbalanced parenthesis in the formula
Issue 16305: Comparison operators don't exist for Boolean
Issue 16306: The t should be subscripted next to the equal sign
Issue 16348: OCL 2.3 Collecting elemental collections
Issue 16370: OCL parsed OCL string literal
Issue 16487: OCL 2.3 A.2.6 Collection conforms to OclAny contradiction
Issue 16911: OCL 2.3: Message support hard to consume
Issue 16936: need clear specification for how to write OCL that refers to the stereotypes applied to a model within a UML profile
Issue 16998: OCL 2.3 OclInvalid::= is vague
Issue 17220: OCL String::indexOf
Issue 17306: ISO has changed the following normative references to its documents
Issue 17463: Navigation from Association Classes does not conform to UML 2.4.1
Issue 17531: non(not(X)) should be X
Issue 18125: any iteration unsuitable for null Collection content
Issue 18254: Align OCL bodyExpression and UML bodyCondition
Issue 18255: Align OCL with out/inout UML Operation Parameters
Issue 18319: OclAny::oclAsType postcondition implies type change
Issue 18437: Clarify invalid propgation/conformance priority
Issue 18464: Inconsistent inclusion of source in closure results
Issue 18504: Collection::any() violates precondition if the collection is empty
Issue 18515: Collection::min/max accumulator initialized as self.first()
Issue 18516: Introduce a Safe Navigation Operator
Issue 18539: Complete OCL document must be a Package
Issue 18829: Introduce selectByKind and selectByType operations
Issue 1790: Lack of features commonly used in OCL (ocl2-rtf)
Click here for this issue's archive.
Nature: Enhancement
Severity: Significant
Summary: Summary: The current specification for OCL lacks many of the features we commonly
use when doing formal specification of class interfaces, e.g. the ability
to specify the frame condition, the ability to specify postconditions
case-wise, the ability to specify when exceptions are thrown, etc.
To bring OCL closer to the state of the art, I would like to see these
considered as future extensions.
Resolution:
Revised Text: This issue needs to be resolved by the OCL 2.0 Finalization Task Force
Actions taken:
August 10, 1998: received issue
July 22, 1999: Deferred to UML 1.4/2.0.
December 2, 2004: Transferred to OCL 2.0 FTF
Discussion: This issue needs to be resolved by the OCL 2.0 Finalization Task Force. This is an UML 1.x issue transferred to the OCL 2 FTF.
Not all the extra facilities suggested by the text of this issue have been incorporated to the
OCL2 specification. Specific facilities for specifying constraints on class interfaces could
be considered within the context of an RTF.
Disposition: Deferred
Issue 3513: OCL: Usage of qualifiers (ocl2-rtf)
Click here for this issue's archive.
Source: OpenModeling (Mr. Jos Warmer, jos.warmer(at)openmodeling.nl)
Nature: Uncategorized Issue
Severity:
Summary:
Qualifiers, written in brackets after the path name of a feature call,
can express two different things.
- qualifying use: A qualifier is used to give the qualifing value of
a qualified association (chapter 7.5.7).
- navigational use: A qualifier is used to refine the navigation to
association classes. While this navigational use is necessary
only with recursive associations, it is legal for every navigation
to an association class (chapter 7.5.5).
There is no way to distinguish these two sorts of qualifiers. There are
even expressions where both uses of the qualifiers would be necessary at
once, but this problem is restricted to such models that contain a
recursive, qualified association that has an association class.
Example where navigational and qualifing use cannot be distinguished:
There are two classes "Bank" and "Person", with a association between
them qualified by the account number (an Integer). The association end
at the class Person is named "customers".
An additional class "Company" has an attribute "customers" of type
Integer.
Now consider the subexpression "bank.person[customers]" in the context
of Company. "bank" clearly is a navigational expression. But "customers"
could either mean the attribute of Company, since Company is the context
of the expression (that is qualifying use as defined in 7.5.7); or
"customer" could mean the name of the association end (navigational use
as defined in 7.5.5). In the first case, the result type would be
Person, in the second case Set(Person).
Discussion: This is an OCL 1 issue transferred to the OCL 2 FTF. Deferred for timing constraints.
OrderedSet isn't discussed in the section on semantics
Deferred for timing reasons
OCL 2 doesn't really define what a collection is. In essence, a particular UML construct is arbitrarily designated as the OCL collection, and a series of properties are assigned to it This question arises in 2 different ways: - can you sub-class one of the concrete descendents in a UML diagram - by referring to the OCL package - and thereby add functionality to your own collection types - are all parameterised classifiers collections? if you define a parameterised class, how does an OCL user or environment know whether it's a collection or not? perhaps a stereotype should be intrroduced to allow for unambiguous resolution of these issues
Deferred for timing reasons
Consider the operation: Account::withdraw (amount: Money) Suppose a Person object sends the operation, and we want to state that the person has to be the owner of the account. Access to the sender of the message is needed. One might for instance imagine that the concrete syntax defines a keyword sender, and we could then write: context: Account::withdraw (amount: Money) pre: sender = self.owner
Discussion: Asking for an improvement of the language. Better solved in a RTF
Description: Provide a notation for the status of an object
Rationale:
It would be convenient to have a notation for denoting the status of an object. The type of such a status is a tuple. With such a notation it would be possible to compare the status of two objects or to compare the status of an object with a tuple. If not available, comparisons have to be performed on an attribute by attribute basis. Consider e.g.
p, p1 and p2 are Person(s)
p1.all = p2.all -- the 2 persons have same status, i.e.
is nicer and less error-prone than comparing all attributes:
p1.firstName = p2.firstName and p1.name = p2.name and ...
It would also be possible to compare with a tuple:
p.all = Tuple = Tuple {firstName = 'Alfred', name = 'Strohmeier', ...}
Discussion: Asking for an improvement of the language. Better solved in a RTF
Description: At some places, template parameter T appears in operation signatures, e.g., oclAsType(typename:OclType) : T (e.g., Sect. 6.2.1). At other places, this is denoted by "instance of OclType" or <<the return type of the invoked operation>>. It would be more meaningful when these informal return type descriptions are replaced by "OclAny". An additional constraint about the actual return type should be given when necessary.
Deferred for timing reasons
Description: This is not treated consistently throughout the document. As the formal semantics already allows both up- and downcasts, this should also be allowed in Sect. 2.4.6.
Deferred for timing reasons
Author: Stephan Flake (flake@c-lab.de) Description: Some operation specifications are still missing (they are marked by --TBD), e.g., oclAsType(). For this operation, a proposed specification is as follows (provided that OclType is a powertype): 1: context OclAny::oclAsType(typename:OclType) : OclAny 2: post: if OclType.allInstances() 3: ->select(t:OclType | self.oclIsTypeOf(t)) 4: ->exists(t:OclType | typename.conformsTo(t) or t.conformsTo(typename)) then 5: result = self and result.oclIsTypeOf(typename) 6: else 7: result = OclUndefined and result.oclIsTypeOf(OclVoid) 8: endif For a comparison, a complex OCL specification for ENUMERATION TYPE OclType can be found in the paper "OclType - A Type or Metatype?".
Deferred for timing reasons
Author: Stephan Flake (flake@c-lab.de) Description: The OCL Standard Library type system should make use of the notation offered by the official UML specification. In particular, abstract types (like OclAny, Collection(T)), datatypes (Integer, Set(T)), and enumeration types (OclState) can be denoted in italics and stereotyped, respectively. An ellipsis can be used to indicate that further types are imported from a referred UML user model. Moreover, OrderedSet(T) is missing in the OCL Standard Library Type type system.
Deferred for timing reasons
Author: Thomas Baar (thomas.baar@epfl.ch) Description: Exception from strict evaluation for IMPLIES is incomplete and contradicts set-theoretical semantics Rationale: On page 2-10 only one exception from strict evaluation for IMPLIES is given: False IMPLIES x == True However, based on the official semantics of IMPLIES given on page A-12 also x IMPLIES True == True
Deferred for timing reasons
Author: Thomas Baar (thomas.baar@epfl.ch)
Description: Exception of strict evaluation should be extended to forAll, exists
Rationale: Suppose r(o1) = undef, r(o2) = false What is value of Exp = {o1, o2}->forAll(x| r(x)) ? One could argue, because of strict evaluation, the value of Exp is undef. However, this would contradict the semantics of forAll als 'iterated and' given on page A.28. Similarily, for exists.
A note should be added on page 2-10 on evalution of expressions based on iterate.
Deferred for timing reasons
Author: Thomas Baar (thomas.baar@epfl.ch) Description: Strict evaluation for queries yields to contradictions in specifications Rationale: Queries can be specified in two ways, as invariants and in form of pre/post conditions. Suppose we specify query q(arg) as post: if (arg.oclIsUndefined()) then result = true else result = false endfi Having this, the following invariant should evaluate always to true: self.q(arg) = true or self.q(arg) = false. However, the invariant evaluates to undef once arg evaluates to undef thanks to strict evaluation. There is a misconception of strict evaluation when it comes to queries. The idea of queries is to have user-defined functions on classes. Why should the user be restricted only to such function which return undef once one of its arguments is undef? Using OCL, the user can even specify queries which can handle undefined arguments (e.g. see post specification of q(arg) ). Obviously, the post specification for q(arg) makes sense. The rule of strict evaluations for queries should be weakened to the case where the owner of the query (the object upon the query was called) is undefined.
Deferred for timing reasons
Author: Thomas Baar (thomas.baar@epfl.ch) Description: contradiction for evaluation of navigation expression Rationale: Suppose to have two classes A, B and an association with multiplicity 0..1 on B between them. The invariant context A inv: self.b = self.b is evaluated for an instance of A not having an associated instance of B to i) true, when the expression self.b has the type Set(B), because self.b is evaluated to emptyset and emptyset = emptyset is evaluated to true ii) undef, when the expression self.b has the type B, because self.b is evaluated to undef and undef = undef is evaluated to undef thanks to strict evaluation of '=' This is a contradiction since the expression self.b can be both of type set(B) and B! The examples also shows, that x = x is not a tautology unlike in almost all other logics including classical predicates logic. This is especially confusing because OCL claims to be based on classical predical logic!
Deferred for timing reasons
Author: Sten Loecher (Sten.Loecher@inf.tu-dresden.de) Description: OCL specification contains incomplete/ missing well-formedness rules Rationale: The following list contains the concerned classes of the OCL metamodel and provides information about the required changes to the OCL specification. AssociationClassCallExp: missing rule to describe the type AssociationEndCallExp: missing rule to describe the type AttributeCallExp: multiplicity, order, and unambiguousness must be considered CollectionLiteralExp: OrderedSetType must be added IteratorExp: well-formedness rules needed for iterator operations one, any, collectNested, and sortedBy OclMessageExp: missing rule to describe the type OclExpressionWithTypeArgExp: missing rule to describe the type OperationCallExp: missing rule to describe the type
Deferred for timing reasons
Author: Hubert Baumeister (baumeist@informatik.uni-muenchen.de), Rolf Hennicker (hennicke@informatik.uni-muenchen.de), Alexander Knapp (knapp@informatik.uni-muenchen.de) Description: Change Definition A.34 to allow the precondition to be weakened Rationale: It is commonly accepted that a program S satisfying an operation specification may weaken the precondition. This corresponds to Bertrand Meyer's view of software specifications as contracts between clients of a program and program provider. This is in accordance with the explanation following Def. A.34: "In other words, the program S accepts each environment satisfying the precondition as input and produces an environment that satisfies the postcondition." This sentence admits the possibility that S may be defined for environments not satisfying the precondition. However Def. A.34 requires S to be defined exactly on the environments for which the precondition holds. Therefore, we propose to replace Def. A.34 by: DEFINITION A.34 (SATISFACTION OF OPERATION SPECIFICATIONS) An operation specification with pre- and postconditions is satisfied by a program S in the sense of total correctness if the computation of S is a function fS such that the restriction of fS to the domain of R is a total function fS|_dom(R): dom(R) -> im(R) and graph(fS|_dom(R)) \subseteq R. Comment by Daniel Jackson (dnj@mit.edu) i'd be very wary of linking any particular notion of refinement to a modelling language. different circumstances might need different notions, and there's no reason that the language should be tied to one. i wonder, for example, if you've considered the difference between preconditions as disclaimers and preconditions as firing conditions. even for the standard notion of preconditions as disclaimers, your particular definition seems too narrow to me. requiring the program to be a function will rule out many reasonable implementations that are non-deterministic -- hash tables, for example.
Deferred for timing reasons
Author: Achim D. Brucker (brucker@inf.ethz.ch), Burkhart Wolff (wolff@informatik.uni-freiburg.de) Description: Change Definition A.34 to allow the precondition to be weakened Rationale: It is commonly accepted that a program S satisfying an operation specification may weaken the precondition. This corresponds to Bertrand Meyer's view of software specifications as contracts between clients of a program and program provider. This is in accordance with the explanation following Def. A.34: "In other words, the program S accepts each environment satisfying the precondition as input and produces an environment that satisfies the postcondition." This sentence admits the possibility that S may be defined for environments not satisfying the precondition. However Def. A.34 requires S to be defined exactly on the environments for which the precondition holds. Therefore, we propose to replace Def. A.34 by: DEFINITION A.34 (SATISFACTION OF OPERATION SPECIFICATIONS) An operation specification with pre- and postconditions is satisfied by a specification S if the restriction of S to the domain of R (denoted S|_dom(R)) is included in R, i.e. S|_dom(R) \subseteq R. This is equivalent to: \forall x, y. x:dom(R) & (x,y):S --> (x,y):R. In particular, S may be a program, i.e. a computation function in the sense of total correctness.
Deferred for timing reasons
Author: Hubert Baumeister (baumeist@informatik.uni-muenchen.de), Rolf Hennicker (hennicke@informatik.uni-muenchen.de), Alexander Knapp (knapp@informatik.uni-muenchen.de) Description: Change Definition A.34 to allow the precondition to be weakened Rationale: It is commonly accepted that a program S satisfying an operation specification may weaken the precondition. This corresponds to Bertrand Meyer's view of software specifications as contracts between clients of a program and program provider. This is in accordance with the explanation following Def. A.34: "In other words, the program S accepts each environment satisfying the precondition as input and produces an environment that satisfies the postcondition." This sentence admits the possibility that S may be defined for environments not satisfying the precondition. However Def. A.34 requires S to be defined exactly on the environments for which the precondition holds. Therefore, we propose to replace Def. A.34 by: DEFINITION A.34 (SATISFACTION OF OPERATION SPECIFICATIONS) An operation specification with pre- and postconditions is satisfied by a program S in the sense of total correctness if the computation of S is a function fS such that the restriction of fS to the domain of R is a total function fS|_dom(R): dom(R) -> im(R) and graph(fS|_dom(R)) \subseteq R.
Deferred for timing reasons
Author: Hubert Baumeister (baumeist@informatik.uni-muenchen.de), Rolf Hennicker (hennicke@informatik.uni-muenchen.de), Alexander Knapp (knapp@informatik.uni-muenchen.de) Description: Add select/reject/collectNested to Collection Rationale: The definition of any on Collection (page 6-16f.) uses select on Collection. However, select is not defined for Collection. Similarly, the definition of collect on Collection (page 6-17) uses collectNested on Collection, which is not defined on Collection. We therefore propose to add select and collectNested (and possibly reject) to Collection.
Deferred for timing reasons
Author: Hubert Baumeister (baumeist@informatik.uni-muenchen.de),
Rolf Hennicker (hennicke@informatik.uni-muenchen.de),
Alexander Knapp (knapp@informatik.uni-muenchen.de)
Description: Clarify the semantics of forAll
Rationale:
According to the informal explanation (page 6-16) the following Expression Set { 1 }->forAll(x | x/0 < 0) would evaluate to false. However, according to the OCL definition it evaluates to undefined. Thus we propose to omit "otherwise, result is false" in the informal explanation.
Deferred for timing reasons
Author: Hubert Baumeister (baumeist@informatik.uni-muenchen.de), Rolf Hennicker (hennicke@informatik.uni-muenchen.de), Alexander Knapp (knapp@informatik.uni-muenchen.de) Description: Clarify the UML semantics of IfExpEval Rationale: The specification on page 5-21 of the evaluation of if_then_else omits the case when the condition evaluates to undefined. Thus the sentence should read: "The result value of an if expression is the result of the thenExpression if the condition is true, it is the result of the elseExpression if the condition is false, else it is undefined."
Deferred for timing reasons
Author: Herman Balsters (h.balsters@bdk.rug.nl) Description: OCL 2.0 is not as expressive as SQL (as opposed to common belief) and needs to be extended to this end Rationale: In my paper "Modeling Database Views with Derived Classes in the UML/OCL-framework" of this years UML conference (see proc. pp. 295-309) I investigated the issue of expressibility of OCL 2.0 w.r.t. to the query langauge SQL. I have demonstrated in that paper that OCL 2.0 is not as expressive as SQL (as opposed to common belief), and that OCL needs an additional "tuplejoin" operator to achieve the desired result. If this issue cannot be dealt with in this phase, I propose it be retained and examined at the next stage.
This is a request to improve the language. Should better be solved in a RTF.
Description: The OCL 2.0 specification should be behaviour-oriented and not implementation-oriented (see section 4.3). Rationale: The idea of using OCL to describe itself is interesting from the research point of view, but unfortunately OCL is not a suitable metalanguage to define the meaning of other textual languages. I think that the best thing to do is to define a virtual machine and to describe the behaviour of the virtual machine using natural language. This technique was successfully used for languages like C, C++, Java, C#, and Prolog. I see no reasons why such a technique would fail for OCL. After all, OCL is less complex than modern programming language like C++, Java, or C#. A proper description and implementation of the OCL virtual machine will create all the conditions to have a language that is platform/tool independent.
This is a request to improve language definition. Should better be solved in a RTF.
Description: The specification does not describes the syntax of integer, real or string literals. Also, it does not contain the description of the allowed set of values. Rationale: Specifying the syntax and the semantics of basic types will increase the portability of OCL programs. In order to describe the semantics of basic types, the specification should describe the set of values, the allowed operations, and the standard used to perform the allowed operations. I think that it will be also useful to allow different types of integers and reals, like Integer(16), Integer(32), Integer(64), Real(32), and Real(64), in order to optimize the computational process.
This is a request to improve language definition and extend its expresiveness. Should better be solved in a RTF.
Description: OCL 2.0 comments start with -- Rationale: This means that an expression like --4 cannot be interpreted as an arithmetic expression without inserting at least one space between the first - and the second -. I think that this problem can be resolved if the OCL comments start with // instead of --.
Deferred for timing reasons
Description: The grammar presented in 4.3, which is in my opinion a semantic grammar, is not suitable to describe the syntax of OCL. Rationale: Introducing non-terminals like primary-expression, selection-expression, and operation-call-expression will solve all the problems and will reduce the number of ambiguities. Hence, the grammar contained in the specification will suffer less changes in order to be used to design and implement a deterministic parser. This is the case of the specifications for C, C++, Java, C#, and Prolog.
Decision deferred to an RTF. It would imply a lot of changes.
Description: Some of the elements presented in 3.3.10 (e.g. EnumLiteralExp, children of ModelPropertyCallExp) cannot be constructed without using semantic information (e.g. the type of the expression determines if a name denotes an attribute, an association end, or an operation). Rationale: Usually a parser produces an AST. The semantic analyser augments the AST by computing for each node from AST the values of the attached attributes. The semantic analysis also checks if there are static semantics errors and reports them. Using other terms in the AST and hence other non-terminals in 4.5 (e.g. dot-selection-expression, arrow-selection-expression, call-expression etc.) will solve this problem.
Decision deferred to an RTF. It would imply a lot of changes.
Description: Syntax for the above constructions is extremely ambiguous and it might involve backtracking.
Rationale: According to OCL specification
* self.f(x, y)
* Set{1,2,3}->select(x, y| x+y = 3)
* Set{1,2,3,4,5,6}->iterate(x; acc:Integer=0 | acc + x)
describe an operation call, an iterator, and an iterate expression.
In order to make the distinction between an iterator call and an operation call we need in this case a three token lookahead, starting from x. The problem gets even more complicated if we consider that an argument for an operation call can be an expression.
In order to solve this problem, which is a potential source of problems for the implementation (error-prone, inefficiency aso), we think that these OCL constructs should contain some extra syntax markers. There are several choices:
* change the comma marker from iterator calls to something else, maybe a semicolon
* add a syntax marker to an iterator name
* do not allow the default types
The above choices will allow to a deterministic parser to deal with the enumerated problems more efficiently. I do not agree with textual language in which variables are given a default type according to the context in which they are used, especially if these languages are design for industrial use. The same problems were in previous versions of C standard, which allowed implicit type int for variables in constructions like
x;
Now, the latest C standard states that variables with default type are not allowed.
Deferred for timing reasons
Description: One issue we have discovered is about expressions of the form: expr.oclAsTypeOf( Type ) The OCL standard does not support Type as a collection or tuple type. Rationale: We think that the syntax should be extended to support collection and tuple types. This will make the language more symmetric and increase the expressiveness of the language.
This issue asks for an improvement of the language. Should better be solved in a RTF.
Description: The OCL specification does not allow operations like = or <> to be performed tuple values. It also forbids operations like oclIsKindOf and oclIsTypeOf on collections. Rationale: Add such operations to tuple and collection types signatures directly or by inheritance, will make the language more powerfull (e.g. a set of dogs can be casted to a set of animals).
This issue asks for an improvement of the language. Should better be solved in a RTF.
Description: The specification (in the standard) of the Environment class is missing a few things that are used or referred to elsewhere in the standard; some are missing altogether and some are missing from the class diagram: The association from an environment to its parent. The operations lookupImplicitSourceForOperation, lookupPathName, addEnvironment Rationale: We show a more complete specification below. We also add a convenience method addVariableDeclaration; although not necessary as addElement can be used to add a VariableDeclaration, this operation avoids the need to construct the VariableDeclaration before adding it to the environment. The specification of the Environment operations uses various methods on the bridge classes; we have added these operations to the classes, as shown in the previous section about the bridge classes.
Deferred for timing reasons
The index seems incomplete and leaves out interesting items (e.g., the definition of standard library functions).
Deferred for timing reasons
The compliance points strategies mentioned in the OCL 2.0 spec are different from the UML 2.0 infra, super and MOF 2.0 specs. We need to align the OCL spec on this
Deferred for timing reasons
think the operation allInstances() is under-specified in the current version of the OCL 2.0 specification. It does not seem to be clear whether OclUndefined is included in the returned set or not: According to the 1.5 specification of allInstances(), the instances of all subtypes are included. OclVoid is a subtype of all other types, thus OclUndefined would be a part of the set. I assume this is not the intended behaviour. For example, the "all names must be different" expression example would always yield OclUndefined or false, but never true.
Deferred for timing reasons
Typo in an example with TupleType Section 7.5.15: In the example constraint, expression attr: Statistics : Set(TupleType(& This must be Tuple only, according to the concrete syntax.
Deferred for timing reasons
Suggestion: Use special characters to denote a call to oclIsKindOf and oclIsTypeOf. For instance, use '#ActionState' instead of 'oclIsKindOf(ActionState)' and use '##ActionState' instead of 'oclIsTypeOf(ActionState)'
This is a request to improve the language. Better solved in a RTF.
Suggestion: Use brackets as an alternate option to denote a call to the "select"
function. Notation: mylist[iterator | condition]
Example:
self.ownedElement[#Class and name="MyClass"]
-- #Class is a shorthand for oclIsKindOf(MyClass)
equivalent to :
self.ownedElement->select(oclIsKindOf(Class) and name="MyClass")
This is a request to improve the language. Better solved in a RTF.
Suggestion: Use brackets with a "!" prefixing mark
Example:
self.ownedElement[! #Class and name="MyClass"]
means
self.ownedElement->select(oclIsKindOf(Class) and name="MyClass")->first()
This is a request to improve the language. Better solved in a RTF.
Suggestion: Define an "alt" collection function, with a specific notation, as in:
mylist->alt(iterator | condition? thenExp, elseExp)
The expression elseExp is not evaluated if condition returns true
This is a request to improve the language. Better solved in a RTF.
Suggestion: Define a "switch" collection function, with a sepecific notation, as in:
mylist->switch( iterator | cond1 ? exp1, cond2 ? exp2, …, else ? expN)
The expressions cond2 is not evaluated if cond1 returns true and so on.
This is a request to improve the language. Better solved in a RTF.
Suggestion: Define a "switch" collection function, with a sepecific notation, as in:
mylist->switch( iterator | cond1 ? exp1, cond2 ? exp2, …, else ? expN)
The expressions cond2 is not evaluated if cond1 returns true and so on.
This is a request to improve the language. Better solved in a RTF.
This is to avoid using the unreadable and unfriendly "let … in …" notation.
Suggestion: Use the result of a variable initialization as in:
if (let c = self.address)="" then "UNKNOWN"
else if c.includes(Set{"Irak","Afganifsthan"}) then "DANGEROUS"
else "OK" endif endif endif …
This is a request to improve the language. Better solved in a RTF.
Use a DOT instead of an ARROW is this situation.
myinstance.anycollectionfunction() equivalent to
Set{myinstance}->anycollectionfunction(…)->first()
This is a request to improve the language. Better solved in a RTF.
Example1: if list.select(...) then … equivalent to
if list.select(...)->notEmpty() then …
Example2: if item then … equivalent to
if item<>OCLUndefined then ...
This is a request to improve the language. Better solved in a RTF.
Make optional the qualification of enumeration values. Example: Be able to write 'self.aggregationKind="Composite" ' as an alternative to 'self.aggregationKind=AggregationKind::Composite'.
This is a request to improve the language. Better solved in a RTF.
When a name conflicts happen, it should be possible to resolve by qualifying the
names.
This is a request to improve the language. Better solved in a RTF.
Allow defining standard library functions (including iteration operators) that have a variable number of parameters.
This is a request to improve the language. Better solved in a RTF.
Allow defining default values for parameters in operations
This is a request to improve the language. Better solved in a RTF.
Suggestion: Use the STAR character. Quotes could be used in case of blanks
characters in stereotype names.
Example: self.ownedElement.select(kindOf(Class) and *EJBEntity)
returns all the classes stereotyped by the EJBEntity stereotype or a derived
stereotype.
Example: self.ownedElement.select(kindOf(Class) and **EJBEntity)
returns all the classes stereotyped by the EJBEntity stereotype.
This is a request to improve the language. Better solved in a RTF.
Example: self.comment = "My name is %s" % self.firstname
This is a request to improve the language. Better solved in a RTF.
Suggestions:
- Make type spec of internal fields optional.
- Make field name in tuples optional (using positional access)
This is a request to improve the language. Better solved in a RTF.
1. Add an import statement to OCL files (with package - endpackage block). At the moment one can only reference a type from another package using its complete path name. It would be more convenient to be able to import a package or other model element in the OCL files and use the simple name of a type in the OCL expressions.
Deferred for timing reasons
Add a concrete syntax to allow OCL users to add additional IteratorExp’s. People using OCL have the need to define their own iterators and should be able to do so in a standardized way.
This is a request to improve the language. Better solved in a RTF.
We would like to be able to rewrite well-formedness rules like: context IfExp inv: self.condition.type.oclIsKindOf(Primitive) and self.condition.type.name = ’Boolean’ as context IfExp inv: self.condition.type.oclIsKindOf(Primitive) and This is more clear that the first expression where the matching is done by name. Because the metamodel resides on a level higher than the standard library, we need a way to get access to the standard library elements. One solution is to define a package ’StandardLibrary’ that contains a Classifier called ’StdLib’, that holds the following attributes: • + Collection: CollectionType; • + Set: SetType; • + OrderedSet: OrderedSetType; • + Sequence: SequenceType; • + Bag: BagType; • + String: Primitive; • + OclMessage: OclMessageType; • + OclVoid : VoidType; Other solutions might be possible, but the above has been proven to work in the Octopus tool.
Discussion: This issue will be deferred. There is a question of representing formally the standard library as an ordinary UML package, which is not going to be solved for OCL 2.1 release. Disposition: Deferred
def: allReceptions() : Set(Reception) = self.allFeatures->select(f | f.oclIsKindOf(Reception)) ==> should be: context Classifier def: allReceptions() : Set(UML14::CommonBehavior::Reception) = self.feature->select(f | f.oclIsKindOf(UML14::CommonBehavior::Reception))->collect( f | f.asReception() ) where asReception() is defined as operation to Feature: + asReception() : Reception
def: hasMatchingSignature(paramTypes: Sequence(Classifier)) : Boolean =
-- check that operation op has a signature that matches the given parameter lists
let sigParamTypes: Sequence(Classifier) = self.allAttributes.type in
(
( sigParamTypes->size() = paramTypes->size() ) and
( Set{1..paramTypes->size()}->forAll ( i |
paramTypes->at (i).conformsTo (sigParamTypes->at (i))
)
)
)
==> ’self.allAttributes.type’ should be ’self.Parameter.type->asSequence()’34. context Parameter::asAttribute(): Attribute pre: -- none post: result.name = self.name post: result.type = self.type post: result.multiplicity = 1 post: result.targetscope = ScopeKind::instance post: result.ownerscope = ScopeKind::instance post: result.ordering = OrderingKind::unordered post: result.visibility = VisibilityKind::private post: result.stereotype.name = ’OclHelper’ ==> ’result.multiplicity = 1’ should be ’result.multiplicity = Multiplicity::one’
post: result = if statemachine->notEmpty() then stateMachine else -- must be part of a composite state state.container.getStateMachine() endif context Transition::getStateMachine() : StateMachine post: result = if statemachine->notEmpty() then stateMachine else -- state is not empty state.getStateMachine() endif ==> in both expressions ’statemachine’ should be stateMachine
post: result.constraint.bodyExpression = self.initExpression ==> should be: post: result.constraint.bodyExpression.oclAsType(OCLContextualClassifier::Expre ssionInOcl).bodyExpression = self.initExpression
37. -- [2] The parameters of the referredOperation become attributes of the instance -- of OclMessageType context OclMessageType inv: referredOperation->size() = 1 implies self.feature = referredOperation.Parameter->collect(p | p.asAttribute().oclAsType(Feature) ).asOrderedSet() ==> should be: context OclMessageType inv: referredOperation->size() = 1 implies self.feature = referredOperation.Parameter->collect(p | p.asAttribute() ).asOrderedSet()
37. -- [2] The parameters of the referredOperation become attributes of the instance -- of OclMessageType context OclMessageType inv: referredOperation->size() = 1 implies self.feature = referredOperation.Parameter->collect(p | p.asAttribute().oclAsType(Feature) ).asOrderedSet() ==> should be: context OclMessageType inv: referredOperation->size() = 1 implies self.feature = referredOperation.Parameter->collect(p | p.asAttribute() ).asOrderedSet()
38. -- [3] An additional attribute refParams lists all parameters of the referred -- operation except the return and out parameter(s). context OperationCallExp def: refParams: Sequence(Parameter) = referredOperation.parameters- >select (p | p.kind <> ParameterDirectionKind::return or p.kind <> ParameterDirectionKind::out) ==> ’parameters’ should be ’Parameter’
context TupleLiteralExpPart inv: attribute.type = value.type ==> should be removed, class does not exist
Errors found in UML-based-semantics
1. context LocalSnapshot
def: let allPredecessors() : Sequence(LocalSnapshot) =
if pred->notEmpty then
pred->union(pred.allPredecessors())
else
Sequence {}
endif
def: let allSuccessors() : Sequence(LocalSnapshot) =
if succ->notEmpty then
succ->union(succ.allSuccessors())
else
Sequence {}
==> remove ’let’ from both expressions, add ’endif’ after the second-- that have been in the output queue of the object between the last
-- postcondition snapshot and its associated precondition snapshot.
context OclExpEval::outgoingMessages() : Sequence( OclMessageValue )
pre: -- none
post:
let end: LocalSnapshot =
history->last().allPredecessors()->select( isPost = true )->first() in
let start: LocalSnapshot = end.Pre in
let inBetween: Sequence( LocalSnapshot ) = start.allSuccessors()->excluding( end.allSuccessors())->including(
start ) in
result = inBetween.outputQ->iterate (
-- creating a sequence with all elements present once
m : oclMessageValue;
res: Sequence( OclMessageValue ) = Sequence{}
| if not res->includes( m )
then res->append( m )
else res
endif )
==> ’pre’ should be ’Pre’resultValue = if condition then thenExpression.resultValue else elseExpression.resultValue ==> missing ’endif’
4. -- [2] All sub evaluations (in the sequence bodyEvals) have a different -- environment. The first sub evaluation will start with an environment in which -- all iterator variables are bound to the first element of the source. Note that -- this is an arbitrary choice, one could easily well start with the last element -- of the source, or any other combination. context LoopExpEval inv: let bindings: Sequence( NameValueBindings ) = iterators->collect( i | NameValueBinding( i.varName, source->asSequence()->first() ) in bodyEvals->at(1).environment = self.environment->addAll( bindings ) ==> missing closing bracket before ’in’
5. -- [3] All sub evaluations (in the sequence bodyEvals) have a different
-- environment. The environment is the same environment as the one from the
-- previous bodyEval, where the iterator variable or variables are bound to the
-- subsequent elements of the source.
context LoopExpEval
inv:
let SS: Integer = source.value->size()
in if iterators->size() = 1 then
Sequence{2..SS}->forAll( i: Integer |
bodyEvals->at(i).environment = bodyEvals->at(i-1).environment
->replace( NameValueBinding( iterators->at(1).varName,
source.value->asSequence()->at(i) )))
else -- iterators->size() = 2
Sequence{2..SS*SS}->forAll( i: Integer |
bodyEvals->at(i).environment = bodyEvals->at(i-1).environment
->replace( NameValueBinding( iterators->at(1).varName,
source->asSequence()->at(i.div(SS) + 1) ))
->replace( NameValueBinding( iterators->at(2).varName,
source.value->asSequence()->at(i.mod(SS)) )) ) endif
==> two closing brackets before ’endif’ should be removed6. -- [2] The result value of an ocl message expression is the sequence of the -- outgoing messages of the ‘self’ object that matches the expression. Note that -- this may result in an empty sequence when the expression does not match to any -- of the outgoing messages. context OclMessageExpEval inv: resultValue = environment.getValueOf( ’self’ ).outgoingMessages->select( m | m.target = target.resultValue and m.name = self.name and self.arguments->forAll( expArg: OclMessageArgEval | not expArg.resultValue.oclIsUndefined() implies m.arguments->exists( messArg | messArg.value = expArg.value )) ==> add one closing bracket after expression
7. -- [4] The isSent attribute of the resulting ocl message value is true only if -- the message value is in the outgoing messages of the ‘self’ object. context OclMessageExpEval inv: if resultValue.oclIsUndefined() resultValue.isSent = false else resultValue.isSent = true endif ==> add ’then’ after ’oclIsUndefined()’
8. -- [1] An ocl message argument evaluation has either an ocl expression -- evaluation, or an unspecified value expression evaluation, not both. context OclMessageArgEval inv: expression->size() = 1 implies unspecified->size() = 0 expression->size() = 0 implies unspecified->size() = 1 ==> add ’and’ between both expression parts
9. -- [2] The result value of an association class call expression evaluation that
-- has qualifiers, is determined according to the following rule. The ‘normal’
-- determination of result value is already given in section 5.3.7
-- ("Well-formedness Rules of the Evaluations package").
==> missing ’context .... inv:’
==> missing brackets and comma; the whole expression should be:
let
-- the attributes that are the formal qualifiers. Because and
association
-- class has two or
-- more association ends, we must select the qualifiers from the other
end(s),
-- not from -- the source of this expression. We allow only 2-ary associations.
formalQualifiers : Sequence(Attribute) =
self.model.referredAssociationClass.connection->any( c |
c <> self.navigationSource).qualifier.asSequence() ,
-- the attributes of the class at the qualified end. Here we already
assume
-- that an
-- AssociationEnd will be owned by a Classifier, as will most likely be
the
-- case in the
-- UML 2.0 Infrastructure.
objectAttributes: Sequence(Attribute) =
self.model.referredAssociationClass.connection->any( c |
c <> self.navigationSource).owner.feature->select( f |
f.isOclType( Attribute ))->asSequence() ,
-- the rolename of the qualified association end
qualifiedEnd: String = self.model.referredAssociationClass.connection-
>any( c
|
c <> self.navigationSource).name ,
-- the values for the qualifiers given in the ocl expression
qualifierValues : Sequence( Value ) = self.qualifiers->asSequence() ,
-- the objects from which a subset must be selected through the
qualifiers
normalResult =
source.resultValue.getCurrentValueOf(referredAssociationClass.name)
in
-- if name of attribute of object at qualified end equals name of formal
-- qualifier then
-- if value of attribute of object at qualified end equals the value
given in
-- the exp
-- then select this object and put it in the resultValue of this
expression.
qualifiers->size <> 0 implies
normalResult->select( obj |
Sequence{1..formalQualifiers->size()}->forAll( i |
objectAttributes->at(i).name = formalQualifiers->at(i).name and
obj.qualifiedEnd.getCurrentValueOf( objectAttributes->at(i).name ) =
qualifiersValues->at(i) ))10. -- [2] The result value of an association end call expression evaluation that has
-- qualifiers, is determined according to the following rule. The ‘normal’
-- determination of result value is already given in section 5.3.7
-- ("Well-formedness Rules of the Evaluations package").
==> add ’inv’, remove ’implies’, add comma. It should be:
-- [2] The result value of an association end call expression evaluation that has
-- qualifiers, is determined according to the following rule. The ‘normal’
-- determination of result value is already given in section 5.3.7
-- ("Well-formedness Rules of the Evaluations package").
inv: let
-- the attributes that are the formal qualifiers
formalQualifiers : Sequence(Attribute) =
self.model.referredAssociationEnd.qualifier ,
-- the attributes of the class at the qualified end
objectAttributes: Sequence(Attribute) =
(if self.resultValue.model.isOclKind( Collection )
then self.resultValue.model.oclAsType( Collection ).elementType->
collect( feature->asOclType( Attribute ) )
else self.resultValue.model->collect( feature->asOclType( Attribute ) )
endif).asSequence() ,
-- the values for the qualifiers given in the ocl expression
qualifierValues : Sequence( Value ) = self.qualifiers.asSequence() ,
-- the objects from which a subset must be selected through the
qualifiers
normalResult =
source.resultValue.getCurrentValueOf(referredAssociationEnd.name)
in
-- if name of attribute of object at qualified end equals name of formal
-- qualifier then
-- if value of attribute of object at qualified end equals the value
given in
-- the exp
-- then select this object and put it in the resultValue of this
expression.
qualifiers->size <> 0 implies
normalResult->select( obj |
Sequence{1..formalQualifiers->size()}->forAll( i |
objectAttributes->at(i).name = formalQualifiers->at(i).name and
obj.getCurrentValueOf( objectAttributes->at(i).name ) =
qualifiersValues->at(i) ))11. -- [1] The condition evaluation corresponds with the condition of the expression, -- and likewise for the thenExpression and the else Expression. context IfExpEval inv: condition.model = model.condition thenExpression.model = model.thenExpression elseExpression.model = model.elseExpression ==> missing ’inv:’ twice
12. -- [1] The model of the result of an iterate expression evaluation is equal to -- the model of the result of the associated IterateExp. context IterateExpEval inv: result.model = model.result ) ==> remove last bracket
13. -- [4] The arguments of an ocl message expression evaluation must correspond to
-- the formal input parameters of the operation, or the attributes of the signal
-- indicated in the ocl message expression.
context OclMessageExpEval
inv: model.calledOperation->size() = 1 implies
Sequence{1.. arguments->size()} ->forAll( i | arguments->at(i).variable->size() = 1 implies
model.calledOperation.operation.parameter->
select( kind = ParameterDirectionKind::In )->at(i).name =
arguments->at(i).variable
and
arguments->at(i).expression->size() = 1 implies
model.calledOperation.operation.parameter->
select( kind = ParameterDirectionKind::In )at(i).type =
arguments->at(i).expression.model
==> missing ’->’ before ’at’, and missing final closing bracketSequence{1.. arguments->size()} ->forAll( i |
arguments->at(i).variable->size() = 1 implies
model.sentSignal.signal.feature->select(
arguments->at(i).variable )->notEmpty()
and
arguments->at(i).expression->size() = 1 implies
model.sentSignal.signal.feature.oclAsType(StructuralFeature).type =
arguments->at(i).expression.model
==> missing final closing bracket15. -- [5] The arguments of the return message of an ocl message expression
-- evaluation must correspond to the names given by the formal output parameters,
-- and the result type of the operation indicated in the ocl message expression.
-- Note that the Parameter type is defined in the UML 1.4 foundation package.
context OclMessageExpEval
inv: let returnArguments: Sequence{ NameValueBindings ) =
resultValue.returnMessage.arguments ,
formalParameters: Sequence{ Parameter } =
==> ’{’ should be ’(’ (twice), and ’}’ should be ’)’16. -- [1] Only one of the attributes isPost and isPre may be true at the same time. context LocalSnapshot inv: isPost implies isPre = false inv: ispre implies isPost = false ==> second invariant: ’ispre’ should be ’isPre’
17. -- [1] All elements belonging to a sequence value have unique index numbers. inv: self.element->isUnique(e : Element | e.indexNr) ==> missing context statement: context SequenceTypeValue, ==> ’element’ should be ’elements’
18. -- [1] All elements belonging to a set value have unique values. inv: self.element->isUnique(e : Element | e.value) ==> missing context statement: context SetTypeValue ==> ’element’ should be ’elements’
19. -- [1] All elements belonging to a tuple value have unique names.inv: self.elements->isUnique(e : Element | e.name) ==> missing context statement: context TupleValue ==> ’Element’ should be ’NameValueBinding’
20. -- [1] The history of an object is ordered. The first element does not have a -- predecessor, the last does not have a successor. context ObjectValue inv: history->oclIsTypeOf( Sequence(LocalSnapShot) ) inv: history->last().succ->size = 0 inv: history->first().Pre->size = 0 ==> should be: context ObjectValue inv: history->oclIsTypeOf( StandardLibrary::StdLib.Sequence(LocalSnapShot) ) inv: history->last().succ->size = 0 inv: history->first().Pre->size = 0
21. -- [1] The history of an object is ordered. The first element does not have a -- predecessor, the last does not have a successor. context ObjectValue inv: history->oclIsTypeOf( StandardLibrary::StdLib.Sequence(LocalSnapShot) ) inv: history->last().succ->size = 0 inv: history->first().Pre->size = 0 ==> ’size’ should be ’size()’ (twice)
22. -- [1] The operation allPredecessors returns the collection of all snapshots
-- before a snapshot, allSuccessors returns the collection of all snapshots after
-- a snapshot.
context LocalSnapshot
def: allPredecessors() : Sequence(LocalSnapshot) =
if pred->notEmpty then
pred->union(pred.allPredecessors())
else
Sequence {}
endif
def: allSuccessors() : Sequence(LocalSnapshot) =
if succ->notEmpty then
succ->union(succ.allSuccessors())
else
Sequence {}
endif
==> ’notEmpty’ should be ’notEmpty()’ (twice)23. -- [1] The elements in a tuple value must have a type that conforms to the type -- of the corresponding tuple parts. context TupleValue inv: elements->forAll( elem | let correspondingPart: Attribute = self.model.allAttributes()->select( part | part.name = elem.name ) in elem.value.model.conformsTo( correspondingPart.type ) ) ==> ’Attribute’ should be ’UML14::Core::Attribute’ ==> ’select’ should be ’any’
24. -- [1] The result value of an association class call expression is the value
-- bound to the name of the association class to which it refers. Note that the
-- determination of the result value when qualifiers are present is specified in
-- section 5.4.3 ("Well-formedness rules for the AS-Domain-Mapping.exp-eval
-- Package"). The operation getCurrentValueOf is an operation defined on
-- ObjectValue in section 5.2.3 ("Additional operations for the Values Package").
context AssociationClassCallExpEval inv:
qualifiers->size = 0 implies
resultValue =
source.resultValue.getCurrentValueOf(referredAssociationClass.name)
==> ’size’ should be ’size()’
==> ’resultValue’ should be ’resultValue->oclAsType(OCLDomain::Values::ObjectValue)’25. -- [1] The result value of an association end call expression is the value bound
-- to the name of the association end to which it refers. Note that the
-- determination of the result value when qualifiers are present is specified in
-- section 5.4.3 ("Well-formedness rules for the AS-Domain-Mapping.exp-eval
-- Package").
context AssociationEndCallExpEval inv:
qualifiers->size = 0 implies
resultValue =
source.resultValue.getCurrentValueOf(referredAssociationEnd.name)
==> ’size’ should be ’size()’
==> ’resultValue’ should be ’resultValue->oclAsType(OCLDomain::Values::ObjectValue)’26. -- [1] The result value of an association class call expression is the value
-- bound to the name of the association class to which it refers. Note that the
-- determination of the result value when qualifiers are present is specified in
-- section 5.4.3 ("Well-formedness rules for the AS-Domain-Mapping.exp-eval
-- Package"). The operation getCurrentValueOf is an operation defined on
-- ObjectValue in section 5.2.3 ("Additional operations for the Values Package").
context AssociationClassCallExpEval inv:
qualifiers->size() = 0 implies
resultValue =
source.resultValue.getCurrentValueOf(referredAssociationClass.name)
==> ’name’ should be ’value’27. -- [1] The result value of an association end call expression is the value bound
-- to the name of the association end to which it refers. Note that the
-- determination of the result value when qualifiers are present is specified in -- section 5.4.3 ("Well-formedness rules for the AS-Domain-Mapping.exp-eval
-- Package").
context AssociationEndCallExpEval inv:
qualifiers->size() = 0 implies
resultValue =
source.resultValue.getCurrentValueOf(referredAssociationEnd.name)
==> ’name’ should be ’value’28. -- [1] The result value of an association end call expression is the value bound
-- to the name of the association end to which it refers. Note that the
-- determination of the result value when qualifiers are present is specified in
-- section 5.4.3 ("Well-formedness rules for the AS-Domain-Mapping.exp-eval
-- Package").
context AssociationEndCallExpEval inv:
qualifiers->size() = 0 implies
resultValue =
source.resultValue.getCurrentValueOf(referredAssociationEnd.name)
==> ’name’ should be ’value’29. -- [1] The result value of an attribute call expression is the value bound to the -- name of the attribute to which it refers. context AttributeCallExpEval inv: resultValue = if source.resultValue->isOclType( OCLDomain::Values::ObjectValue) then source.resultValue->asOclType( ObjectValue ) .getCurrentValueOf(referredAttribute.name) else -- must be a tuple value source.resultValue->asOclType( TupleValue ) .getValueOf(referredAttribute.name) endif ==> ’isOclType’ should be ’oclIsTypeOf’ ==> ’asOclType’ should be ’oclAsType’ ==> ’name’ should be ’value’ (twice)
30. -- [1] The value of a collection item is the result value of its item expression. -- The environment of this item expression is equal to the environment of the -- collection item evaluation. context CollectionItemEval inv: element = item.resultValue inv: item.environment = self.environment ==> an association should be added between CollectionLiteralPartEval and EvalEnvironment
31. -- [2] The result value of a collection literal expression evaluation is a -- collection literal value, or one of its subtypes. context CollectionLiteralExpEval inv: resultValue.isOclKind( OCLDomain::Values::CollectionValue ) ==> ’isOclKind’ should be ’oclIsKindOf’
32. -- [3] The number of elements in the result value is equal to the number of -- elements in the collection literal parts, taking into account that a -- collection range can result in many elements. context CollectionLiteralExpEval inv: resultValue.elements->size() = parts->collect( element )->size()->sum() ==> ’resultValue’ should be ’resultValue->oclAsType(OCLDomain::Values::CollectionValue)’
33. -- [1] The value of a collection range is the range of integer numbers between -- the result value of its first expression and its last expression. context CollectionRangeEval inv: element.isOclType( Sequence(Integer) ) and element = getRange( first->asOclType(Integer), last->asOclType(Integer) ) ==> ’asOclType’ should be ’oclAsType’ (twice)
34. -- [1] The result value of an if expression is the result of the thenExpression -- if the condition is true, else it is the result of the elseExpression. context IfExpEval inv: resultValue = if condition then thenExpression.resultValue else elseExpression.resultValue endif ==> ’condition’ should be ’condition.resultValue->oclAsType(Boolean) = true’
35. -- [4] The elements in the result value are the elements in the
-- literal parts, taking into account that a collection range can result
-- elements.
context CollectionLiteralExpEval inv:
let allElements : Bag(Value) = parts->collect(
Sequence{1..allElements->size()}->forAll( i:
resultValue.elements->at(i).name = ’’ and
resultValue.elements->at(i).value = allElements->
self.kind = CollectionKind::Sequence implies
resultValue.elements->at(i).indexNr = i )
==> should be
context CollectionLiteralExpEval inv:
let allElements : Sequence(Value) = parts->collect(
in
Sequence{1..allElements->size()}->forAll( i:
resultValue->oclAsType(OCLDomain::Values::CollectionValue).
>any(x | x.indexNr = i).value
= allElements->at(i) and
self.kind = CollectionKind::Sequence implies
resultValue.elements->at(i).indexNr = i )36. -- [1] The value of a collection range is the range of integer numbers between -- the result value of its first expression and its last expression. context CollectionRangeEval inv: element.isOclType( Sequence(Integer) ) and element = getRange( first->oclAsType(Integer), last->oclAsType(Integer) ==> ’isOclType’ should be ’oclIsTypeOf’
37. -- [1] All sub evaluations have a different environment. The first sub evaluation -- will start with an environment in which all iterator variables are bound to -- the first element of the source, plus the result variable which is bound to -- the init expression of the variable declaration in which it is defined. context IterateExpEval inv: let bindings: Sequence( NameValueBindings ) = iterators->collect( i | NameValueBinding( i.varName, source->asSequence()->first() )) in bodyEvals->at(1).environment = self.environment->addAll( bindings ) ->add( NameValueBinding( result.name, result.initExp.resultValue )) ==> ’NameValueBindings’ should be ’NameValueBinding’
38. -- [1] All sub evaluations have a different environment. The first sub evaluation -- will start with an environment in which all iterator variables are bound to -- the first element of the source, plus the result variable which is bound to -- the init expression of the variable declaration in which it is defined. context IterateExpEval inv: let bindings: Sequence( NameValueBinding ) = iterators->collect( i | NameValueBinding( i.varName, source->asSequence()->first() )) in bodyEvals->at(1).environment = self.environment->addAll( bindings ) ->add( NameValueBinding( result.name, result.initExp.resultValue )) ==> ’varName’ should be ’value’
"[1] Married people are of age >= 18 context Person inv: self.wife->notEmpty() implies self.wife.age >= 18 and self.husband->notEmpty() implies self.husband.age >= 18" has to be "[1] Married people are of age >= 18 context Person inv: (self.wife->notEmpty() implies self.wife.age >= 18) and (self.husband->notEmpty() implies self.husband.age >= 18)" because of the precedence rules same mistake in http://www.omg.org/docs/ptc/03-10-14.pdf, "UML 2.0 OCL Final Adopted specification", chapter 7.5.3, page 18.
I been using rational rose and bold for delphi in some projects. This have worked very well for me. When adding constraints to my models i have some times whished that there whas a way to do this on different levels. Eg. error-constraints (if persisted the object would be a dirty data) , warning-constraints these can be broken but there is high probability that the object is ill formed from the system user perspective (example a new customer whith no billing adress) and finally a hint-contraint that when broken indicates that the object containes strange data (example a new customer object with the same phone number as a existing customer) My own solution to this have been to add contraints of the first type to the model. This have enabeld me to create generic code dealing with if the user should be allowed to save a object or not. The other types of constraints have been added as coments as a way to make the model as complete as possibel. The implementation of checking and dealing with these constraints later in the project have ben solved in a mutch less generic and cumbersom way. I thin´k that if the standard included a way to specify different levels of ocl statements in the model this would benefit the model driven way to make software
I'm not certain if I should report this issue to the OCL group or to the UML Superstructure group, but... the Basic Types listed in OCL do not agree with the Primitive Types listed in the UML Superstucture. OCL lists "Real" as a primitive (basic type), UML Superstructure does not, instead listing UnlimitedNatural as a primitive type. Shouldn't the two agree?
Typo - In the 2nd para, 3rd sent., the "t" of "type conformance error" is not italicized as is the rest of the phrase. Table 4 does not address the UML 2.0 (pct/04-10-02)use of UnlimitedNaturals as a type. This type probably Conforms to/Is a subtype of Real since UnlimitedNaturals are integers equal to or greater than 0.
Typo - 2nd line of para under Missing AssociationEnd names, add a "s" to "tarting." Combining Properties example [2] does not show/express any combined properties; it just expresses the size property of the set employee.
In last paragraph on page 20 change the word "dotted" to "dashed" and in Fig. 3 change the dashed line denoting Dependency as an AssociationClass to a dotted line. This will agree with Fig. 1 example of an association class as well as the Notation described for AssociationClass on pg 45 of UML Superstructure (ptc/04-10-02).
Although the definition of oclAsType may be obvious, this is an appropriate sub-section to place a paragraph describing oclAsType. It is the only prrdefined property on All Objects that is not defined in this section.
The example of Set {1,2,5,88} is more of an example of an ordered set as is Set {'apple','orange','strawberry'}. The example of a Sequence {1,3,45,2,3} does not exhibit any apparent order although a Sequence is defined as an ordered Bag. It might be wise to alter these examples to: Set {1,88,5,2}, Set ['strawberry','apple','orange'} and Sequence {1,2,3,3,45}
The example using Bike and Car as two separate subtypes of Transport does not make any mention of Set(Car), Bag(car), or Collection(Car). Either delete reference to Car as a separate subtype of Transport or add some comments about a collection of some sort of Car conforming (and not conforming) to some other collection. I may be confused, but the statement "Note that Set(Bicycle) does not conform to Bag(Bicycle)" does not make a lot of sense to me. Wouldn't it be better to say that "Set(Bicycle) does not conform to Bag(car)?"
In the 2nd paragraph, shange "The value of the reject operation..." to "The value of the collect operation..."
Typos - 1st line, 3rd para under The Types Package, delete "and" between "CollectionType" and "its." - 2nd sent., 3rd para under The Types Package, change "taken in account" to "taken into account." - 2nd sent., under OclMessageType, change "Like to the collection" to "Like collection." - Last sent. under TupleType, delete the word "to." In sub-section CollectionType, there is no mention of the fourth concrete subclass which is shown in fig. 5 as OrderedSetType. Add this to the list of concrete subclasses or change fig. 5 to indicate that OrderedSetType is not a subclass of CollectionType (possibly a subclass of SetType?). Sub-section 7.5.11 also indicates only three different collection types. In addition, CollectionTypes [1] on pg 36 ("--all instances of SetType, SequenceType, BagType conform to a CollectionType if the elementTypes conform") makes no mention of OrderedSetType.
Fig. 6 does not agree with fig. 12 (pg 60) in the number of subclasses that inherit from OCLExpression. Fig. 6 nor the subsequene notation have any mention of LetExp. Please add this to Chapter 8.
Association arguments under OclMessageExp uses "SignalArgs" as the classifier name but fig. 9 and later in this section the name is given as OclMessageArg. Change SignalArgs to OclMessageArgs. In the notation for OclMessageArg, it is stated that "OclMessageArg has either a specified or an unspecified value." Would these then be attributes to OclMessageArg? UnspecifiedValueExp shows an association of type:Classifier in fig. 9. Add this to the notation or delete the association from the fig.
CollectionItem shows an association - item:OclExpression - in the fig. 10. CollectionLiteralExp shows an association in fig. 10 - parts:CollectionLiteralPart. This is an ordered association. CollectionRange shows two associations in fig. 10 - first:OclExpression and last:OclExpression. UML 2.0 (ptc/04-10-02) doesn't recognize Real as a primitive type but does use UnlimitedNatural. Need to add UnlimitedNatural as a primitive type. The attribute symbol for PrimitiveLiteralExp is not shown in fig. 10. TuppleLiteralExp shows an association in fig. 10 - tuplePart:VariableDeclaration. The statement that TupleLiteralExp "contains a name and a value for each part of the tuple type" implies attributes but these are not shown in fig. 10 or listed as attributes in the notation. Add a notation for VariableDeclaration.
The association parentOperation nor the class OperationCallExp of OCLExpression is not shown in either fig. 6 or 9 but in fig. 7. Change the reference to fig. 7 page 44 in the association definition for parentOperation under OclExpression. Two additional associations vor VariableDeclaration are shown in fig. 6--baseExp:IterateExp and loopExpr:LoopExp. Add these to the notation or delete these associations from fig. 6.
The def:lookupAssociationClass(name: String) has the same phrase after the arrow as the def:;ppli[AssociationEnd(name: String). I'm not familiar with OCL but this doesn't seem right to me. The context Operation and the context Signal each contain two equal sign separated only by a comment. I don't think this is correct either.
In fig. 13, the operations lookupLocal() and Lookup() appear twice with the same name. Is this proper? Grammer - Delete the words "for" and "as" in the last line on page 62. Bulletted paragraph beginning "If neither of the above..." implies only two choices so remove third bullet at top of page 63 and move line out flush with margin of bullet beginning "If not, check self..."
There is inconsistency in the spelling of "CollectionLiteralPartsCS" sometimes using the "s" after "Part" and sometimes capitalizing the "S" after "Part". This becomes even more confusing when the next production is "CollectionLiteralPartCS" - notice no"s" following "Part".
Typo - Fig. 14, "Ocl-AbstractSyntax" should be "OCL-AbstractSyntax" to agree with naming format shown in other two packages
The last paragraph on pg 94 that describes fig. 15 does not agree in names with the value names shown in fig. 15. StaticValue equates to the daya values the paragraph mentions and OclVoidValue apparently equates to "UndefinedValue." Since "UndefinedValue" and "OclVoidValue" both have the format of a class name this could lead to confusion. OclVoidValue, as later defined, is an undefined value so please change "UndefinedValue" in the open paragraph of this section.
The statement "An element represents a single component of a tuple value" is not directly diagrammed in fig. 16. Should it be?
NameValueBinding show an attribute and an association in fig. 16 that are not mentioned in the description/definition as are other attributes and associations in other descriptions/definitions.
Typos - Change "ispre" to "isPre" and reword [2] to "...postcondition snapshot does it have an associated..."
[1] still uses the term "UndefinedValue" when I think it should be "OclVoidValue" to agree with fig. 15 and name of term being defined previously. Typo - delete the lase "endif" that is flush with the margin.
Fig. 20 does not diagram the class OclEvaluation. Should it?
For the association bodyEvals the name of the associated class does not agree with the class name in fig. 20
The name of the association in fig. 20 is "referredVariable." Please correct either the text or the figure
The association definition says that the referredAssociationEnd is the name of the AssociationEnd to which the corresponding NavigationCallExp is a reference. Shouldn't the be to which the corresponding AssociationEndCallExp is a reference?
The subtype name on fig. 21 is OperationCallExpEval which I believe is correct. Please change the title of this sub-section
Add the association "qualifiers" to OclExpEval as is shown in fig. 21
The association variable is not diagrammed in fig. 23. Please add it to the fig
Fig. 23 shows an additional association of unspecified as the UnspecifiedValueExpEval that represents the unspecified evaluation. If this is supposed to represent the association variable, the description and the figure do not agree in any way.
Fig. 23 shows an attribute for OclMessageExpEval and that the association arguments is ordered. Neither of these are mentioned in the text
None of the attributes or associations diagrammed are mentioned in the text. If there is no intention of mentioning them in their respective expression evaluations make a note of this in the opening description of the section. TupleliteralExpPartEval is not diagrammed in fig. 24 but VariableDeclEval is diagrammed and not mentioned in the text. Please correct.
There is no caption for the figure on pg. 122. Although fig. 27 appears on pg 121 with its caption and fig. 28 is on pg. 132, use of the word "figures" on pg. 120 indicates that the fig. on pg 122 is a separate figure. Please clarify with a caption for the fig. on pg 122.
To be consistent with other sub-sections, use [1] before the OCL well-formedness rule
Last line on page is a sentence fragment
If /(r:Real):Real then shouldn't a constraint be added to the definition that the value of self divided by r as long as r<>0? A number divided by 0 is not a real number.
What is the difference in meaning between the definitions of or(b:Boolean): Boolean and xor(b:Boolean): Boolean? or(b:Boolean): Boolean says True if either self or b is true which implies "but not both" which is the ending phrase of the definition of xor(b:Boolean): Boolean.
The restriction to sort the OrderedSet with the lowest value coming first is very restrictive. Sometimes it is beneficial to sort in reverse order. Think about a statement that would allow a > sort order.
Typo - pg 151 change "The standard iterator expression" to "The standard iterator expressions." The reject expression for both Bag and Sequence have "source->select(iterator | not body) on the left side of the equals symbol. Shouldn't the word "iterate" be used instead of "select?" The sortedBy expression is very restrictive if the sort order must always have the lowest value first. A statement that a sort order could be by a > value would be nice.
General comments: OCL primitive types do not agree with UML primitive types. Multiplicity symbology for "infinite" is different. UML uses "*" whereas OCL uses "n." Capitalize the word "Boolean" as it is named for the 19th Century mathematicial George Boole. In most places it is capitalized but there are several places where it is not. I hope my comments have not been too annoying. Please consider everything I know about OCL I have learned from reading this document so if my comments don't make a lot of sense, then possibly clarification in the document may be needed.
1) The specification does not describes the syntax of integer, real or string literals. The specification does not describes the syntax of integer, real or string literals. Specifying the syntax and the semantics of basic types will increase the portability of OCL programs
OCL allows defining additional operations which are conceptually treated as operations of the metaclasses. However, except for special cases where the "additional operation" is effectively defined in the original metamodel, these "additional operations" are extensions to the original metamodel. No indication in the specification is given on what extension mechanism is used. This makes the exchange of OCL specifications through XMI incomplete and ill-formed.
I refer to Section 8.3.9 of the final Adopted Version of the OCL 2.0 Spec, the two additional operations on the OclExpression. "withAtPre" and "withAsSet". I am wondering where the two referred operations "atPre" and "asSet" (not restricted to collections) are "predefined"(?).
The 'asSet' operation is predefined for collections but the 'atPre' is not at all a predefined operation. However fixing this issue implies re-synchronizing chapter 9 (concrete syntax) with chapter 8 (abstract syntax) which requires extra time. Deferred
It is not entirely clear from the OCL 2.0 specification whether the allInstances operation returns instances of subclasses of the designated type. In other words, it isn't 100% clear whether t.allInstances( ) returns instances of subclasses of t. Recommendation: The best solution would be to have two operations, one which returns instances of subclasses and one which does not. A second-best solution would be to make it clear that allInstances returns instances of subclasses. In this case, an OCL programmer could use the oclIsTypeOf( ) operation as a filter to write a derived operation that does not return instances of subclasses. If allInstances does not return instances of subclasses, it would not be nearly as straightforward to write a derived operation that does return instances of subclasses.
To obtain all instances of a class that are not instances of some specializing class, it is sufficient to be able to select them fron the allInstances set: t.allInstances()->select(oclIsTypeOf(t)).
The spec ptc/03-10-14 lists navigating across non navigable associations as a compliance point. However, all text describing the rules for doing so have been removed from this version. The rules need to be defined more clearly in the OCL syntax.
The following rules for navigation using non-navigable associations extend the text in sections 7.5.4 Navigation to Association Classes, and sections 7.5.5 Navigation from Association classes,
When a non-navigable association is between different classes, following the association to an opposite end class is specified by:
("self" | <class name>) "." <association class name>["[" < opposite role name> "]"]"." <role name>
Note the optional component is redundant, but is allowed, but not recommended.
When a non-navigable association is between the same classes, following the association to an opposite end class is specified by:
("self" | <class name>) "." <association class name>"[" < opposite role name> "]." <role name>
Non navigability of an association end has no impact in the property navigation notation, so we do not feel the need for introducing an explicit text. Disposition: Closed, no change
I refer to Section 8.3.9 of the final Adopted Version of the OCL 2.0 Spec, the two additional operations on the OclExpression. "withAtPre" and "withAsSet". I am wondering where the two referred operations "atPre" and "asSet" (not restricted to collections) are "predefined"(?).
A simple duplication of issue 8902 Disposition: See Issue 8902 for disposition
The OCL 2.0 spec is inconsistent on whether class operations, including predefined operations, should be accessed using '.' or '::' notation. E.g. should it be Person.allInstances() or Person::allInstances() The spec uses Person.allInstances() in the text, but the concrete syntax specifies '::'. It seems that most tools have adopted the '.' notation used in the examples which is also backwards compatible with previous versions of OCL. There has also been some adoption of the '::' notation, for example in Warmer and Kleppe's OCL book, see: http://www.klasse.nl/english/boeken/ocl-book-errata.pdf Note: This issue was originally pointed out by Anthony Shuttleworth of Paranor. Proposed solution: The '.' notation is widely used and backwards compatible with previous versions of OCL. It should not be made invalid in OCL 2.0. It may be appropriate to also support the '::' notation if this has been widely adopted.
Accessing static features using ‘::’ is unambiguously an invocation of a static property and not a property of the Classifier metaclass. OCL’s TypeExp is, effectively, a Classifier literal expression, so that the ‘.’ operator should invoke features of the Classifier metaclass. An example of this is allInstances(), which is inherited from OclAny (which Classifier implicitly specializes) or allFeatures() (from UML).
Are two packages allowed to mutually import each other? I can't find anything preventing this in the spec, but was wondering if it causes some kind of "infinite" import loop.
This is a UML issue that has is already solved. In principle an implementation can avoid infinite import loop even in presence of cycles. Disposition: Close, no change
I only recently joined the OCL rtf at the request of David Frankel (who
is now with SAP) - I have not seen any activity on this mailing list as
yet so I hope this is an appropriate forum to raise this question.
First let me introduce myself - I am lead for a proof-of-concept project
investigating the use of OCL to express integrity constraints on models.
Hopefully I will get a chance next year to attend a f2f meeting so that
I can meet you all.
On to my specific question: we have noticed that some time between OCL
1.1 and UML 1.4 "oclType", as a predefined feature, was removed. (I have
been unable to find any versions of OCL between 1.1 and UML 1.4).
I thought it would be best if we found out whether this removal was
intentional before officially raising it as an issue. The reason is that
we find a) this is a useful reflective feature to have and 2) it is
still used in some current OMG specifications (note that it is used
inconsistently).
e.g.:
- UML2 Infrastructure - (ptc/03-09-15) pg.89:
Classifier::maySpecializeType(c : Classifier) : Boolean;
maySpecializeType = self.oclIsKindOf(c.oclType)
- Meta Object Facility (MOF) 2.0 Core Specification (ptc/03-10-04) -
pg.68
ExtentImpl::addObject(ObjectInstance o, String suppliedId
[0..1]): String
pre: not(self.entry.identifier includes suppliedId)
post: oclIsNew(e) and oclType(e) = IdentifierEntry and
e.object = o and
self.entry includes e
self.entry->select(ex | ex.identifier = e.identifier)->size() =
1 -- the new id is unique and
(suppliedId <> null implies e.identifier = suppliedId)
It appears that oclType was removed because MOF reflection provides the Element::getMetaClass() to obtain the metaclass of a model element. However, this is insufficient for three reasons: 1.Element in MOF is defined at the metamodeling level. OCL constraints in a model are defined at the modeling level and, therefore, constrain the run-time instances of the classes described by the model. These Classes do not inherit Element. 2.The UML Infrastructure does not merge the Reflection capability from MOF. Therefore, the UML metamodel cannot use Element::getMetaClass() in its own OCL constraints (to constrain UML models). 3.The result of Element::getMetaClass() is Class, which is the metatype for metaclasses, not Type. Thus, it would not be applicable to the values of DataTypes. For these reasons, OCL must define its own reflection capability for models (not metamodels). This is consistent with the oclIsKindOf and oclAsType. Also, it seems more natural to define it as an operation as MOF does with getMetaClass() than as an attribute
Section 7.5.3 of ptc/05-06-06 starts with the following: "Starting from a specific object, we can navigate an association on the class diagram to refer to other objects and their properties. To do so, we navigate the association by using the opposite association-end:" However, unlike in UML 1.x, in UML2 this may well be ambiguous (since names of ends owned by Associations only have to be unique within the Association and not within the context of the Class). OCL should therefore explicitly allow qualification using the name of the Association itself as well as the end name (it is not clear whether this is currently allowed as part of the syntax for 'associationendname' so there should be an example to show this. This would make it consistent with the metamodel which allows reference to specific Properties. For example we could have associations A1 and A2 both linking classes C1 and C2 and each with ends c1 and c2 owned by the respective associations. OCL does not then address the fact that aC1.c2 is ambiguous - unlike the case with unnamed ends it does not even say that it may be ambiguous and is hence disallowed. However rather than disallowing the navigation OCL should have a syntax to allow qualification by the association name For example aC1.A1::c2 The same could be used for missing association end names: If A1 had unnamed ends then one could use aC1.A1::C2
The proposed qualification by the association name solves the issue in a consistent way. Notice however that in the case of missing association end names, OCL already have a convention which is to use the class name with the first letter lowerized.
In section 8.3.2 of ptc/05-06-06 PropertyCall is shown as a subclass of NavigationCallExp -this seems the wrong way round: NavigationCallExp seems to be a specialization for when the Property is an AssociationEnd. To illustrate this, the description of NavigationCallExp starts with the following, which would not apply if the Property in question were an ownedAttribute of a class: "A NavigationCallExp is a reference to an AssociationEnd or an AssociationClass defined in a UML model."
NavigationCallExp must be the supertype of PropertyCallExp for two reasons: 1.In the reverse case, AssociationClassCallExp would inherit the referredProperty attribute from PropertyCallExp. However, this would not be applicable because association-class navigation is not a property invocation. 2.A Property can function like an association end even in the absence of an explicit Association, simply by having a Class as its type. Also, in contradiction of the submitter’s assertion, association ends commonly are ownedAttributes of Classes The text does reference the UML 1.x AssociationEnd metaclass, which is incorrect
We consider a Sequence of instances of a class called 'Example'. This class has an integer attribute called 'ex'. If we have a method specification written as follow: pre: datalist->isTypeOf(Sequence(Example)) post: Sequence{1..datalist->size()}->forAll(n | datalist->at(n).ex = datalist@pre->at(n).ex) I not sure if is correct writes the same specification with the next sentences: pre: datalist->isTypeOf(Sequence(Example)) post: datalist->forAll(n | n.ex = n@pre.ex) The generic questions is: What does the '@pre' operator mean when it is applied to iterators variables (as 'n' in the example)? Is correct the @pre use in this cases? I hope you understand my dude and sorry any gramatical error because my written english is very poor.
The usage of @pre is only applicable to the features of model classifiers, as indicated in Section 7.5.14 (Previous Values in Postconditions) which identifies both attributes and operations as “properties”, and in Definition A.31 (Syntax of Expressions in Postconditions) in which it is stated that @pre may be applied to operations that depend on system state, such as operation calls and attribute navigation on objects. The Abstract Syntax Model is ambiguous in the model of expressions involving @pre. It only defines an additional operation on the OclExpression metaclass that serves as a factory for OperationCallExps that represent invocations of an atPre() operation. This atPre() operation in not defined, neither in the Standard Library nor as an additional operation, itself. This proposed resolution is clearer, more concise, and simpler. It also does not pre-suppose a mechanism by which evaluation of @pre expressions may be accomplished
The abstract syntax defines the classes NullLiteralExp and InvalidLiteralExp but the concrete syntax does not define these literal values. --- I would like to return 'null' in certain OCL expressions for example: context Person::foo() : Person body: if age > 10 then self else null endif Currenty the only correct way to do this is not very straight forward: context Person::foo() : Person body: if age > 10 then self else OclVoid.allInstances()->any() endif The same is true for the singelton instance of OclUndefined.
The spec states: ---- The operation oclInState(s) results in true if the object is in the state s. Values for s are the names of the states in the statemachine(s) attached to the Classifier of object. ---- How does this relate to the uml metamodell? A BehavioredClassifier may have several ownedBehaviors but only one(!) of those behaviors may be the behavior of the classifier himself. The other behaviors may be specifications for behavioral features of the classifier. ---- Clarification: Possible states for the operation oclInState(s) are all states of the statemachine that defines the classifier's behavior (property 'classifierBehavior' of the 'BehavioredClassifier' metaclass).
The clarification suggested by the author of the issue solves the problem.
Using "def" I would like to specify static (classifier scoped) properties and operations.
Notation for calling static operations was available but there was no notation their definition (except when the operation is taken from a UML diagram). This is somehow inconsistent. The solution is to add the "static" prefix before the "def" keyword to define static helpers.
Hi, I'm reading through the latest OCL spec to get up to date before applying for a System Analyst job, I saw a possible minor issue in the list of the OCL keywords. Indeed, having read it so far, I would add the following ones but pls let me know if there is a reason why it wouldnt apply: body, derive, init, and self
'self' is the name of a pre-defined variable and is not a keyword. However body, derive and 'init' are keywords that are used in some parts of section 7 and explicitly defined in section 9 (concrete service). So menyioning of these three keywords is missing in 7.4.9.
Hello I recently wrote a comment about the OCL keyword list to amend if I'm correct. As I continue reading through the specification, I found that in "7.8 Resolving Properties", 2 inv contraints are specified and mentionned to have a different meaning. I specified the difference between the 2 below and was wondering if you wanted maybe to check that 1. it was correct and 2. add it to the specs so people can make sure they understand well where the difference stands, despite it is fairly straightforward from the explanation in this chapter. >From your specs: context Person inv: employer->forAll(employee->exists(p | p.lastName = name)) inv: employer->forAll(employee->exists(self.lastName = name)) Given explanation on the difference: Invariant constraint 1: Specifies that in the Company a person works for, there exists for all the employees of the company (Person instances) the value of their attribute lastName matching the value of the attibute Name in an instance of Company Invariant constraint 2: Specifies that in the Company a person works for, there exists for all the employees of the company (Person instances) the value of the person's attribute lastName matching the value of the attibute Name in an instance of Company iterator The difference is that in the invariant 1, we specify that the value of the lastName attribute for all the Person instances employed by a company must be found in an instance of the Company by matching the name attribute's value, whereas in the invariant 2, we specify that the value in the lastName attribute of a Person p working for a Company must match the value of the name's attribute in one of the Company's set of Person/employees, thus its related instance. I hope it makes sense and look forward hearing about your comments.
The difference given by the author of the two variants is good. However we prefer not to extend section 7.8 with this detailed explanation since the focus here is on syntax subtilities and a reader can make himself the exercise of interpreting correctly the two invariants. Disposition: Close, No Change.
"The forAll operation has an extended variant in which more than one iterator is used. Both iterators..." Which is it "more than one" (two, three...) or "Both" (two) ?
"The OCL specification puts no restriction on visibility." I don't think this statement is true. For example, self is bound to the instance in context. There is a whole prior section on scoping.
In fact the text refers to the visibility concept related to UML properties (public, private, protected …). Visibility is not used here in its general meaning. This can be clarified to avoid any confusion.
There is a left-paren in rule [A] . Rules [D] and [E] are identical.
The parentheses in alternative [A] are balanced; they delineate the optional variable-declaration list (including the ‘|’ bar) and, as a nested optional construct, the second variable. The [D] and [E] alternatives should be identical in form; this reflects the fundamental similarity of the structure of association-end navigation and assocation-class navigation, even down to the qualifiers list. Disposition: Closed, no change
"The type OclVoid is a type that conforms to all other types. It has one single instance called null which corresponds with the UML Null Literal value specification. " This text could be clearer. What does "called null" mean? Is it saying that the name "null" refers to this instance? A suggested rewrite: "It has one instance, identified by 'null.' The instance null corresponds to the UML Null Literal."
The statements in the discussion of both OclVoid to OclInvalid that they conform to all other types is problematic, because that implies that they conform to one another, resulting in a generalization cycle. They should neither of them conform to the other, as both are intended as undefined values of ordinary expressions in degenerate situations.
11.2.4 (OclInvalid) - similar criticism as 11.2.3 (issue 10433)
The statements in the discussion of both OclVoid to OclInvalid that they conform to all other types is problematic, because that implies that they conform to one another, resulting in a generalization cycle. They should neither of them conform to the other, as both are intended as undefined values of ordinary expressions in degenerate situations.
"When new iterator expressions are added to the standard library, there mapping to existing constructs should be fully defines. - What does that mean? It sounds like an admonition to spec writers. - also "defined" not "defines" - also "their" not "there"
It means that someone defining a new iterator should provide the semantics using the technique used in Section 11.9 for the pre-defined iterators. This could be made clearer by explicitly referring to this Section 11.9. BTW Section 11.8.1 duplicates somehow the sentence that is above in the preamble of 11.8 "Whenever a new iterator is added to the library, the mapping to the iterate expression must be defined. If this is not done, the semantics of the new iterator are undefined." This duplication leaves the impression of a copy/paste problem. To avoid this we remove the sentence in the preamble and adjust the sentence in 11.8.1.
oclIsTypeOf(typespec : OclType) : Boolean "Evaluates to true if the self is of the type identifid by typespec.." oclIsKindOf(typespec : OclType) : Boolean "Evaluates to true if the self conforms to the type identified by typespec" >From those descriptions I cannot distinguish these two. Isn't a dog "of the type" mammal" and wouldn't a dog "conform to the type" mammal? (Subtypes always conform to the supertype). I suspect that you intend that one of these evaluates to TRUE if and only if self is of type typespec *and not also of a subtype of typespec* . You might say just that.
Note that this resolution depends on the proposal for resolution of Issue 6532 that discards the OclType metatype in favour of Classifier.
oclAsType(typespec : OclType) : T
"Evaluates to self, where self is of the type identified by typespec.
post: (result = self) and result.oclIsTypeOf(typeName)
(BTW , that ought to be "typespec" not typeName).
This description is inadequate. The text in 7.4.6 describes the important
condition on the use of this method ("An object can only be re-typed to one
of its subtypes.") But chapter 7 is informative, not normative. Even with
that text moved into 11.2.5, additional discussion is required. For example,
referring to the properties that are only defined on the subtype, what would
the value of those properties be, once the object is re-typed?
Note that this resolution depends on the proposal for resolution of Issue 6532 that discards the OclType metatype in favour of Classifier.
null "conforms to all other types." Thus I suppose null->isEmpty() and null->notEmpty() are defined. What do these methods evaluate to when applied to null? This should be discussed in this section.
Similarly as when we write self.manager->isEmpty() this is a short writing of self.manager.asSet()->isEmpty(), the meaning of null->isEmpty() could be Set{}->isEmpty(), except that the decision on what kind of literal collection it is (set, bag, ordered set, sequence). By convention for null we decide the implicit casting is Bag{}.
Apart this syntax convention, null
We add a note to clarify this point.
Recommendation: The specification would be better were it to additionally describe a practical grammar useful to tool implementors and persons trying to understand what constitutes legal OCL syntax. Of course, we all know that even practical OCL grammars are permissive of strings that aren't meaningful (for example, 7->isEmpty() is typically legal) but more can be done than is expressed by the current description. I am not suggesting that you replace the current method of description, but that you add (perhaps only as an informative, non-normative appendix) a conventional grammar. The spec, after all, is supposed to serve the purposes of implementors. There are published papers describing practical grammars for OCL, or I can supply you with one, if you'd like. PS By "practical grammar" I mean one that limits the look-ahead to a finite number wherever possible. It is, of course, the use of OclExpression in the RHS of so many productions that runs up against the infinite look-ahead problem, and makes the published grammar unusable by implementors.
Good suggestion. Deferred since such grammar need to be defined carefully. The OCL 2.1 specification provides only a partial and ambiguous grammar some of whose problems may be resolved by application of the disambiguating rules. Provision of a complete unambiguous grammar requires the clear semantics for reserved words that may be found in Issue 14583. Resolution of reserved word semantics highlights a number of other problems. The Essential OCL and Complete OCL grammars presented here therefore assume adoption of the following resolutions: Issue 12953: Collection Literals with explicit element types Issue 14196: Integration of UnlimitedNaturalLiteralExpCS Issue 14236: Integration of InvalidLiteralExpCS and NullLiteralExpCS Issue 14237: CollectionRangeCS separator is DotDot. Issue 14357: Token Concrete Syntaxes: String Literals may be concatenated. Issue 14582: Precedence and Associativity. Issue 14583: Reserved Words. false, invalid, null, self, true are reserved words. Boolean, Integer, Real, String, UnlimitedNatural, OclAny, OclInvalid, OclVoid, Bag, Collection, OrderedSet, Sequence, Set, Tuple are restricted words. body, context, def, derive, endpackage, init, inv, package, post, pre, static are reserved words in Complete OCL only. OclMessage is a restricted word in Complete OCL only. Issue 14584: TupleLiteralExp part type inference. Issue 14585: TypeLiteralExpCS is introduced. Issue 14586: named-self classifierContextDeclCS is supported. Issue 14587: attrOrAssocContextCS is renamed. Practical Grammar The LALR(1) grammar in the revised text replaces the unrealisable OperationCallExpCS[A] and OperationCallExpCS[H] by a clear grammar in which precedence and associativity are explicit. Atomic terms such as () and if...endif are primaryExpCS. The awkward let..in.. is both high and low precedence. All infix operators are left associative. The OCL 2.1 grammar is difficult to parse because the presentation in Section 9.3 contains • obvious conflicts (PropertyCallExpCS is directly a FeatureCallExpCS and indirectly a FeatureCallExpCS as a NavigationCallExpCS) • subtle conflicts (EnumLiteralExpCS is a PropertyCallExpCS[C]) • no precedence or associativity grammar • no identifier or string grammar • unclear reserved word policy Once these problems are resolved the grammar remains difficult to parse without semantic information because • LetExpCS is both high and low precedence • OperationCallExpCS[B] and IteratorExpCS[A] require a lookahead to the "ß" token to resolve "c" as a VariableDeclarationCS or a VariableExpCS in "a->b(c,dß". These problems are resolved by expressing the infix and prefix grammar to define precedence and associativity, while allowing use of a simpleNameCS in the awkward overlap between OperationCallExpCS[B] and IteratorExpCS[A].
The Object Constraint Language (OCL) is an integral part of the Unified Modeling Language (UML) and is often used separately as a general constraint specification language in software development tools. For example, OCL is incorporated in the Generic Modeling Environment (GME) developed by the Institute of Software Integrated Systems (ISIS) of Vanderbilt University (http://www.isis.vanderbilt.edu/default.asp The GME implementation extends the OCL standard to include Regular Expressions. A Regular Expression is a pattern that describes (or matches) a set of strings where the pattern is itself a string and conforms to a specific syntax. Regular Expressions are ideal for expressing format constraints on OCL String values. Moreover, Regular Expressions are widely used, familiar to many software developers and complement the OCL’s already powerful constraint specification syntax. Unfortunately, Regular Expressions are not currently supported in OCL Version 2.0. Augmenting the OCL standard with Regular Expressions will improve OCL’s constraint specification capabilities for String values with a powerful, familiar notation and would also codify existing practice as manifested in tools such as GME. Please consider the inclusion of Regular Expression support in future releases of the Object Constraint Language (OCL) specification.
Good suggestion. It can be done by augmenting the standard library. Deferred for timing reasons. Disposition: Deferred
I find in the OCL document section "7.3.3. Invariants" that I can name an invariant as in: "context" <contextdeclaration> "inv" <constraintname> ":" ... I haven't figured out how to parse the document well enough to be clear if this is formally defined. And the real question is whether this applies to pre, post, body, init, and derived constraints. Does it? If not it would be useful to add.
The syntax is in fact already formally defined in Section 12.12.6 InvOrDefCS. Disposition: Closed, no change
OCL Specification, v2.0 Section "7.3.3. Invariants" provides a means to name an invariant as in: "context" <contextdeclaration> "inv" <constraintname> ":" ... The document does not seem to define this capability formally and I would like to see it also applied to pre, post, body, init, and derived constraints.
OCL Specification, v2.0
The specification does not make it clear how to apply collection operations to properties.
For instance, assume
class A {
int x[];
}
It appears that an invariant constraint that asserts that one of the entries in A.x must be 5 might be
context A
inv self.x->exists( p | p=5 )
However, this is a guess and does not appear to be entirely justified by the text.
during work on the definition of the UML Profile for CIM (an activity
performed jointly between OMG and DMTF), we recently found the following
issue with OCL 2. Please record this issue officially and let me know the
issue number for it.
Issue: No explicit statement that ownership of association ends does not
matter for traversal in OCL
Nature: Clarification
Severity: Minor
Summary:
The UML Superstructure spec 2.1.1 defines in section 6.5.2 "Diagram
Format" that any meta-association has two ends, regardless of whether
the ends are owned by the association or the associated classifiers.
However, the Superstructure spec only describes those association
ends that are owned by the associated classifiers. Furthermore, a
major OCL engine (from Eclipse) does not currently support
meta-association traversal in OCL towards ends owned by the
meta-association.
This may leave the impression to some readers that OCL would only
support meta-association traversal in the direction of ends owned by
the associated classifiers.
I understand that the intention is in OCL to support traversal of
meta-associations in any direction, regardless of whether the target
end is owned by the association or the associated classifier. It
would be helpful to state that explicitly in the OCL specification.
The intent for OCL to support navigation of association-owned ends is retained, with clarification of the implication on implementations.
I would like to log the following issue against OCL formal/06-05-01. TypeType, appearing on Fig. 8.1 (p.34), Fig. 13.1 (p.172), and section 11.3.2 (p.140) is not defined
Not only is the TypeType metatype not defined, it is not used by the Expressions package (at least, not as indicated by the abstract-syntax mappings in Section 9.3 Concrete Syntax). Moreover, the usage of the UML Classifier metaclass in OCL obviates the need for an OclType enumeration in OCL 2.x. A similar argument can be made for the obsoletion of the ElementType metatype and its instance the OclElement enumeration. The expressive power of the UML infrastructure makes it possible for the OCL StateExp to define an association with the UML State metaclass without the need for an artificial enumeration type.
The OCL abstract syntax for Collections has no property to persist the element type
of the collection.
It is therefore not possible to serialise a TypeExp.referredType referring to
for example OrderedSet(String) without synthesising an
OrderedSet_String and finding some artificial scope for it .. and then encountering
ambiguities as to whether two distinct OrderedSet_String types are really distinct.
Suggest:
Introduce a CollectionTypeExp extending TypeExp to add
CollectionTypeExp.referredElementType : Type[0..1]
with the constraint that the inherited TypeExp.referredType be a collection type.
The submitter’s proposal does not address the problem of referencing nested collection types (collections of collections). Nor does it address other implicitly-generated types such as MessageTypes and TupleTypes. A more general solution is to provide, in the top-level constraint context, ownership of these types so that they can be serialized together with the constraint that depends on them. The assumption is that a namespace is not required for these types as they are artificial, anyway, and that replication of equivalent types in multiple constraints can be resolved by the OCL tool. Currently, OCL defines well-formedness rules for the Classifier metaclass stipulating that for every classifier, there is at most one instance of each of the four concrete collection types. It is not at all clear how this should relate to the Environment construct, or what the scope of allInstances() is, in practice. Moreover, it is not necessary to require this uniqueness of collection types because the conformance rules completely define the equivalence of collection types of the same kind and element type. An OCL tool may be given the freedom to replicate collection types for its own purposes, for example to ensure consistent serialization of expressions without compromising the OCL semantics. It is worth noting that no such uniqueness restriction is currently defined for the other dynamically-generated types, the TupleTypes and MessageTypes.
The OCL 2.0 spec seems to allow usage of initialization constraints
and derivation constraints on the same property. For example in
7.3.7, it says "Initial and derivation expressions may be mixed
together after one context.", which is a string indication that it is
not precluded. Having both initialization and derivation constraints
is an overspecification of the initial value of the property, since
the derivation constraint must be satisfied at any time, which
probably includes the initialization time.
Also, the spec does not seem to contain a statement about how many
initialization and derivation constraints are allowed on a property.
By the nature of these constraints, it seems sensible to have at most
one of them.
The following clarifications are suggested to address this issue:
(1) clarify whether "at any time" for derivation constraints
includes the initialization. Suggestion: Derivation should include
initialization.
(2) clarify whether both kinds of constraints are allowed on the
same property. Suggestion: Both are allowed but must not be
contradictory.
(3) clarify how many initialization and derivation constraints are
allowed on a property. Suggestion: At most one initialization
constraint and at most one derivation constraint.
The suggested clarifications make sense. Added in section 7.3.7. Revised Text:
Thhis expression context TupleType inv: TupleType.allInstances()->forAll (t | ( t.allProperties()->forAll (tp | -- make sure at least one tuplepart has the same name -- (uniqueness of tuplepart names will ensure that not two -- tupleparts have the same name within one tuple) self.allProperties()->exists(stp|stp.name = tp.name) and -- make sure that all tupleparts with the same name conforms. self.allProperties()->forAll(stp | (stp.name = tp.name) and stp.type.conformsTo(tp.type)) ) implies self.conformsTo(t) ) ) should be context TupleType inv: TupleType.allInstances()->forAll (t | ( t.allProperties()->forAll (tp | -- make sure at least one tuplepart has the same name -- (uniqueness of tuplepart names will ensure that not two -- tupleparts have the same name within one tuple) self.allProperties()->exists(stp|stp.name = tp.name) and -- make sure that all tupleparts with the same name conforms. self.allProperties()->forAll(stp | (stp.name = tp.name) implies stp.type.conformsTo(tp.type)) ) implies self.conformsTo(t) ) ) it means "implies" instead of "and" in this part: (stp.name = tp.name) and stp.type.conformsTo(tp.type)
Fixing needed "(stp.name = tp.name) and …" becomes "(stp.name = tp.name) implies …"
missing closing parethesis inthese two expressions: [2]The parameters of the referredOperation become attributes of the instance of MessageType. context MessageType: inv: referredOperation->size()=1 implies Set{1..self.ownedAttribute->size()}->forAll(i | self.ownedAttribute.at(i).cmpSlots( referredOperation.ownedParameter.asProperty()->at(i)) [3]The attributes of the referredSignal become attributes of the instance of MessageType. context MessageType inv: referredSignal->size() = 1 implies Set{1..self.ownedAttribute->size()}->forAll(i | self.ownedAttribute.asOrderedSet().at(i).cmpSlots( referredSignal.ownedAttribute.asOrderedSet()->at(i))
Correct, two parenthesis are missing.
I have an issue with OclAny::allInstances() method, as described in the
11.2.5 section of the OCL2 spec (06-05-01.pdf).
If I understand correctly, OCL is a statically typed language (e.g. as stated
in the beginning of 8.2 section or 8.3 section OclExpression paragraph).
Every expression has a type and this type can be statically determined by
analyzing the expression and its context.
Most of the concepts in the OCL spec follows this rule, however I have
an issue with the allInstances() method, defined on OclAny. Specifically,
the "Returns all instances of self. Type T is equal to self." statement is problematic.
When allInstances is used on the literal type specifier, there is no problem.
E.g.
context classFoo inv:
somepackage::classBar.allInstances()->size() < self.limit
Here, return type of the expression "somepackage::classBar.allInstances()" can be determined
by static analysis ("at compile time") - it is Set(classBar).
However when allInstances is invoked on variable, calculated by some expression,
and all the staticallity of OCL crumbles and the hell breaks loose :D.
And there are no restrictions, on what objects allInstances() can be invoked, the only rules are
that the object to be classifier and the instance set be finite.
E.g.
(singleton rule - all the classes must have at most 1 instance)
context Class inv:
self.allInstances()->size() <= 1
Now, what is the type of the self.allInstances() expression? Well, it depends on what is the self object -
and self object is supplied at run time. If we evaluate this constraint on classFoo,
we see that type of "self.allInstances()" must be Set(classFoo), if we evaluate this constraint on
classBar, type of expression must be Set(classBar). Hence the type of expression can not be determined
at "compile time", it must be determined at "run time".
E.g. we have 2 classes classFoo and classBar; classFoo has a field someField, classBar doesn't.
context whatever inv:
let s:Set(Classifier) = Set{classFoo, classBar} in
s->allInstances()->any(true)->any(true).someField = someValue
Now what is the type of s->allInstances()->any(true)->any(true) expression?
We have:
expression |expression type |expression value
---------------------------------------------------------------------------------
s |Set(Classifier) |Set{classFoo, classBar}
s->allInstances() |Set(Set(???)) |Set{ Set_of_instances_of_classFoo, Set_of_instances_of_classBar}
s->allInstances()->any(true) |Set(???) |either Set_of_instances_of_classFoo or Set_of_instances_of_classBar
s->allInstances()->any(true)->any(true) |???? |either instance of classFoo or instance of classBar
Now the question arises: can we access someField property?
Here we must have a runtime introspection check in the OCL evaluation code -
if s->allInstances()->any(true)->any(true) returned instance of classFoo,
we can access the field, if instance of classBar - we must runtime-fail here.
Please advise. Is this a problem of the spec or I am wrong somewhere?
Granted, we are making jumps 2 levels down in metamodel hierarchy here
(first from metamodel to model elements-classes, then from classes to instances of those classes),
but there is nothing in the spec, what precludes this.
The description of allInstances() is already clear that it may only be applied to classifiers of finite extent, such as user-defined Classes. In particular, it does not apply to DataTypes, which by definition have unbounded extents, and this includes collection types such as Set(Classifier). Thus, much of the submitter’s argument is faulty. Disposition: Closed, no change
The operator precedence rules in 9.3.2 are identical to the precedence rules in 7.4.7. Both sets are incomplete in that they do not specify the precedence of the 'let' operator. For example, in a UML profile, a constraint on a 'Property' stereotype might be: not self.base_Property.allNamespaces()->exists(oclIsKindOf(Profile) or oclIsKindOf(Stereotype)) implies let prop:Property=self.base_Property in prop.defaultValue->isEmpty() To parse properly (with RSA 7.0.0.2), this constraint must instead be written as: not self.base_Property.allNamespaces()->exists(oclIsKindOf(Profile) or oclIsKindOf(Stereotype)) implies (let prop:Property=self.base_Property in prop.defaultValue->isEmpty()) This suggests that the 'let' operator has a lower precedence than that of the 'implies' operator. Of course, there is an alternative way to write this constraint that does not expose this issue: let prop:Property=self.base_Property in not prop.allNamespaces()->exists(oclIsKindOf(Profile) or oclIsKindOf(Stereotype)) implies prop.defaultValue->isEmpty() The suggestion is to revise 7.4.7 and 9.3.2 to account for *all* keywords in 7.4.9. The keywords defined in 7.4.9 but not accounted for in 7.4.7 or in 9.3.2 are: - attr - context - def - endpackage - in - inv - let - oper - package - post - pre The keywords referenced in 7.4.7 or in 9.3.2 that are *not* defined in 7.4.9 are: - @pre Nicolas F. Rouquette Principal Computer Scientist http://www.jpl.nasa.gov Jet Propulsion Laboratory, Caltech M/S 301-270 Pasadena, CA 91109, USA phone: +1-818-354-9600 fax: +1-818-393-4100 e-mail: nicolas.f.rouquette@jpl.nasa.gov
Most of the keywords listed by the submitter are not used in the syntax of expressions, but of constraint context declarations. Only the ‘let’ and ‘in’ keywords need to be addressed.
For the InvalidType it is stated that: "The only instance of InvalidType is Invalid, which is further defined in the standard library. Furthermore Invalid has exactly one runtime instance called OclInvalid." It should read: "The only instance of InvalidType is OclInvalid, which is further defined in the standard library. Furthermore OclInvalid has exactly one runtime instance called invalid." because this is in line with ch. 11.2.4, p. 138:"It [OclInvalid] has one single instance called invalid. [...] OclInvalid is itself an instance of the metatype InvalidType
The statements in the discussion of both OclVoid to OclInvalid that they conform to all other types is problematic, because that implies that they conform to one another, resulting in a generalization cycle. They should neither of them conform to the other, as both are intended as undefined values of ordinary expressions in degenerate situations
The abstractness of CollectionType and corresponding existence of the Collection CollectionKind is inconsistent:
--
9.3 collectionTypeCS synthesized attributes, page 79, contains:
kind = CollectionKind::Collection implies collectionTypeCS.ast.oclIsKindOf(CollectionType)
using CollectionKind::Collection.
--
8.3.5 CollectionKind, page 48, Collection is not one of the enumeration values.
--
11.6.1, page 144, specifies that Collection is an instance of CollectionType
requiring Collection to not be abstract.
--
8.2 CollectionType, page 34, CollectionType is identified as an abstract class.
--
An expression like the following is valid:
context Package
def getClasses() : Set(Class) =
let c : Collection(Type) = self.ownedType in
c->select(oclIsKindOf(Class))->asSet()
and demonstrates the need for a concrete CollectionType.
--
Recommendation:
Collection should not be abstract; change Fig 8.1, 8.2 CollectionType text.
CollectionKind requires a Collection value; change Fig 8.7, 8.3.5 CollectionKind.
There is no inconsistency in CollectionType being concrete while Collection(T) is abstract; they are defined on different metalevels. Indeed, the Collection(T) type would not exist if CollectionType were abstract, as it would then not be permitted to have instances
The last line on page 28 is an example in Java-like code that is supposed to show the accumulation of values into a Bag. The line currently is acc = <expression-with-elem-and-acc> Since such an assignment would not add to the Bag, but more likely produce a compile error in Java, I would think use of the common method name "add" would be more appropriate: acc.add(<expression-with-elem-and-acc>);
The following grammatically incorrect sentence is present in the document: All type domains include an undefined value that allows to operate with unknown or “null” values. This could be corrected in various ways, a couple of which would be: All type domains include an undefined value that allows one to operate with unknown or “null” values. or All type domains include an undefined value that allows operations with unknown or “null” values.
The rresolution needs to take into account the fact that Null and Invalid are introduced in OCL2 replacing undefined.
The next to last line of Definition A.4 begins, "that associates (sa) = <oc, c>." I think this should read instead, "that associates (sa) = <c, c>." If I am mistaken, then a note to remind the reader what "oc" means would be helpful, as would a note describing why the classes are not the same.
Between the definitions of "participating" and "navends" is a sentence that, "The following function navends give ...." The s is missing on "gives". It should instead read, "The following function navends gives ...."
In the definition of "navends" the symbol for "and", which was a nice looking capital lambda in previous definitions, is here a more traditional, at least in my mind, "and" sign. Consistency would be nice
At the top of page 182 there are 3 definitions, all of which have the index domain, i.e. C' an element of parents(c), in the wrong place horizontally. In the first two it appears to be associated with the small union symbol, rather than with the large one as it should be. In the third it seems not to be associated with anything in particular. Additionally, in the first line on the page there is an extraneous underscore in the name of the object of the first definition.
Problems were due to a semi-automatic Latex to Framemaker conversion. Mathematical symbols were often badly converted. The correct text is in the original from annex A of ptc/03-10-14.
In WF-1 there is an "is an element of" sign missing just before the "ATT" in the first line. In WF-2, at a minimum, the first small omega should have a t-sub-1 a bit after it so that the sameness of arguments from t-sub-1 through t-sub-n is clear for both small omegas. Also the second colon is on the wrong side of the small omega. On the other hand, I'm not sure why you don't write it in the same form as WF-1, since it's a similar statement. I hope you can interpret my attempts to get by without sub and superscripts. Since the reader has already waded through WF-1, wouldn't it be more useful like this? ? (? : tc x t1 x …x tn ? t, ?' : tc' x t1 x …x tn ? t' ? OP*c) : (? = ?' => tc = tc' ? t = t')
Problems were due to a semi-automatic Latex to Framemaker conversion. Mathematical symbols were often badly converted. The correct text is in the original from annex A of ptc/03-10-14.
In Definition A.10 Object Identifiers, part ii, you have the domain of a class c defined as: ICLASS(c') = U{oid(c) | c' ? CLASS ^ c' "gr<" c}. where I've used "gr<" for the generalization relation. I see 4 things that ought to be changed: 1. The initial c' should obviously be a c. 2. The oid(c) should be oid(c') 3. We have still another symbol for "and" 4. There's an extraneous newline before the final c.
Problems were due to a semi-automatic Latex to Framemaker conversion. Mathematical symbols were often badly converted. The correct text is in the original from annex A of ptc/03-10-14.
Definition 1.12 (System State) ends with "(the function pi(l) projects the ith component of a tuple or list l, whereas the function pi(l) projects all but the ith component):" Obviously the same notation can't mean opposite things, but what was intended here I don't yet know. Perhaps I will as I read on, but I thought I'd report this typo now so I don't forget.
Problems were due to a semi-automatic Latex to Framemaker conversion. Mathematical symbols were often badly converted. The correct text is in the original from annex A of ptc/03-10-14.
This is another omission of the word "one", making the sentence grammatically incorrect. It is also useful to have an operation that allows to check whether an arbitrary value is well defined or undefined. should be "... allows one to ...." or "... allows the checking of whether ...."
In section 7.4.6 (p. 12) it is said "An object can only be re-typed to one of its subtypes; ... If the actual type of the object is not a subtype of the type to which it is re-typed, the expression is undefined" While in section 7.5.8 (p. 19) it is said Whenever we have a class B as a subtype of class A, and a property p1 of both A and B, we can write: context B inv: self.oclAsType(A).p1 -- accesses the p1 property defined in A self.p1 -- accesses the p1 property defined in B and thus an example is shown where an object is retyped to its supertype. Both sections 7.4.6 and 7.5.8 should be joined into one. See slide 32 in my handouts to see a possible abstract of the joined section.
The problem is fixed by resolution of issue 7341. Casting and accessing properties from a supertype are two different things. Disposition: See Issue 7341 for disposition
There are no explanations about how to manipulate optional and multivalued attributes. On the other hand optional and multivalued associations are discussed in detail. For example, while I can use context Person inv: self.job->notEmpty() implies ... to test "whether there is an object or not when navigating the association", I do not know how do a similar test for optional attributes. Is it context Person inv: self.maidenName <> `' implies ... or context Person inv: self.maidenName -> notEmpty() implies ... ?
Associations are attributes. No further information is required. Disposition: Closed, no change
The Tuple constructor is problematic. It is not a first-class citizen in the specifications. It appears in many parts but it is not formally introduced.
The discussion of tuple literal expressions in Section 7.5.15 Tuples is quite thorough. The description of the abstract syntax of the TupleLiteralExp in Section 8.3.5 is terse but complete, and the concrete syntax of tuple literals in Section 9.3 is also complete. Disposition: Closed, no change
The OrderedSet collection is a later adjunction with respect to previous versions of OCL. However, it has not been systematically introduced in all relevant places. As one example among many, conformance rules in Table 7.3 (p.12) do not include OrderedSet. Also, the semantics defined in Appendix A should be extended to include OrderedSet. By the way, there is no place where the difference between OrderedSet and Sequence is discussed. From my understanding, they are much like the same concept. If it is not the case, the differences must be explicitly stated.
Various issue resolution solve the problem mentioned by the reporter. The table 7.3 was not yet completed. This resolution solves that. Regarding the difference between OrderedSet and Sequence it is very clear in the types section.
Recursivity is not explicitly addressed with examples, although it is mentioned in several places. For example, in p. 16 it is said "The right-hand-side of this definition may refer to the operation being defined (i.e., the definition may be recursive) as long as the recursion is not infinite." I my course I have put the following example (slide 19) A method that obtains the direct and indirect descendants of a person context Person::descendants(): Set body: result = self.children->union( self.children->collect(c | c.descendants()) ) But there is no way to verify whether the above definition, although conceptually correct, is OK with respect to OCL's syntax. Similarly, the same problem arises with recursive association classes, which is covered in Section 7.5.4. I have covered this in my course in slides 29-30 A person is currently married to at most one person context Person inv: self.marriage[wife]->select(m | m.ended = false)->size()=1 and self.marriage[husband]->select(m | m.ended = false)->size()=1 Operation that selects the current spouse of a person context Person::currentSpouse() : Person pre: self.isMarried = true body: if gender = Gender::male self.marriage[wife]->select(m | m.ended = false).wife else self.marriage[husband]->select(m | m.ended = false).husband end However, I suppose that the syntax for the operation currentSpouse is OK with respect to OCL's syntax, although it is not specified explicitly.
Deferred for timing reasons. In order to introduce the suggested examples in Section 7 some verification will be needed. Disposition: Deferred
Mismatch between the definition of operators in, e.g., Section 11.7.1 and in Table A.3: product operation is missing in the latter. By the way, there are many printing problems in this table. Similar mismatch: flatten operation is specified for Sets (p. 147) for Bags (p. 151) and for Sequences (p. 152) but are not mentioned in the corresponding tables in Annex A. By the way, whey flatten is not specified for OrderedSets? Why several methods specified for Sets and Bags (union, intersection, etc.) but not for OrderedSets?
For timing issues all issues concerning Annex A are deferred. Disposition: Deferred
The constraint [1] on the TupleLiteralPart metaclass is overconstrained. It requires that the type of the value of a tuple literal part be identical to the corresponding attribute of the tuple type. However, the value type should only be required to conform to the attribute type because tuple literals may optionally specify the part types (in the same fashion as variable declarations). Thus, a more appropriate formulation of this constraint would be: context TupleLiteralPart inv: attribute.type.conformsTo(value.type )
The examples are based on the sample model (Companies and Employees). However, as pointed out in http://www.empowertec.de/products/analyze-spec-expressions.htm there are many errors in the examples. You will find at the address http://cs.ulb.ac.be/oclnotes.pdf the slides that I use in my course in which I slighty modified the example so that all example expressions are (supposed to be) correct.
This may be simply my misunderstanding of what is intended. In the final sentence before Definition A.18 (Semantics of Enumeration Types), the word "interpreted" seems inappropriate. "Defined" is often used in such sentences is mathematics. I just wanted to draw attention to this in case it is a mistake. If not then my apologies
The last sentence of the page is missing the word "one" or, alternately, proper forms of the verbs "to follow" and "to retrieve". A correct form of this sentence would be, "Navigation operations: An object may be connected to other objects via association links. A navigation expression allows one to follow these links and to retrieve connected objects."
Maybe I misunderstand, but it seems to me that L(as)(ci), as defined, has some problems: 1. "(c1, . . . , c i, . . . , c j , . . . , c n )" is undefined in that one doesn't know what it is, and 2. c is undefined in "sCLASS(c)". It seems to me that what you want is "L(as)(ci) = {cj | i ? j ? (c1, . . . , ci, . . . , cj , . . . , cn ) ? I-sub-ASSOC(as)}" - where the characters following the c's are subscripts and each such combination should be underlined to show that it is an object, - and where I-sub-ASSOC(as) is an italic I with a subscripted "ASSOC(as)".
Problems were due to a semi-automatic Latex to Framemaker conversion. Mathematical symbols were often badly converted. The correct text is in the original from annex A of ptc/03-10-14..
This may not have been a problem with earlier versions of Adobe Acrobat/Reader but in looking at this section I see two typographical representations of "T-hat". The first two occurances are the letter T followed by a small circumflex substript. Subsequent occurances are a large circumflex followed by the letter T. It would be nice if this were fixed to be consistent, and even nicer if the circumflex could be placed over the T, as I imagine was intended.
Problems were due to a semi-automatic Latex to Framemaker conversion. Mathematical symbols were often badly converted. The correct text is in the original from annex A of ptc/03-10-14.
The 5th word of this section is "of" but was probably meant to be "on". Also, in Table A.3 in this section the entry in the second row, third column is pretty much unreadable because there are so many symbols written on top of each other. I checked this with Internet Explorer as well as Firefox, in case they affected Adobe Acrobat, but the entry looked equally bad in both.
Problems were due to a semi-automatic Latex to Framemaker conversion. Mathematical symbols were often badly converted. The correct text is in the original from annex A of ptc/03-10-14.
Just before Table A.3, is a sentence, "For this purpose, C, C, C2 ...." The second "C" should have a subscript "1" and the "C2" should have the 2 as a subscript.
Disposition: See Issue 12463 for disposition
Table A.3 has several problems in the "Semantics" column: Row 2: Besides being hard to read, the expression seems to be wrong. There is no operator between the C and capital pi (which I assume to be a Cartesian product), and the "is not an element of" seems like it couldn't be right. Maybe I'm at fault, but I can't make any sense of it. Row 4: There's no entry here. How about " C 'intersect' {v} = Ø" Row 6: The operator should be intersection, not Cartesian product, that is the capital pi should is the wrong symbol here. Rows 8 & 9: First, there shouldn't be anything in row 9's semantics column since the other columns are all blank. Are the c's supposed to be the capital C's? I can't make any sense of the expression, which could be my problem, but I don't think so.
In the paragraph under table A.3, toward the end, it says, "... count : Set(t) _ t ! Integer ...." These are the wrong symbols, of course. The underscore should be a cross and the ! should be an arrow. Also, just below this is the definition of I(count). This contains a 2 that should be a 0.
There are two instances of missing and misplaced parentheses. One is near the bottom of page 195 in the definition of I(count). The line begins, "I(count : Bag)(t) x t ? Integer)". That last closing paren does not match anything. I believe the line should instead begin "(I(count) : Bag(t) x t ? Integer) The other is at the top of page 196. It is currently "I(count : Collection)(t) x t ? Integer)(c,v)" and, I believe, should be "(I(count) : Collection(t) x t ? Integer)(c,v)"
The second sentence of this section ends, "... B is a value of type t.". It should say "... B is a value of type Bag(t).
The original text of Annex A (ptc/03-10-14) was left unchanged by the FTF. However some editorial copy/paste errors were introduced when moving from latex to framemaker. In the case of this issue this concerns the description text (not only the math symbols).
Table A.4 has several rows in the Semantics column where a "union" symbol is used where an "intersection" symbol should have been used. These are rows 3, 4, 5, and 6. Table A.5 of section A.2.5.7 has the same problem in rows 3 and 4.
There is one error in Table A.6 in the semantics column for the operation "first". The index should be 1, not i.
Definition A.29 (Syntax of Expressions), part iii, b ends with, "and e2 to en the arguments." Here the 2 is a subscript as it should be but the "n" in "en" should also be a subscript and isn't.
Problems were due to a semi-automatic Latex to Framemaker conversion. The correct text is in the original annex ptc/03-10-14. .
Definition A.29 (Syntax of Expressions), part v, appears to have several problems: 1. The symbol used for generalization is not what has always been used previously, see the two previous symbols in Definition A.10 part ii and in section A.1.2.2 just after it. 2. the first expression after the word "then", namely "(e asType t’) ? Exprt’" lacks a comma after it to separate it from the following expression. 3. I'm puzzled by the restrictions that t and t' must be related one way on the other. The restriction isn't strong enough to keep (e asType t’) from being undefined and seems unneeded for isTypeOf and isKindOf. A note here about this might help the reader. It would sure help me.
Definition A.29 (Syntax of Expressions), part vi reads it part, "... v1 ? Vart1, v2 ? Vart2, and ...." The first comma is a subscript along with the "t1" before it, the second one, that follows the "t2" subscript, isn't. Neither should be.
Problems were due to a semi-automatic Latex to Framemaker conversion. Mathematical symbols were often badly converted. The correct text is in the original from annex A of ptc/03-10-14. . Disposition: See issue 12474 for disposition
The second sentence after Definition A.29 is "For all t’ < t: if e ? Exprt’ then e ? Exprt’ ." The last prime should be removed.
Problems were due to a semi-automatic Latex to Framemaker conversion. Mathematical symbols were often badly converted. The correct text is in the original from annex A of ptc/03-10-14. . Disposition: See issue 12474 for disposition
The third bullet ends, "... as ? is an instance of every type." I don't know if the ? stands for OclAny, which isn't a member of the collection classes and so unlikely, or if ? is meant rather than ?. So I think this is an error.
Problems were due to a semi-automatic Latex to Framemaker conversion. Mathematical symbols were often badly converted. The correct text is in the original from annex A of ptc/03-10-14. .
At the very end if this section it says "I(undefined) = ?." Shouldn't that be "I(undefined) = {?}."? Definition A.14 says the semantics maps each type to a set.
Problems were due to a semi-automatic Latex to Framemaker conversion. Mathematical symbols were often badly converted. The correct text is in the original from annex A of ptc/03-10-14. . Disposition: See Issue 2478 for disposition
Section 8.2.1 Type Conformance on page 37 [1] Invalid conforms to all other types. context InvalidType inv: Classifier.allInstances()->forAll (c | self.conformsTo (c)) on page 38 [1] Void conforms to all other types. context VoidType inv: Classifier.allinstances()->forAll(c | self.conformsTo(c)) on page 37 [6] The Conforms operation on Types is anti-symmetric context Classifier inv: Classifier.allInstances()-> forAll(12,t2 | t1.conformsTo(t2) and t2.conformsTo(t1) implies t1 = t2) The first invariant yields Classifier.allInstances()->forAll (c | OclInvalid.conformsTo (c)) and thus OclInvalid.conformsTo (OclVoid) The second invariant yields Classifier.allInstances()->forAll (c | OclVoid.conformsTo (c)) and thus OclVoid.conformsTo (OclInvalid) Now the third invariant implies: OclInvalid = OclVoid
As in the proposed resolutions of Issues 10433 and 10434, OclVoid and OclInvalid cannot both be the bottom of a lattice-structured type system. It is better that OclVoid and OclInvalid be defined as conforming to all other types excepting one another.
InvalidType represents a type that conforms to all types. The only instance of InvalidType is Invalid, which is further defined in the standard library. Furthermore Invalid has exactly one runtime instance called OclInvalid. should be replaced by InvalidType InvalidType represents a type that conforms to all types. The only instance of InvalidType is OclInvalid, which is further defined in the standard library. Furthermore OclInvalid has exactly one runtime instance called invalid. This would follow the naming conventions and be in line with the notation for VoidType, OclVoid, null.
Disposition: See issue 12378 for disposition
The first two sentences of Definition A.27 (Type Hierarchy) seem to have errors in them. The relation "less than or equal" seems to be represented by an underscore in the first sentence. In the second sentence 2 is used where the "is an element of" symbol was intended, 0 is used where a prime mark is intended, and c simply follows t and t0 (t prime) rather than being a subscript as intended.
Problems were due to a semi-automatic Latex to Framemaker conversion. Mathematical symbols were often badly converted. The correct text is in the original from annex A of ptc/03-10-14. .
Definition A.29 (Syntax of Expressions)part iii, (b) ends, "...and e2 to en the arguments." The n in "en" should be a subscript but is not.
Disposition: See issue 12474 for disposition
Some problems with Definition A.30: 1. In the second sentence of Definition A.30 (Semantics of Expressions) it says, "I[[ e ]] : Env ? I(t)" but it seems instead that "I[[ e ]] : Exprt ? (Env ? I(t)). 2. It appears that r, which is not defined anywhere, is really supposed to be p. p, which is defined, only appears in part iv and it appears to be r there. 3. Also, it's confusing to use w in parts iii and iv since small omega (or script w maybe) is used previously. Further clarity would be added by putting empty parenthenes after omega in part iii to emphasize the fact that there are no arguments
Problems were due to a semi-automatic Latex to Framemaker conversion. Mathematical symbols were often badly converted. The correct text is in the original from annex A of ptc/03-10-14. .
Definition A.30, part ii says "I[[let v = e1 in e2]](r) = I[[e2]](s, ß{v / I[[e1]](r)})." Maybe the problem is my ignorance of the meaning of the / in that expression as well as the meaning of the notation "ß{...}". I would have expected instead something like, "... = I[[e2]](s, ß U {v = I[[e1]](r)})."
In the flattening expressions there are the expressions "C1 fg" and "Bag fg". These seem to stand for the creation of a new, empty collection and bag respectively. If these expressions are what was intended it would be nice to have a note explaining what they mean. I wasn't able to find any explanations or previous use of "fg".
It would be nice to have a definition of ß{x / y) in association with Definition A.30. Maybe it's defined elsewhere, but I don't see it. From what's written in this section, including the explanation of iteration on page 205 and 206, I get only a vague idea. P.S. So realizing now that this is not a typo, my revision request two previous to this (if I've counted correctly) should be ignored. That was the one about part ii of Definition A.30.
In the paragraph before Definition A.32 you will find, "An environment p = (s, ß is a pair ...." The closing paren. after ß is missing
Problems were due to a semi-automatic Latex to Framemaker conversion. Mathematical symbols were often badly converted. The correct text is in the original from annex A of ptc/03-10-14. The parenthesis problem reported here is just one of the problems that are in this section.
In the paragraph before Definition A.32 you will find, "... ppre = (spre, ßpre) describing a system state and variable assignments before the execution ...." Originally I had taken the ß's to be sets of assignments. Then I noticed that the text before this point refers to it repeatedly as an "assignment" in the singular. Now, here, and also in the middle of page 205 (which says, "ß' := ß{p1/I[[ e1 ]](r), . . . , pn /I[[ en ]](r)}.") the indication is that beta is multiple of assignments. Consistency would be very desirable.
Deferred for timing reasons. Disposition: Deferred
At the beginning of Definition A.32 you will find the sentence, "The semantics of an expression e ? Post-Exprt is a function I[[ e ]] : Env x Env ? I(t)." It doesn't seem that this can be right since the argument to I[[.]] is an element of Post-Expt-sub-t. So, similarly to Definition A.30, I would suggest that something akin to "I[[ e ]] : Post-Exprt ? (Env x Env ? I(t))" would be more appropriate.
Deferred for timing reasons. Disposition: Deferred
In the paragraph before Definition A.33 we have, "We say that a precondition P satisfies a pre-environment rpre – written as rpre |= P –....". In the explanation of Definition A.33 we have, "...the pre-environment rpre satisfies the precondition P....". One of these must be backwards. Does the environment satisfy the condition (2nd above) or does the condition satisfy the environment (1st above)?
Deferred for timing reasons. Disposition: Deferred
No CMOF models of OCL Abstract Syntax Unlike most successful specifications in the MOF and UML family, the OCL specification does not publish CMOF serializations of its metamodels. Publication of normative metamodels will greatly improve the clarity of the specification and assist tools in implementing it. XMI serializations of the following metamodels are recommended: - CompleteOCL Abstract Syntax (UML basis) - EssentialOCL Abstract Syntax (EMOF basis) Also, a separate document containing normative EBNF or RelaxNG grammars of: - CompleteOCL Concrete Syntax - EssentialOCL Concrete Syntax
Good suggestion. It cannot be treated in this ballot due to timing constraints. Disposition: Deferred
The name of a Set (or other Collection) is defined to use the element type name. This is not consistent with the UML requirement for distinguishability of namespace memebers. (UML Infra 9.14.2 Namespace). OCL should permit, and perhaps require, that the name of a Collection use the element type qualified name, so that two sets of distinct element type are not folded into indistinguishable names. This is a problem for model to model transformation where the same class name can easily occur on both input and output meta-model, and where the requirement to reify collection types can easily result in Set(input::name) and Set(output::name) in the same namespace.
Good remark. Now for the resolution we have the option to explicitly consider that the distinguishability rule does not apply for collections or follow the reporter suggestion, which could have some impact in pre-existing written OCL. I suggest to defer so that we take more time to examine the options. Disposition: Deferred
[Pending a resolution of Issue 10946] In order to use a collection type, it is is necessary to define that type and provide some container for it. OCL provides no guidance on what that container should be, or upon what the relative semantics of A::Set(E) is with respect to B::Set(E). QVT 1.0 has defined all CollectionType(ElementType) to be the same type regardless of the accidental package used for their containment. OCL should adopt the QVT definition (even if 10946 is adopted).
A sentence is needed to state that collection types can be replicated in different namespaces and still represent the same type. This is in line with 10946 resolution.
Special Types violate UML Generalization Semantics The definition of OclAny as a general of all classes in the UML model and of OclVoid and OclInvalid as specializations of all classes in the UML model are in violation of the semantics of generalization. Classifiers in the UML may only specialize other classifiers of the same or a conformant metaclass. From the description of Classifier in the UML: [3] A classifier may only specialize classifiers of a valid type. self.parents()->forAll(c | self.maySpecializeType(c)) [8] The query maySpecializeType() determines whether this classifier may have a generalization relationship to classifiers of the specified type. By default a classifier may specialize classifiers of the same or a more general type. It is intended to be redefined by classifiers that have different specialization constraints. Thus, it is not valid for OclAny (an instance of the AnyType metaclass) to be the general of any other class. Likewise, OclVoid and OclInvalid may not specialize any other class at all. This could be corrected in OclVoid and OclInvalid by redefining the maySpecializeType() query. For OclAny, the solution is not so straight-forward, as I don't see that OCL can redefine maySpecializeType() on behalf of the UML metaclasses; according to Section 7.4.4, it is not permitted to attempt to define an additional operation that clashes with an intrinsic operation of the context classifier.
The issue requires some further analysis. Deferred for timing reasons. Disposition: Deferred
Re: OCL 2.0 formal/06-05-01 The Abstract Syntax defines expressions that navigate properties and call operations of Classifiers: the PropertyCallExp and OperationCallExp, respectively. These work well for features of Classifiers that are defined by the UML model that is the subject of the OCL constraints. However, OCL also provides a mechanism for defining additional attributes and operations on behalf of a classifier: the definition constraint. As these definitions are extrinsic to the UML model, there are no Property and Operation elements for the respective expressions to reference. There are only Constraints with an «oclHelper» stereotype and a body expression. The very purpose of these definitions is to assist in the formulation of OCL constraints, so it is necessary that the abstract syntax be able to reference them. I can think of an obvious approach to resolution of this problem: add an association "referredDefinition : Constraint" with 0..1 multiplicity to both of the existing PropertyCallExp and OperationCallExp metaclasses. The 0..1 multiplicity of the existing referredProperty and referredOperation associations, as shown in Figure 8.3, appears to be in error (as the rest of the text and, in particular, the well-formedness rules of Section 8.3.7, assumes the reference to the referred features) but is required by this solution. Additional well-formedness rules would stipulate, for each expression, that exactly one of the referred feature of referred definition associations have a value. This suggestion is not entirely satisfactory, as it breaks the uniformity of references to features in call expressions and encodes, in the abstract syntax, a dependency on a feature's being an additional definition. However, this problem is a practical concern for the serialization and exchange of the OCL Abstract Syntax, as the current metamodel is incomplete.
The solution suggested by the reporter as recognized by him is not satisfactory. A more clean "conceptual" solution would be to allow OCL define modules (package) that extend the metamodels (as it works in QVT). Some further examination is needed of this issue to find the most appropriate solution. Disposition: Deferred
The second constraint on CollectionType in Section 8.2.2 does not make
sense. The instances of CollectionType are not collections, but the
types of collections. Thus, a collection type does not have elements
to be iterated. This constraint should be struck from Section 8.2.2:
[1] A collection cannot contain OclInvalid values.
context CollectionType
inv: self->forAll(not oclIsInvalid())
and replaced by a new invariant constraint in Section 11.7.1
“Collection” (which currently has no well-formedness rules):
[1] A collection cannot contain OclInvalid values.
context Collection
inv: self->forAll(not oclIsInvalid())
In the TypeExp definition (within section 8.3) there is no indication of what is the type returned by a type expression. Is it the generic object representing all types (oclType) or the referred type itself? We guess it is the referred type itself, but this need to be explicitly stated.
Summary:Since the iterators are redefined for each concrete collection type We would expect a "11.9.5 OrderedSet" section. Moreover, when defining nestedCollect for OrderedSet we should expect the type to be a Sequence (in constrast to Set::nestedCollect which type is a Bag).
The operation asSet, asSequence, asBag and asOrderedSet are not defined for OrderedSets in 11.7.3. Also, since these operations are available in all collections we would expect their definition at Collection level.
Summary: Does an OrderedSet conforms to a Set? Does an OrderedSet conforms to a Sequence? It seems that there is no automatic conformance between these concrete collection types (hence an explicit conversion need to be done when needed) However, for clarification, this should be stated in the definition of the respective concrete collection types to avoid OCL writers making wrong assumptions.
Summary: In the actual OCL2 spec OclAny represents any object except collections. However this is unaligned with UML2 and MOF2 where such kind of type does not exist Instead in MOF we have the generic Object which represents any object including primitive and collection values. Also, looking at the list of operations defined for OclAny we see that there is no real justification for creating this special type. Operations like 'allInstances' and 'oclIsNew' are also invalid for primitive types and hence are not specifically invalid for collections. Making OclAny to represent any object (equivalent to MOF::Object) will simplify the stdlib and will be consistent with UML2 and MOF2.
Summary: In Figure 8.6 we have UnlimitedNatural but in other parts of the spec there is a UnlimitedInteger definition.
The correct name is UnlimitedNatural. This error only occurs in Section 11.4.5.
Summary: The OCL metamodel does not provide means to encode type parameters in operations like the generic ones that are defined by Collection type in the standad library.
Summary: There is no clear indication weather MOF reflection is available in EssentialOCL (except in the provided xmi, ecore files of essential ocl).
Summary: Use of simple quotes in place of double quotes should be allowed, Specially in situations where the string contains double quotes (to avoid explicit use of escaping characters).
In fact simple quotes are used in OCL for introducing strings, so we guess the request is to allow use of double quotes as an option (like in Javascript). This issue requires some further analysis so I suggest to defer. Disposition: Deferred
Summary:
It is not clear what is the concrete type of Set{}. Is it Set(Object)??, Set(Void)??
Also it seems there is no way to explicitly define an empty collection with a given
type for the elements.Resolution of this issue requires some extra analysis Disposition: Deferred
Although it is clear that using a constructor to write an object to the system being modelled breaks the property of being side-effect free, it would be useful to return new objects as a result of the query functionality of OCL. It is possible to create a new Tuple for return from a function. For example: def: newDate1() : TupleType {day:Integer, month:Integer, year:Integer} = Tuple{day=10, month=12, year=1950}; It would be useful to have a similar way to generate a query result, but with a complex data type instead of a Tuple. For example: def: newDate2() : Date = Date{day=10, month=12, year=1950}; Rather than write this object to the model under query, it would only be returned as a query result so, under these circumstances, would not break the property of being side-effect free. This feature would be extremely useful to the HL7 GELLO project, which works with data models defined in absense of defined methods or constructors. If this feature were to only apply to classes marked in some way to guarantee they have no side-effects from construction then that would remain useful.
Resolution of this issue requires some extra analysis. Disposition: Deferred
The concrete syntax given is extremely difficult to implement, as documented in several places, including University of Dresden http://dresden-ocl.sourceforge.net/papers/ParserDesign.pdf Many languages have a syntax specified in a machine-readable form, (e.g. lex/yacc format). A standard, working, syntax for OCL would be very useful.
Good suggestion. A lot of people has expressed the need for having an alternate BNF based way of providing the syntax. This could be done but requires some analysis to ensure it will be compatible with the way it is actually provided. Disposition: Deferred
The HL7 GELLO project would find it useful to have additional collection operators in OCL. A method to define these in the underlying model would be good. Alternatively, we request the addition of the following operations: max, min: To determine the maximum or minimum value in a collection firstN: Returns a sequence with the first n elements of this sequence lastN: Returns a sequence with the last n elements of this sequence reverse: Returns a sequence in reverse order join(namesOfCollections; namesOfProperties; booleanExpression; orderByExpression) Where: - namesOfCollections is a list of strings separated by commas, where each string represents the name of a collection from where data is retrieved. - namesOfProperties is a list of strings separated by commas, where each string is the full description of the properties from the objects in the collections we want to get in the result. - booleanExpression is a valid boolean expression containing the conditions the elements from the collections defined in listOfCollections must satisfy in order to be included in the result - booleanExpression is a valid boolean expression containing the conditions the elements from the collections defined in listOfCollections must satisfy in order to be included in the result average: Calculate the average value in a collection stdev: Calculate the standard deviation of a collection variance: Calculate the variance of a collection median: Calculate the median of a collection mode: Calculate the mode of a collection
In the OCL specification we found some statements that indicate that the standard library can be extended (example 11.8.1), not only with new operations but also with iterator expressions. However the mechanism for representing the standard library itself (as a M1 instance of the OCL metamodel) is unclear (a Package containing types which in turn contain operations?) and the extension mechanism for the standard library is also undefined (a pure replacement of the Package, or a new Package importing the StdLib package?). Some other issues address specifically this problem, so the resolution of this issue will be formulated in a neutral way is respect to this representation issue: we confirm that new collection operations can be defined (adding a sentence) and we treat specifically the case of some generic operations that can be easily introduced: "reverse" as operation of "Sequence" and "OrderedSet", max, min as operations of Collection but with constraints on the type of parameters. We consider that average, stdev, variance, median and mode are too specific and can be defined as extensions. The proposed join functionality can be re-formulated as an iterator extending the standard library.
The CollectionLiteralExp class defines the 'kind' attribute to indicate the specific collection type of the literal (8.3.5 Literal Expressions). This information is redundant as the collection kind can be deduced from the 'type' association inherited from the TypedElement. As the attribute type is CollectionKind enumeration, it restricts to the set of predefined OCL collection types. Other languages that extend OCL, like QVT does, may need to define custom CollectionType subclasses but can't reuse CollectionLiteralExp as it's impossible to provide a suitable collection kind value. Proposed resolution: Remove the CollectionLiteralExp::kind attribute, eventually consider removing the CollectionKind enumeration.
The information CollectionLiteralExp::kind is effectively redundant since in theory it can be computed by inspecting the type information. I guess the 'kind' attribute was introduced to facilitate "very lazy" type instantiation (like not building the type associated with the tuple literal). One possible option, instead of removing the attribute, could be to state it is optional. I suggest deferring the resolution of this issue to give more time to people to discuss on the resolution proposal. Disposition: Deferred
I have a few doubts about the iterator variables. Reading the specification I am not sure about, for each iterator, how many iterator variables can have. Looking at sections 7.6 and 11.9 my conclusion in the following: -select --> It has zero or one iterator variables. (0..1) -reject --> It has zero or one iterator variables.(0..1) -collect --> It has zero or one iterator variables.(0..1) -forAll --> There is no restriction about the number of iterator variables. (0..*) -exists --> Unlike forAll, in section 7.6 there is no text saying anything about the number of variables. But in section 11.9 it seems that it is the same case that forAll. (0..*) -iterate --> It has one iterator variable. -collectNested --> It has zero or one iterator variables.(0..1) -one --> It has zero or one iterator variables.(0..1) -any --> It has zero or one iterator variables.(0..1) -isUnique -->It has zero or one iterator variables.(0..1) Is my conclusion correct in everything? or in wich parts am I confused? How can the most of the iterators be defined by the iterate iterator if iterate iterator can have only one variable iterator? I think the iterate iterator should not have restrictions about the number of iterator variables (0..*).
The assumption of the reporter concerning the number of iterators in the syntax is correct. The number of iterators is in fact explicily defined in Section 11.9. By the way, for the last question of the reporter, there is no issue at all since according to the abstract syntax the association end iterator is already declared as multivalued (see LoopExp::iterator [*] in Figure 8.2). We believe anyway that it is useful to add a sentence in Section 7 stating that 'exists' operator can potentially have multiple iterators since there is no example of this. Also some minor typo fixing is needed in 11.9.
I wrote an issue similar than this one but not equal so, the body could seem equal but it is not the case. I have a few doubts about the iterator variables. Reading the specification I am not sure about, for each iterator, if the type of the iterator variable is expected or not. For example: collection->select( v : Type | boolean-expression-with-v ) collection->select( v | boolean-expression-with-v ) Looking at sections 7.6 and 11.9 my conclusion is the following: -select --> It is NOT obligatory to write the type of the iterator variable. It appears in section 7.6. -reject --> It is NOT obligatory to write the type of the iterator variable. It appears in section 7.6. -collect --> It is NOT obligatory to write the type of the iterator variable. It appears in section 7.6. -forAll --> It is NOT obligatory to write the type of the iterator variable. It appears in section 7.6. -exists --> It is NOT obligatory to write the type of the iterator variable. It appears in section 7.6. -iterate --> In section 7.6 it seems that in both, for the iterator variable and for the accumulator variable, it is obligatory to write the type. -collectNested --> It is NOT obligatory to write the type of the iterator variable. It is a similar case than the collect. -one --> It is NOT obligatory to write the type of the iterator variable. -any --> It is NOT obligatory to write the type of the iterator variable. -isUnique -->It is NOT obligatory to write the type of the iterator variable. Is my conclusion correct in everything? or in which parts am I confused? I think that both, iterator variable and accumulator variable of the iterate iterator should have their types optional. In other words, to write the type of the iterator variable or the type of the accumulator variable should not be obligatory.
It is clear from the various examples in Section 7 that the type declaration of the iterator is optional in collection operations. By default VariableDeclarationCS is defined so that the type of the variable declared is optional. Disposition: Close, no change
have tuple fields and let variables to have the declaration of their types explicity?
By default a VariableDeclarationCS has the type declarator optional unless it is explicitly stated that it should be present. It is mandatory for Let (see disambiguation rules of LetExpCS) but not mandatory for tuples. To avoid that people ask the question again for let expression, we add a sentence in 7.4.3.
In Section 8.2.2, in Classifier well-formedness rules, 'collectionTypes' is used instead of 'collectionType'. This is not correct since in OCL, by convention, when not provided explicitly the name of an opposite role takes the name of the target class with first letter lowerized.
Specification: Object Constraint Language, formal/06-05-01 Section: 7.6 Collection Operations Summary: The concept of transitive closure is very useful for specifying well-formedness constraints on binary relations. For a binary relation r:A->A and elements x,y,z in A, r(x,y) is true when r relates x to y and r is transitive whenever for any x,y,z in A, r(x,y) and r(y,z) imply r(x,z). The transitive closure of a binary relation r:A->A is the smallest relation, ^r:A->A, that contains r and is transitive. In the UML specification, the definition of Classifier::allParents() : Classifier[*] as “all the direct and indirect ancestors of a generalized Classifier” could be equivalently paraphrased as the transitive closure of the Classifier::parents() : Classifier[*] relation. Specifying the notion of transitive closure for the OCL specification can be problematic as this notion refers to a meta-property not expressible in first order logic (i.e., the smallest relation satisfying a given property). However, the notion of transitive closure can be specified in the context of a particular API for evaluating OCL iterator expressions such as that of the Eclipse OCL implementation of the OCL2.0 specification: http://help.eclipse.org/ganymede/index.jsp?topic=/org.eclipse.ocl.doc/references/overview/OCLOverview.html http://dev.eclipse.org/viewcvs/index.cgi/org.eclipse.mdt/org.eclipse.ocl/plugins/org.eclipse.ocl/src/org/eclipse/ocl/internal/evaluation/IterationTemplateClosure.java?root=Modeling_Project&view=markup A synopsis of the algorithm for computing the transitive closure as an OCL iterator expression is available here: http://dev.eclipse.org/newslists/news.eclipse.modeling.mdt.ocl/msg01390.html
The omission of a closure iterator has been noted by many OCL users. The suggestion is practical, but since it is a transitive closure the use of the name closure as in the referenced implementation could be misleading. Conversely the use of a clearer name such as transitiveClosure() is a bit verbose. Since closure() has already started to be used and its usage is clearly associated with a context object rather than a global scope, insisting on the longer name seems unnecessarily pedantic. A closure iterator is specified below generalising the referenced Eclipse MDT/OCL implementation to operate on an OrderedSet as well as a Set. [Design note. An attempt to extract a more generic recurse() building block proved fruitless. A more general recurse might for instance support transitiveExists, transitiveForAll etc. It was not clear that, for instance a Bag of multiple encounters was of any practical use, and the Bag could anyway be generated by an iteration over the transitiveClosure. Similarly an elaboration to allow a user function of the encounters requires two bodies and multiple iterate results. Once again it is easier to provide the simple transitiveClosure and then invoke the user function on the result. Any enhanced efficiency from the combined operation could still be obtained by an OCL 'compiler' that optimises a transitiveClosure(...)->forAll(...).]
Erroneous operation names 'isOclType' and 'asOclType'. The operation 'isOclType' appears four times throughout the document. I presume it refers to 'oclIsTypeOf'. The operation 'asOclType' appears six times throughout the document. I presume it refers to 'oclAsType'.
These typos all occur in Section 10.
The specification of the UnlimitedNatural type is largely missing and often trivially inconsistent.
[The use of e comes from Issue 14197; a much more comprehensive response to Issue 12349 of the missing distinction between ? as invalid and e as null.]
The attached surprisingly large set of revised text recommendations endeavours to resolve every inconsistent use of invalid and null/void types and the failure to update the specification when undefined was split into null and invalid. The recommendations also correct many conversion errors that crept in when Word Processor formats were changed. Once these changes are incorporated, a very careful proof read against at least Annex A of 03-01-07 should be performed. The initial discussion identifies that the approved resolutions of Issues: 6611, 10433, 10434, 12349, 12378, 12484 and 12485 are at best deficient
The resolution of Issue 6611 is wrong. OclAny=(object : OclAny) should not be overloaded for OclInvalid. The resolution violates the principle that invalid results should propagate arithmetically unless explicitly tested using oclIsInvalid() or oclIsUndefined(). The danger of this is clear from the following example: let expr1 : Boolean = eval1() in let expr2 : Boolean = eval2() in expr1 = expr2 If both eval1() and eval2() fail and return invalid, the overall result subject to the Issue 6611 resolution is true. The result must be invalid to propagate invalid. The resolutions of Issue 10433, 10434, 12378, 12484, 12485 are wrong. OclInvalid should remain conformant to OclVoid. None of the resolutions address the massive conflict between Section 8 and Section 11. While neither section is close to self consistent, Section 8 strongly suggests that OclInvalid is the instance of Invalid which is the instance of InvalidType, while Section 11 almost mandates that invalid is the instance of OclInvalid which is the instance of InvalidType. The resolution of Issue 12349 is locally unhelpful through referring to invalid as unknown and totally inadequate to address the issue of two bottoms throughout the remaining text. There is probably little practical difference between the alternative conformance choices for OclVoid and OclInvalid, however the text should be consistent. The original 2.0 Appendix A is sensibly interpreted with bottom (?) equated to invalid. It is just necessary to introduce and equate a nearly-bottom (e) as null and align all the text accordingly.
The well-formedness constraints for IteratorExp are confusing, incomplete and sometimes wrong.
The OCL 2.0 specification would be much easier to read if: 1) The PDF had a full set of titles visible in the bookmarks: 8.3.*, Annex A.2 , Annex B and Index are missing completely. A.1 and A.3 apppear as subsections of 13.3. 2) There are a number of large sections such as 8.3.*, 9.3 and 10.4 with unnumbered headings for each AS or CS class. [11.5 is much better in this respect.] These are not in alphabetical order, not page aligned and not particularly distinct. It would be helpful to a) give them numbers so that they appear in the Bookmarks and are more distinct. b) put them in alphabetical order. [c) consider page aligning them.] [It would be good if the index was much more comprehensive too. e.g "at", "null", "any", "iterator", "UnlimitedNatural" ...]
Issue 7341 resolved that a bad oclAsType in 7.4.6 should return invalid. Issue 10437 resolved that the revised text for bad oclAsType in 11.2.5 should return null. Issue 6532 resolved that oclAsType in 7.5.9. return a Classifier. The changed specification has OclType.
Description: 9.3 Concrete Syntax As a convention to the concrete syntax, conflicting properties or conflicting class names can be aliased using the «_» (underscore) prefix. Inside an OCL expression that is written with the concrete syntax, when a property name or a class name is found to start with a «_›, firstly the symbol is lookup in the metamodel. If not found, the same symbol with the «_» skipped is tried. Should be As a convention to the concrete syntax, conflicting properties or conflicting class names can be aliased using the «_» (underscore) prefix. Inside an OCL expression that is written with the concrete syntax, when a property name or a class name is found to start with a «_», the symbol with the «_» skipped is looked up in the metamodel. Explanation: Consider that some class in the metamodel has two properties called '_self' and 'self' correspondingly. With the resolution rule defined in 9.3 one can never access 'self' property. On one hand, you cannot refer to it directly because it clashed the keyword self. One the other hand, '_self' would refer to '_self' property according to 9.3. Thus, both variants 'aClass.self' and 'aClass._self' are not helpful here.
MDT OCL implementation has assumed that OrderedSet is a subtype of Set. It has become clear (11.6.3) that this assumption was erroneous. As a result, operations which are defined on Sets in the standard library (like including, excluding, intersection, union, etc.) must be undefined on OrderedSet. However, many clients (including the ones of Operational QVT) have already written code relying on this behaviour (i.e. considering that OrderedSet is a subtype of Set, they used operations like including()). It would be very helpful to define such operations on OrderedSet. It would be also important to define these counterpart operations so that they would keep the order of the elements of the initial OrderedSet, e.g: including(object : T) : OrderedSet(T) The OrderedSet containing all elements of self plus object added as the last element. post: result = self.append(object)
Issue 9913 defines the missing InvalidLiteralExpCS and NullLiteralExpCS, but they are never referenced in the grammar. Suggest: Add to PrimitiveLiteralExpCS [E] PrimitiveLiteralExpCS ::= NullLiteralExpCS [F] PrimitiveLiteralExpCS ::= InvalidLiteralExpCS and [E] PrimitiveLiteralExpCS.ast = NullLiteralExpCS.ast [F] PrimitiveLiteralExpCS.ast = InvalidLiteralExpCS.ast (not forgetting UnlimitedNaturalLiteralExpCS
The definition of the CollectionRangeCS grammar is CollectionRangeCS ::= OclExpressionCS[1] ‘,’ OclExpressionCS[2] but everywhere else the operator is '..' Suggest change to CollectionRangeCS ::= OclExpressionCS[1] ‘..’ OclExpressionCS[2]
Define the concrete syntax of a simpleNameCS to avoid punctuation collisions, support Unicode characters, and add a double quoted form with escape sequences for awkward names. Define the concrete syntax of a StringLiteralExpCS to support escape sequences for awkward characters. Define the concrete syntax of RealLiteralExpCS and IntegerLiteralExpCS. Define a variety of effectively reserved words such as true, self, Bag, String as reserved.
See Issue 14583 for a resolution of reserved words and definition of
reservedKeywordCS.
Numbers
A valid integer literal should have no leading zeroes to avoid confusion with
languages that use leading zeroes to indicate octal.
A valid integer (or real) literal should have no leading sign; a unary minus may be
used to create negative values. If a leading minus is part of a number, there is a
problem parsing "5-4" after tokenising as UnlimitedNatural(5) Integer(-4) rather
than UnlimitedNatural(5) Letter(-) UnlimitedNatural(4).
A valid real literal should not have a leading or trailing dot to avoid confusion with
a dot or dot dot operator. e.g. "1..2" should be a collection range rather than "1."
and ".2". Prohibiting the edge dots avoids the ambiguity.
63
Strings
OCL 2.1 defines a string as a character string surrounded by single quotes, but
defines no mechanism for defining a single quote. It is unclear how non-printable
characters such as new-lines should be interpreted within strings, or how nonprintable
characters can be specified in the concrete syntax without causing
problems with text editors and other tools that provide special treatment for nonprintable
characters.
QVT 1.0 Operational Mappings defines a number of Java-inspired extensions,
although it applies Unicode escapes in the Concrete Syntax mapping rather than
the character serialisation. QVTo also defines concatenation of adjacent strings.
Adoption of Java-like escape sequences solves the problem of awkward
characters, although support for octal sequences seems unnecessary in modern
languages; the QVTo specification of octal sequences is flawed ('\111" has three
valid meanings).
Concatenation of adjacent strings is useful.
Introduction of \ as an escape character changes the semantics of '\' which in
OCL 2.0 and 2.1 was a valid string defining a single backslash character,
although many practical OCL 2.0 tools may have anticipated this specification of
backslash sequences.
Identifiers
UML places no constraints on identifier spellings. OCL 2.1 in 9.3 simpleNameCS
echoes this lack of constraint, but fails to identify how the arbitrary Abstract
Syntax can be realised in the Concrete Syntax.
Punctuation should not ever be a valid name in the Concrete Syntax. 9.3
OperationCallExpCS disambiguating rule 3 specifically prohibits the 'conceptual'
example in 7.4.8.
A valid Concrete Syntax name should use a Unicode variant of a letter then
letter-or-digit identifier.
An arbitrary Abstract Syntax name should be expressible by enclosing the
correspondingly arbitrary character sequence in some form of quotes, using
Java-like escaping definitions for awkward characters. The 'conceptual' example
in 7.4.8 should therefore be valid using a quoted form.
64
OCL 2.1 uses single quotes, and although OCL 2.1 does not define any
semantics for double quotes, derived languages uch as QVTo do. It is therefore
appropriate to use the existing underscore prefix for reserved words to prefix a
singly quoted string and so convert the string literal to an identifier. This
accommodates any spelling and since the need for conversion is rare the
clumsiness of three characters is acceptable.
9.3 OperationCallExpCS disambiguating rule 3 should therefore prohibit only
unquoted punctuation and reserved words. a.+(b) or a.and(b) is invalid, but
a._'+'(b) or a._'and'(b) is valid. The prohibition is therefore on the reserved
spelling rather than the use of the referenced operation.
A similar escaping mechanism should apply to awkward characters as defined
for single quoted strings, so that the \= operation can be invoked as a._'\\='(b).
Since the underscore-prefixed single quotes supports any awkward characters,
the OCL 2.0 and 2.1 underscore identifier prefix is redundant. In view of the
inadequacies highlighted in 14224 and the need to avoid the underscore prefix
syntax applying within _'_self', it is appropriate to deprecate the old underscore
prefix with a view to removing it in OCL 3.0.The discussion of Issue 12953 suggests that two members of the RTF agreed that is unclear what T in e.g Set's including(Object : T) means. The first paragraph of Section 11.6 makes clear that the intent of the specification applies to e.g. Set(T) and so the well-formedness rules in 11.7 refer to e.g. Set(T)::including(Object: T), so T is the known element type of the collection. It is therefore a static error to attempt to invoke Set(T) including for an object incompatible with the known element type T. It would be helpful for the Section headings in 11.7 to have a (T) appended so that the 11.6 specification of T was clearly carried over from 11.6 to 11.7. e.g. Replace 11.7.1 Collection by 11.7.1 Collection(T)
The Collection(T)::product(c2 : Collection(T2))
signature carefully uses T2 to distinguish self and argument element types.
The same distinction is missing from
Collection(T)::"="(c : Collection(T))
Collection(T)::"<>"(c : Collection(T))
Collection(T)::includesAll(c : Collection(T))
Collection(T)::excludesAll(c : Collection(T))
Set(T)::union(s : Set(T))
Set(T)::union(b : Bag(T))
etc etc
The current definition makes at least one of
Set{1.0}->excluding(1.0) = Set{1}->excluding(1)
Set{1}->excluding(1) = Set{1.0}->excluding(1.0)
invalid through lack of a suitable collection operation.
For some operations, such as union, a T2 conforms to T well-formedness constraint is appropriate,
but for others, such as removeAll, T2 and T can be independent.
Issue 11098 resolved the missing precedence of let-in as lowest. This requires "2 * let a:Integer=1 in a + 1" to be interpreted as "(2 * (let a:Integer=1 in a)) + 1" making use of a non-trivial let body surprising and needlessly complicated. The problem with the open-ended right hand side can be resolved by assigning let-in the highest atomic expression precedence and defining its resolution as right-associative. The above example then has the obvious meaning "2 * (let a:Integer=1 in (a + 1))". Issue 6544 introduces ^ and ^^ at higher precedence than . and ->. However since these operators can only return left hand arguments for each other, there is no need to assign these to different levels. if-then-else-endif has an intermediate precedence in OCL 2.1. Since this term has keywords at start and end, the term is equivalent to an atomic expression. In so far as precedence is meaningful it is a high precedence. Parentheses should be bulletted at high precedence. Non commutative operators such as / have no defined order of evaluation leaving the value of "8 / 4 / 2" undefined. Binary operators should be specified as left-associative; i.e "(8 / 4) / 2". Section 9.3.2 duplicates 7.4.7.
A non-duplicate replacement for 9.3.2 appears as a practical grammar provided in the resolution to Issue 10439. right-associativity is perhaps not the correct word for the hybrid behaviour of letin that is very high precedence on the left for "let" but very low precedence on the right for "in" to allow the let body to be an arbitrary expression.
[Splitting a major issue off from a number of minor issues in 14357, so that the resolutions do not get confused.] Define a variety of effectively reserved words such as true, self, Bag, String as reserved. Define which Complete OCL reserved words are Essential OCL reserved words.
and, else, endif, if, implies, in, let, not, or, then, xor
These are defined as reserved words in OCL 2.1.
No change; these words should be reserved for Essential OCL.
body, context, def, derive, endpackage, init, inv, package, post, pre, static
These are defined as reserved words in OCL 2.1. There is no need for these to
be reserved words in Essential OCL and consequently in derived languages such
as QVT.
Change; these words to be reserved for Complete OCL only.
false, invalid, null, self, true
These are not defined as reserved words in OCL 2.1 although the grammar
clearly uses them in reserved ways. This is very unusual. For instance true, false,
self/this are reserved in Java/C++.
If literal expression keywords are not reserved, a syntax mechanism to defeat the
occlusion by an implicit source property is required, allowing a reference to
perhaps ::true.
It is possible to define a grammar in which all ambiguous usage favours these
words, so that self::true comprises non-reserved names; very strange. Better to
reserve the names and simplify tooling and readability.
Change; these words should be reserved for Essential OCL.
Boolean, Integer, Real, String, UnlimitedNatural, OclAny, OclInvalid,
OclMessage, OclVoid
These are not defined as reserved words in OCL 2.1 although the grammar
again uses them in reserved ways. This is very unusual. For instance
boolean/bool, int, double, void are reserved in Java/C++.
It seems very undesirable that a nested environment should be able to occlude
resolution of a primitive type name and very confusing that such a name should
be used as a property name. Therefore the primitive type names should be
reserved and therefore always visible rather than selectively visible from a root
environment. If occlusion is permitted, a syntax mechanism to defeat the
occlusion would be required, allowing a reference to perhaps ::Integer.
It is possible to define a grammar in which all ambiguous usage favours these
words, so that Integer::String comprises non-reserved names; very strange.
However My::String seems reasonable and clear. This can be accommodated by
a restricted keyword concept; a restricted keyword may only be used following
a ::.
Change; Boolean, Integer, Real, String, UnlimitedNatural, OclAny, OclInvalid,
OclVoid to be restricted for Essential OCL.
Change; OclMessage to be restricted for Complete OCL only.
Bag, Collection, OrderedSet, Sequence, Set, Tuple
These are not defined as reserved words in OCL 2.1 although the grammar
again uses them in reserved ways. This is unusual. For instance class, struct,
union are reserved in Java/C.
The non-reserved status of the collection type names currently causes only minor
parsing difficulties. Problems are avoidable because the () clause is
unambiguous for type names and the {} clause is unambiguous for literals.
However if Issue 12953 is resolved to allow the collection literal syntax to be
enhanced to allow specification of an element type, such as Bag(String){}, it
becomes difficult for a parser to distinguish the prefix from an implicit source
operation call. Better to restrict the names and simplify tooling and readability.
Change; Bag, Collection, OrderedSet, Sequence, Set, Tuple to be restricted for
Essential OCL.
iterate, forAll, oclIsNew, oclIsInState etc
These are not defined as reserved words in OCL 2.1, although the grammar
again appears to use them in reserved ways.
The apparently reserved usage is very dependent on exact signatures and so
non-reserved usage is also permitted. These words are OCL Standard Library
features rather than types and consequently much more prone to extension in
future specifications.
No change; the grammar should accommodate non-reserved behaviour.
Reserved word corrolaries : primitive type names
In OCL 2.1, primitive type names are not distinct from simpleNameCS and so a
pathNameCS covers a primitive type name. Once primitive type names are
reserved it is necessary first to introduce primitiveTypeCS and oclTypeCS, and
then to use it.
primitiveTypeCS ::= 'Boolean'
primitiveTypeCS ::= 'Integer'
primitiveTypeCS ::= 'Real'
primitiveTypeCS ::= 'String'
primitiveTypeCS ::= 'UnlimitedNatural'
oclTypeCS ::= 'OclAny'
oclTypeCS ::= 'OclInvalid'
oclTypeCS ::= 'OclMessage'
oclTypeCS ::= 'OclVoid'
typeCS ::= primitiveTypeCS
typeCS ::= oclTypeCS
Reserved word corrolaries : self
In OCL 2.1, self is not distinct from a simpleNameCS. This is not true once self is
reserved. It therefore necessary to add
VariableExpCS ::= 'self'
Restricted word corrolaries
Support for restricted keywords needs a definition of restrictedKeywordCS and a
reference to it.
restrictedKeywordCS ::= CollectionTypeIdentifierCS
restrictedKeywordCS ::= primitiveTypeCS
restrictedKeywordCS ::= oclTypeCS
restrictedKeywordCS ::= 'Tuple'
unreservedSimpleNameCS ::= simpleNameCS
unreservedSimpleNameCS ::= restrictedKeywordCS
pathNameCS ::= simpleNameCS
pathNameCS ::= pathNameCS '::' unreservedSimpleNameCS
Disambiguating rule 1 for TupleLiteralExp requires each VariableDeclaration to have a type and initExpression. However some examples in 7.5.15 omit the type, which is easily inferred from the initializer. However neither 8.3.7 nor 9.3 specifies this inference. Presumably the type is optional and to be inferred when omitted.
The expression 'a'.oclAsType(String) is not well-formed since the invocation of oclAsType is an OperationCallExpCS[E] for which String must be an OclExpressionCS. String is intended to be a literal expression with a Classifier value, but there is no well-formed OclExpressionCS that can represent such a value. Syntactically: String could be a VariableExpCS but is not the name of a visible VariableDeclaration. String could be a PropertyCallExpCS[B or C] or AssociationClassCallExpCS[B] but is not the name of a property. A TypeLiteralExpCS is required to allow use of at least typeCS[A] and more flexibly any typeCS.
A TypeLiteralExpCS whose value is a typeCS is required.
LiteralExpCS ::= TypeLiteralExpCS
TypeLiteralExpCS ::= typeCS
This allows any type, albeit with a parsing ambiguity for pathNameCS. This can
be resolved by flattening typeCS and excluding the pathNameCS.
This extension allows Set{'a'}.oclAsType(Set(OclAny)) to be parsed.The second half of 7.3.3 uses a named-self syntax that is missing from 12.2.5. context c : Company inv: c.numberOfEmployees > 50
When Issue 9796 updated terminology to use PropertyCallExpCS, attrOrAssocContextCS should have been updated to propertyContextCS.
Given the following:
context MyClass
def : isaMethod() : Boolean =
let Collection(Operation) myOperations = oclType().oclAsType(Class).ownedOperations()
in myOperations->exists(name = 'isaMethod')
is the value of isaMethod() true or false?
This is a more fundamental way of looking at the AST serializability problem in Issue 12854. (The suggested referredDefinition : Constraint [0..1] will not work because there may be 3 operation constraints and two property constraints.)
isaMethod() = false: OCL defininitions are not first class features and so there is no need to support their serialization.
isaMethod() = true: OCL definitions do as implied by Section 12.5 and provide reusable sub-expressions that can be used in an identical way to an atribute or operation.
It seems that an OCL evaluation needs to be defined in the following way.
Phase 1. Load MOF/UML meta-models and OCL contributions
Phase 2: Merge OCL definitions into MOF/UML meta-models
Phase 3: Execute the OCL to support queries/invariants/... on models
Phase 2 solves 12854 by requiring a merged meta-model to reify all definitions.
How the merged model is serialized is an implementation issueThe absence of synthesized and inherited attributes in 12.2 makes it unclear how an environment is maintained and so makes it unclear whether OCL supports forward and/or backward references. Presumably both forward and backward references are allowed, so a two phase behaviour is needed to enter all definition names in the environment(s) in phase 1 so that they are visible for lookup in phase 2.
12.1, 12.2 refer to UML 1.4. 12.1.1, 12.9, 12.12 defers until UML 2.0 is defined. 12.5, 12.8 uses Attribute and AssociationEnd rather than Property 12.5.1[1], 12.6.1[1], 12.7.1[1], 12.7.3[1] make use of self.constraint.stereotype.name. Constraint has keywords rather than stereotypes
12.5 define a definition body as one or more LetExps. No example wraps the expression as a LetExp. Is this an obsolete specification or an unobserved AST structural constraint? 12.5 defines synthesis of a variable or function, but fails to distinguish these from the equivalent property or operation
12.12: getClassifier and getPackage in text, but findClassifier and findPackage in signatures
12: Why no applicability to Essential MOF models? Although EMOF::Operation has no precondition feature, there is no problem in an operationContextDecl imposing a truth upon the operation. Similarly, if Initial value and Derived values are defined as Constraints in the same way as PreConditions, then the propertyContextDecl can constrain EMOF by imposing a truth upon the Property.default : String even though String is not an Expression
12.12 para 3 "OCl" for "OCL". 12.8 para 1 last sentence, 12.9 para 1 last sentence; both are unreadable. 12.12.2 No [B] rule 12.12.1/12.12.2 contextDeclCS/contextDeclarationCS
12.5.1[3], 12.6.1[2], 12.7.1[2], 12.8.1[2] are TBD.
12.2 defines a syntax for a standalone OCL document, but provides no mechanism to assist an implementation in locating packages or to partition into multiple reusable documents. a) Suggest addition of an ImportDeclarationCS ImportDeclarationCS ::= import StringLiteralExpCS where StringLiteralExpCS is a URI whose MOF/UML model content an implementation should make visible within the root environment. import is a new reserved word. b) Suggest addition of an IncludeDeclarationCS IncludeDeclarationCS ::= include StringLiteralExpCS where StringLiteralExpCS is a URI whose OCL document content an implementation should interpret (at most once) before proceeding. include is a new reserved word. c) Suggest addition of an OclDocumentCS OclDocumentCS ::= (ImportDeclarationCS)* (IncludeDeclarationCS | PackageDeclarationCS[A])* d) Suggest an OclPackage to own the Constraints for each Package and bypass the problem that Constriants do not have distinguishable names as required by Package content.
The iterators of LoopExp and LoopExpEval are not ordered, but the well-formedness constraints on them use ->at() which is only available for ordered collection. Usage of the AST property is subject to a variety of spelling, ordering and multiplicity inconsistencies.
Section 7.6.3 and 7.6.4 define extended variants of forAll and exists that have two iterators.
Figure 8.2 and Figure 13.3 show an unordered * multiplicity for LoopExp.iterator. The positioning of the VariableExp.referredVariable 0..1 multiplicity makes the diagram easy to mis-read.
Section 8.3.1 LoopExp defines iterator as "The iterator variables. These variables are, each in its turn, " implying an ordered collection.
Section 8.3.7 LoopExp [2] and [3] use iterator->forAll implying a collection.
Section 9.3 IteratorExpCS synthesized attributes use iterators->at(1) and at(2) requiring an ordered collection.
Section 9.3 IterateExpCS concrete syntax supports at most one iterator and one accumulator.
Section 9.3 IterateExpCS synthesized attributes use iterator.initExpression requiring a non-collection.
Figure 10.7 shows LoopExpEval.iterators as unordered 1..n.
Section 10.3.1 LoopExpEval defines iterators as "The names of the iterator variables".
Section 10.3.7 IterateExpEval [1] uses iterators->at(1) and iterators->at(2) implying an ordered collection with upper bound 2.
Section 10.3.7 LoopExpEval [1] has a two way if = 1 else, implying the upper bound is 2.
Section 10.3.7 LoopExpEval [3] uses iterators->at(1) and iterators->at(2) implying an ordered collection with upper bound 2.
Section 11.9.1 defines the mapping of forAll to iterate for multiple iterators, but IterateExpCS only supports a single iterator.
The above suggests that the specification should consistently treat iterators as having a 1..2 {ordered} multiplicity.
13.1 states that "EssentialOCL is the package exposing the minimal OCL required to work with EMOF. EssentialOcl depends on the EMOF Package." 13.1 states that "For convenience, because BasicOCL (respectively EssentialOCL) is - conceptually a subset of the complete OCL language for UML superstructure." MOF 06-01-01 defines EMOF and Figure 12.1 clearly shows a merge of Reflection. Therefore EssentialOCL has reflection. UML superstructure has almost everything, so BasicOCL has reflection. Issue 12951 provides the following revised text for 13.2. "The EMOF Reflection capability is not merged to the metamodel." This contradicts the above. If this is intended, OCL needs to redefine an EMOF as perhaps OMOF with the appropriate merges. Issue 9171 discusses why reflection is not available at the modelling level, but is available at the meta-modelling level. Presumably the intent is that MOF Reflection is present in the OCL meta-model, but is not necessarily present in the constrained models and so is not necessarily useable in OCL expressions. The revised text for Issue 12951 should be revisited to align with Issue 9171.
The OCL specification does not make clear whether an iteration over a Collection of Collections should operate on the flattened or unflattened source. The Appendix through lack of specification and explicit specification of flattening would suggest that the iterator for a Collection of Collections is a Collection. Most of the description in Section 7.6 is neutral through use of the term element. However In 7.6.1 "The variable v is called the iterator. When the select is evaluated, v iterates over the collection and the boolean expression-with-v is evaluated for each v. The v is a reference to the object from the collection and can be used to refer to the objects themselves from the collection." implies that the source collection is flattened; at least in OCL 2.0 where collections were not first class objects, this is a contradiction. In OCL 2.1, collections are nearly first class objects and so perhaps there is just an ambiguity. Similarly: In 7.6.2 "When we want to specify a collection which is derived from some other collection, but which contains different objects from the original collection (i.e., it is not a sub-collection), we can use a collect operation." In 7.6.3 "The forAll operation in OCL allows specifying a Boolean expression, which must hold for all objects in a collection:" In 7.6.4 "The exists operation in OCL allows you to specify a Boolean expression that must hold for at least one object in a collection". Suggest that the specification of iteration avoid the use of 'object', sticking only to 'element'. A clarifying paragraph at the end of 7.6.5 should state that for a 0 or 1 deep Collection source, element is a non-Collection object. For an N-deep Collection source, element is an (N-1)-deep Collection.
OCL 2.1 currently specifies an informal run-time meta-model in which all types conform to OclAny. Contributions to this meta-model come from - the user meta-model(s) - the standard library and its extensions - additional constraints Problem 1: An OCL AST for an OperationCallExp has a referredOperation that must be able to reference an operation that may come from any of these sources. Issue 12854 raised the problem of referencing additional operations and attributes. Problem 2: The almost trivial problem of referencing standard library features has not been raised. If an AST is to be portable between one OCL tool and another there must be a standard URI by which for instance OclAny::= is referenced. Where is this URI specified? Problem 3: The semantics of ambiguity resolution between alternative contributions is unclear. UML appears to leave overloading as a semantic variation point, so UML compliance is not helpful. Issue 14591 suggested that a first phase execution created at least a composite UML meta-model. Problem 4: OCL 2.1 made clear that there is no reflection at run-time, and introduced OclAny::oclType to compensate. This provides very limited capabilities, in particular there is no counterpart to Element::container(). A formal run-time model and meta-model can solve these problems. The run-time model is the OCL library model, it's meta-meta-model is the OCL library meta-model and it's meta-meta-meta-model is MOF/UML. NB The OCL library meta-model is not the OCL meta-model. The OCL library model comprises primarily oclstdlib::Classifier instances, one of which is named OclAny. OclAny::oclType() returns its oclstdlib::Classifier (NB not a uml::Classifier). The oclstdlib::Classifier::conformsTo property (like but not uml::Classifier::general) contributes to the reified type conformance hierarchy. The oclstdlib::Classifier::operations property (like but not uml::Classifier::operations) unifies the three sources of available operations, and three different derivations of oclstdlib::Operation accommodate the three types of contribution. The oclstdlib model therefore integrates the user's UML meta-model with the standard library and additional constraints and is built during the first phase of execution. The oclstdlib meta-model is much simpler than MOF; there is no need for Associations and ConformsTo is the only Relationship. The semantics of the oclstdlib model defined independently of UML ensure a clear definition of the meaning of OCL execution. The oclstdlib model should make no pretence at being UML because it is fundamentally different. One form of oclstdlib::Operation integrates a reference to a uml::Operation into a uniform behavioural structure. oclstdlib::Classifier ::conformsTo provides the modification of the user meta-model to insert OclAny as the bottom type, without modifying the user meta-model. With an oclstdlib metaModel, OclAny could provide reflective capabilities such as oclContainer(), oclContents(), oclGet(), oclSet() etc that provide useful reflective capabilities. self.oclType().operations can satisfactorily return a collection of operations even though the operations come from three diverse sources. self.oclType()->closure(conformsTo) will return the type conformance ancestry.
subclause [4] It reads: names->tail() It should read: names->subSequence(2, names.size()) Rationale: tail() is not an operation of Sequence
Since there is no head() operation, it is not obvious that a tail() operation is merited.
(Related to Issue 7539) It reads: isOclKind It should read: oclIsKindOf Rationale: per section 7.5.9 the operation name is "oclIsKindOf"
Continuing on from the Issue 14094 resolution: This typo occurs once in Section 9.4.1 and twice in Section 10.
Related to Issue 7539) It reads: isOclKind It should read: oclIsKindOf Rationale: per section 7.5.9 the operation name is "oclIsKindOf"
(subclause [4])
It reads: let firstNamespace : ModelElement ... in ...
self.nestedEnvironment().addNamespace(firstNamespace)
It should read:
self.nestedEnvironment().addNamespace(firstNamespace.oclAsType(Namespace))
Rationale: the signature of addNamespace is (ns: Namespace) as defined in 9.4.1 subclause [7]
It reads: lookupAttribute It should read: lookupProperty Rationale: on section 8.3.8 an operation lookupProperty(attName : String) : Attribute is added to Classifier. The operation lookupAttribute is never defined in OCL or UML infra/superstructure (v2.1.2)
subclause [10]) It reads: let foundElement ... in result = if foundAttribute ... else foundElement ... (foundAttribute is undefined, I understand it means to "foundElement")
There are references to Attribute (from Core) in sections 7.5 , 8.2, 8.3.2, 8.3.8, 8.3.9, 9.3, 9.4.1, 10.3.2, 10.4.1, 10.4.3 while the UML infrastructure defines Property instead of Attribute
9.4.2 NamedElement
NamedElement, as defined by OCL, links to ModelElement (from Core) and has an operation getType(): Classifier
Postconditions are given when the referred modelelelement is an instance of Classifier, VariableDeclaration or State.
However, from subclause [4] of section 9.4.1 it follows that the referred modelelelement may also be an instance of Namespace.
(let firstNamespace : ModelElement = lookupLocal( names->first() ).referredElement, where lookupLocal returns an OCL NamedElement)
In the UML Infrastructure, Namespace specializes Core::NamedElement, which does not defines a type attribute (Core::TypedElement does)
Namespace is a generalization of Classifier.
At least, add:
post: referredElement.oclIsKindOf(Namespace) implies
result = -- TBD: when aligning with UML 2.0
Should it be result.oclIsUndefined() ?OCLAny::=() is defined as 'True if self is the same object as object2.'
This is not overloaded for numeric types, and it is not specified that a numeric value may not have multiple instances.
The definition therefore implies that:
1 = 1
may often evaluate to false, and that
1.0 = 1
must evaluate to false even though (1.0 <= 1) and (1.0 >= 1) will evaluate true
Suggest overload {Boolean, Real, String}::{=,<>} to use values rather than objects.
The OrderedSet well-formedness constraints in 11.7.3 appear to have been
copied and pasted from Sequence. They need revision to consider the Set
consequences of .
Addition operations (includes, insertAt, union, append, prepend) have a
post-condition that the size increases, which is clearly not the case if
an additional element is equal to a pre-existing element.
In the particular case of insertAt there is an ambiguity as to whether
the insert index is the pre or post index. For instance when inserting 3
at index 5 into OrderedSet{1, 2, 3, 4, 5, 6} the pre-index insertion
yields OrderedSet{1,2,4,3,5,6} whereas the post-index insertion yields
OrderedSet{1,2,4,5,3,6}. While the post-index insertion satisfies the
'post: result->at(index) = object' constraint, it is presumably not the
intent.
The specification is very vague as to how and when a non-collection is converted to a collection.
11.2.3 states that 'If the source is the null literal, it is implicitly converted to Bag{}'.
7.5.3 states that 'Such a single object can be used as a Set as well. It then behaves as if it is a Set containing the single object. The usage as a set is done through the arrow followed by a property of Set.'
The collection type inconsistency between Bag{} and Set{x} makes compile-time type resolution difficult, since the null-ness of x cannot be known till run-time. It would be better to have either Set or Bag uniformly as the conversion collection type. Bag{} as the least useful seems more appropriate.
When a conversion is applicable is unclear.
In the example, self.manager->isEmpty() is intended to be interpreted as
if self.manager.isUndefined() then Set{} else Set{self.manager} endif->isEmpty()
so that null->isEmpty is also valid.
However is
null->excludesAll(null)
equivalent to
Bag{}->excludesAll(Bag{})
and so true?
A simple policy of 'wherever a collection is required and a non-collection is provided perform an implicit conversion to collection-literal' resolves this.
However are
null = Bag{}
or
Bag{} = null
both equivalent to
Bag{} = Bag{}
and so true?
In this case we have a problem of asymmetric overloading.
null = Bag{} satisfies the signature for OclVoid::=(OclAny) and so returns false.
Bag{} = null could satisfy the signature for Bag::=(Bag) and so return true with the help of an implicit conversion.
Presumably an additional OclVoid::=(Collection) overload is needed to restore symmetry.
Collection::flatten is overloaded for Bag, Sequence and Set but not for OrderedSet.
excluding and including are defined for Bag, Sequence and Set but not OrderedSet or Collection. The Collections would be more consistent with an OrderedSet::excluding and an OrderedSet::including. With all concrete Collection types defining excluding and including, the abstract Collection could also define Collection ::excluding and an Collection ::including supporting fully polymorphic addition and querying of collections.
The minus operation should be provided for OrderedSet as well as Set.
11.2.3 states clearly that "Any property call applied on null results in OclInvalid, except for the operations oclIsUndefined() and oclIsInvalid()." This is being revised by Issue 14197 in OCL 2.3 to: "Any property call applied on OclVoid results in invalid, except for the operations oclIsUndefined(), oclIsInvalid(), =(OclAny) and <>(OclAny)."
11.2.4 states clearly that "Any property call applied on invalid results in OclInvalid, except for the operations oclIsUndefined() and oclIsInvalid()." This is being revised by Issue 14197 in OCL 2.3 to: "Any property call applied on OclInvalid results in invalid, except for the operations oclIsUndefined() and oclIsInvalid()."
Therefore invalid.oclIsTypeOf(OclInvalid) => invalid and null.oclIsTypeOf(OclVoid) => invalid.
But the above are widely used in the specification as for example:
"oclIsUndefined() : Boolean
Evaluates to true if the self is equal to OclInvalid or equal to null.
post: result = self.isTypeOf( OclVoid ) or self.isTypeOf(OclInvalid)"
clearly expecting isTypeOf (a typo) to return true/false, not invalid sometimes.
Issue 14197 relaxed the OclVoid property list to allow = and <>. Perhaps all oclXXX operations should have an explicitly defined semantics for OclVoid and OclInvalid, supporting rather than denying reflective usage of the values as in self.isTypeOf( OclVoid ).
OCL supports feature overloading and attempts to comply with UML. OCL does not define feature overloading itself. UML leaves feature overloading as a semantic variation point.
The OCL behaviour is therefore undefined. However a variety of behaviours particularly those involving null and invalid only make sense if operations are selected at run-time according to the dynamic type.
The example from an earilier pending issue:
Sequence(OclAny){3, 3.0, '3'}->count(-(-3)) = 2
wherein
UnlimitedNatural 3 widens to Integer 3 for successful comparison with Integer 3
Real 3.0 is successfully compared to Integer 3 widened to Real
String '3' widens to OclAny and fails to compare to Integer 3 widened to OclAny.
is difficult to realise if static type resolution is applicable in which case all pair-wise value comparisons would use OclAny::= rather than Real::=.
Suggest:
OCL define that features are selected dynamically at run-time.
8.3.8 states that in regard to allInstances
"returns all instances of the classifier and the classifiers specializing it. May only be used for classifiers that have a finite
number of instances. This is the case, for example, for user defined classes because instances need to be created explicitly,
and for enumerations, the standard Boolean type, and other special types such as OclVoid and OclInvalid."
While it is true that OclInvalid has exactly one instance, the corresponding return of Set{invalid} is not well-formed.
Therefore the invocation OclInvalid.allInstances() must return invalid.
Suggest:
Replace "and OclInvalid" by ". But not for OclInvalid, for which the return is invalid"
As summarised, the consistent return of Set{invalid} is not well-formed so the actual
return must be invalid, which the text should indicate.
Migration of allInstances to Classifier by Issue 6532 has left it undefined for non-
ClassifiersThe Issue 14981 considered use of explicit null as a Collection.
11.2.3 states that 'If the source is the null literal, it is implicitly converted to Bag{}'.
Surely when the null arises as a navigation result, the isOrdered and isUnique characteristics of the navigated property should determine what CollectionKind the null result is converted to?
However meta-modelling tools and meta-modellers pay little attention to the isUnique and isOrdered characteristics of zero and unit multiplicity properties. Using this overlooked information may cause surprises.
Collection::sum is defined to exploit an associative and commutative T::+(T). However for an empty collection, the result must be a zero value of the user defined type and there is no mechanism to determine its 0. Suggest: require a T::zero() and provide corresponding Real::zero() and Integer::zero() and UnlimitedNatural() operations.
Revised Text: (DO NOT APPLY REVISION SINCE FINAL DISPOSITION IS DEFERRED) In 11.4.1 Real add oclZero : Real The additive identity. init: 0.0 oclOne : Real The multiplicative identity. init: 1.0 100 In 11.4.2 Integer add oclZero : Integer The additive identity. init: 0 oclOne : Integer The multiplicative identity. init: 1 In 11.4.3 String add oclZero : String The additive identity. init: '' In 11.5.? UnlimitedNatural add oclZero : UnlimitedNatural The additive identity. init: 0 oclOne : UnlimitedNatural The multiplicative identity. init: 1 In 11.6.1 sum() replace Elements must be of a type supporting the + operation. … Integer and Real fulfill this condition. post: result = self->iterate( elem; acc : T = 0 | acc + elem ) by Elements must be of a type supporting the + operation and the oclZero property. … The oclZero property provides the additive identity. UnlimitedNatural, Integer, Real and String fulfill this condition. post: result = self->iterate( elem; acc : T = T::oclZero | acc + elem ) Disposition: DEFERRED NOTE: The vote did not passed for this issue (initial disposition was Resolved). 101 Reason : Issue 15010 uses redefined properties with covariant types. Once the Standard Library is aligned with UML, this usage will not be allowed
Issue 6555 introduced the 'missing' Collection::=(Collection(T)) and Collection::=(Collection(T)).
Issue 12948 changed Collection to conform to OclAny
This means that "Set{} = 1" is no longer self-evidently invalid.
According to the inherited OclAny::=(OclAny), "Set{} = 1" should be semantically legal and evaluate to false.
But if Collection::=(Collection(T)) fully occludes OclAny::=(OclAny) ,"Set{} = 1" should be a semantic analysis failure and so invalid.
Conversely "1 = Set{}" is OclAny::=(OclAny) and unambiguously false (until a Real::=(Real) overload is introduced to accommodate value rather object identity).
OCL does not specify any policy for static or dynamic resolution of overloads.
A Java-like policy of static determination of the most derived valid signature, then dynamic dispatch on the self object would seem appropriate, but:
let c1 : OclAny = Set{1}, c2 : OclAny = Set{1} in c1 = c2
must select OclAny::=(OclAny) as the static signature. Collection::=(Collection(T)) is not a derived operation with the same signature, so evaluation should use OclAny::=(OclAny) rather than Collection::=(Collection(T)) and give erroneous results swhen the collections are compared by object identity rather than collection kind and content.
Either:
OCL must specify multi-dimensional dynamic overload resolution on source and arguments
Or:
OCL should specify Java-like single-dimension dynamic overload resolution and the signature of derived operations such as Collection::=(Collection(T)) should be changed to match their inherited signature, i.e. to Collection::=(OclAny).
[Or:
All derived functionality must be folded into the base (OclAny) operation.]
Section 10 is suffering seriously from lack of update and review.
The old AssociationClassCall/AssociationEndCall/ModelPropertyCall spellings are in use throughout.
OrderedSetValue is omitted throughout.
UnlimitedNaturalExpValue is omitted throughout.
TypeExpEval is omitted throughout thereby avoiding tackling the irregular semantics of the oclIsKindOf argument.
'undefined' does not distinguish null and invalid and is variously undefined, void, UndefinedValue, OclVoidValue and UnspecifiedValue including a reference to UnspecifiedValueExp that does not exist. There should be just an OclVoidValue and an OclInvalidValue.
OrderedSet is not used where elements are clearly unique e.g. Sequence(LocalSnapShot).
OCL is regularly spelled ocl or Ocl as a non-word prefix.
An Element::indexNr is imposed on all Collection elements. Surely a distinct OrderedCollectionValue intermediate value should use the stronger OrderedCollectionElement.
It is not specified whether Element::indexNr indexes from 0 or 1 or indeed even monontonically.
Figure 10.4 omits many {ordered}and {unique} constraints.
Figure 10.4 omits LocalSnapShot.pred and succ.
10.2.1 Element assserts that Element is a tuple NameValueBinding.
10.2.1 OclMessageValue italicises the wrong use of 'name'.
10.2.2 LocalSnapShot[1] refers to ispre rather than isPre.
10.2.2 LocalSnapShot[2] asserts that the result of an implicit collect is a boolean (missing ->any).
10.2.2 ObjectValue omits the doubly-linked list validity constraint
10.2.2 TupleValue assserts that a NameValueBinding is an Element.
10.2.3 SequenceTypeValue omits a constraint on the sequential validity of Element.indexNr
10.2.3 LocalSnapShot uses notEmpty rather than nonEmpty()
10.3 para 2 refers to a non-existent OclEvaluation class
10.3 para 2 has erroneous figure references to 10.6,7 rather than 10.7,8
10.3.2 OperationCallExpEval relies on UML semantics, but fails to resolve UML's unspecified behavioural variation point on operator overload resolution. See Issue 15013.
10.3.2 OperationCallExpEval spells forAll as forall.
10.3.2 CollectionRangeEval uses isOclType(Sequence(Integer)). Any such use of collection types was invalid in OCL 2.0. Use of a collection type is not valid concrete syntax in OCL 2.1/2. The resolution of 10439 for OCL 2.3 provides concrete syntax support, but the semantics remains undefined although perhaps intuitively obvious.
As separately raised isOclType etc are incorrect spellings.
The x .. y syntax could be used to advantage in places such as 10.3.3 CollectionRangeEval.
The explicit iterator is unnecessary in for instance 10.2.2 TupleValue.
Figure 10.14 has layout problems.
Figure 10.14 shows instances <-> model associations for both Concrete and Abstract classes. The model for derived classes should be marked as derived.
10.4.2 BooleanLiteralExpEval has an unresolved MOF/UML alignment.
10.4.2 EvalEnvironment has a missing constraint on uniqueness of binding names.
10.4.2 IfExpEval has missing and operators
Generally: the constraints should be validated by an OCL checking tool.
Sections 12.5.1, 12.6.1, 12.7.1 specify the "invariant", "precondition", "postcondition" spellings. Sections 12.8, 12.9, 12.10, 12.11 do not specify their corresponding spellings. Suggest: "initial", "derivation", "body", "guard" as the conventional adjective used to qualify "constraint".
OCL allows a user to define a run-time OCL meta-model through Property and Operation definitions that is based upon a specification-time UML meta-model. It would be useful to allow a user to also introduce inheritance/conformance polymorphisms. Thus: context CommonPackage::CommonObject context CommonPackage::CommonObject::isSerializable() : Boolean = false context OCL::String conformsTo CommonPackage::CommonObject context MyPackage::MyObject conformsTo CommonPackage::CommonObject context YourPackage::YourObject conformsTo CommonPackage::CommonObject could mix-in the capabilities of CommonObject to each of MyObject and YourObject and String. This would allow common functionality to be mixed in once and used polymorphically rather than being added in amorphously and requiring an if-tree of per-context invocations of that functionality.
OCL 2.2 defines equalsIgnoreCase as returning an Integer. Given that the operation determines equivalence of two Strings, I would expect it to return Boolean: either the strings are equivalent (true) or they are not (false).
The OCL 2.2 definition provides no indication as to what the Integer return might signify, the definition is therefore useless. Presumably the intent is to provide similar functionality to Java's java.lang.String.equalsIgnoreCase(String) : Boolean.
OCL supports access to a variety of properties such as self.a, self.b, self.c but provides no mechanism for indirection of the property selection.
Perhaps that the standard library support reflection more effectively with:
self.oclGet(MyClass::a)
UML models may explicitly declare that a Property is not navigable in order to simplify the complexity of the run-time representation of that Property. In an EMOF representation, the non-navigable Property is missing and so an OCL constraint cannot use it, even though the OCL constraint is used at compile-time rather than run-time. In a UML direction, a Property may be unnamed in one direction and the implicit naming of such opposites may be inadequate to permit unambiguous usage. QVT Relations 1.1 partially works around this by introducing an opposite(Property) declaration that may be used for Keys and PropertyTemplateItems. OCL, rather than QVT, should provide an ability to navigate a Property in an opposite direction. In the Abstract Syntax, OppositePropertyCallExp is required to capture the inverse navigation semantics of PropertyCallExp. In the Concrete Syntax, some alternate navigation operator is required. Perhaps "a.~b" indicates that "b" is in an inverted direction.
At the end of Section 7.4.6 OCL 2.2 says "For example, if class Employee redefines the age() : Integer operation of the Person class, a constraint may access the Person definition as in context Employee inv: self.age() <= self.Person::age() For clarity, the qualified form may only be used with an explicit source expression." and in Section 7.5.8: "Whenever properties are redefined within a type, the property of the supertypes can be accessed using the oclAsType() operation. Whenever we have a class B as a subtype of class A, and a property p1 of both A and B, we can write:" a clarifying example follows that is actually a disambiguation not a redefinition. In UML redefinition replaces an old definition with something else, which is not what the above excerpts imply. In the case of redefining "Person::age() : Integer". If the redefinition is "Employee::age() : UnlimitedNatural" the redefinition is compatible (valid UML), so perhaps self.age() being UnlimitedNatural and self.Person::age() being Integer just might be useful. But allowing them to invoke different operation bodies seems to violate UML. Suggest that use of a path qualification may select an occluded definition signature for static analysis, but may not use a redefined value or body. [This then avoids a need for the AST to persist the distinction between X::y as an explicit feature for static resolution or as an implicit feature for dynamic resolution. All features in the AST are identified by static analysis and evaluated by dynamic resolution.]
At the end of Section 7.4.6 OCL 2.2 says "For clarity, the qualified form may only be used with an explicit source expression." thereby requiring "self.Person::age()" rather than just "Person::age()". This 'clarity' is surely just a stylistic issue. An organisation may advocate an OCL-style guide that discourages the use of implicit-self. That is a free choice made by that organisation. It does not seem appropriate for one corner of the OCL specification to prohibit implicit-self where consistency would imply that it should be present. This is not a 'clarity', it is a confusion. Suggest allow implicit-self before qualified path names (unless there is a different strong technical reason.)
Section 7.5.4 describes an association navigation qualification to
accommodate
recursive associations.
e.g. self.employeeRanking[bosses]
in which "bosses" is a Property role name.
OCL 2.2 has no concrete syntax for this. Superficially it resembles an
AssociationClassCallExp, but that requires OclExpression values for its
qualifiers.
Prior to OCL 2.0 (and still present in many obstinate residual artefacts in
OCL 2.2),
there was an AssociationEndCallExp, whose syntax was identical to an
AssociationClassCallExp
and so it was removed and merged with AttributeCallExp as PropertyCallExp.
It would appear that a form of AssociationEndCallExp is required with
syntaxes
OclExpressionCS '.' pathNameCS[1] ('[' pathNameCS[2] ']')? isMarkedPreCS?
pathNameCS[1] ('[' pathNameCS[2] ']')? isMarkedPreCS?
in which pathNameCS[2] defines the NavigationCallExpCS.ast.navigationSource
that is currently completely undefined and very confusingly described in
Section 8.3.2:
"navigationSource The source denotes the association end Property at the end
of the object itself. This is used to
resolve ambiguities when the same Classifier is at more than one end (plays
more than one
role) in the same association. In other cases it can be derived."
Suggest:
Remove NavigationCallExp::navigationSource that currently has no semantics
Introduce QualifiedPropertyCallExp (and etc.) as a further NavigationCallExp
to support
the qualified navigation. It has two associations:
referredSourceProperty: Property (e.g. "bosses")
referredTargetProperty: Property (e.g. "employeeRanking").
Collection::sum() requires that its T::+() is commutative and associative. Associativity is necessary for predictable results. However what if it isn't? Is there an obligation on the OCL runtime to detect non-associativity and return invalid? - probably not possible. Is there a permission on the OCL runtime to detect non-associativity and return invalid? - difficult to ensure implementation portability Is there just an informal caution to users that non-associativity may lead to unpredictable results? Suggest: reword to permit an implementation to return invalid and caution users about unpredictable results.
No. Both associativity and commutativity are necessary for predictable results on arbitrary collections. (Issue 15223 relaxes both for ordered collections.) Yes. It does not seem reasonable to require an implementation to detect a lack of associativity or commutativity, so reword to permit and warn as suggested.
Collection::sum() requires that its T::+() is commutative and associative. Associativity is necessary for predictable results. Commutativity is not necessary, most trivially for String::+ for which sum() could usefully concatenate an OrderedSet. Suggest: remove the requirement for commutativity.
Yes. Introduction of String::+() as a shorthand for String::concat() makes the suggestion a natural extension, but only for OrderedCollections. No. Neither associativity nor commutativity is necessary for OrderedCollections
The new toUpperCase, toLowerCase and equalsIgnoreCase refer to case conversion if appropriate to the locale without ever defining what a locale is or defining the preconditions for appropriateness. These methods closely resemble Java Library methods, perhaps they should reference rather than duplicate the Java specification. The Java toUpperCase method provides locale-dependent and local-independent variants. Is it right for OCL to make it difficult to achieve predictable results under a Turkish locale? It seems that the OCL standard library must provide access to the Locale and provide both Java's toUpperCase variants.
Introduction of a Locale class into the OCL Standard Library to allow a Locale to be passed as an additional argument to all locale-dependent functions is a rather heavyweight solution to this problem. It seems much simpler to define OclAny::oclLocale as the default locale, with oclLocale in the current context as the prevailing locale so that users may temporarily change locale using a let expression. (Issue 15134 corrects the 'locale' reference in equalsIgnoreCase).
Issue 9796 responded to the problem with the undefined (and undefinable) withAtPre(). However the textual replacement of ".withAtPre()" by ".isPre = true" is not valid. For instance [D] AttributeCallExpCS.ast.source = if isMarkedPreCS->isEmpty() then OclExpressionCS.ast else OclExpressionCS.ast.withAtPre() endif should be elaborated to: [D] AttributeCallExpCS.ast.source = OclExpressionCS.ast [D] AttributeCallExpCS.ast.isPre = isMarkedPreCS->notEmpty()
Issue 9796 responded to the merge of Attribute and AssociationEnd as Property in UML
by merging AttributeCallExp and AssociationEndCallExp.
This merge was not appropriate since UML made no change to the required OCL navigability.
Without AssociationEndCallExp, it is not possible to express a qualified association navigation,
since the 'replacement' PropertyCallExp does not allow for the qualifiers in:
self.customer[123456]
Issue 7341 changed a number of syntaxes to permit a PathNameCS rather than a SimpleNameCS, so that scope ambiguities could be resolved. It is not clear why this was applied uniformly to all syntaxes where a name reference is in use. As a minimum it just gives the user the discretion to clarify a subtle statement, and it avoids the impression that pathed-names are special. It also avoids the need for some very similar concrete syntax expositions. More specifically in an AssociationClassCallExpCS it would allow disambiguation of Left::Link and Right::Link as alternate AssociationClasses. Suggest allow PathNameCS in all places where there is not a specific requirement for a SimpleNameCS.
In accordance with Nicolas Rouquette's observations in the discussion on "15233 -- OCL 2.2 Correction to Issue 9796 for AssociationEndCall": The problem with OCL 2.2, Fig 7.1 are: - give a name to the association end near Bank, e.g. 'bankAccount' - fix the multiplicity of: Person::bankAccount from 0..1 to * -- i.e., a person can have zero or more bank accounts! - fix the multiplicity of Bank::customer from 0..* to 0..1 -- i.e., there is zero or one customer for a given 'accountNumber' value. - give a name to the association itself, e.g., BankAccount, or, if you want to use the UML notation convention, A_customer_bankAccount and The OCL examples for Figure 7.2, currently: context Person inv: self.employeeRanking[bosses]->sum() > 0 context Person inv: self.employeeRanking[employees]->sum() > 0 context Person inv: self.employeeRanking->sum() > 0 -- INVALID! context Person inv: self.job[employer] should be fixed to: context Person inv: self.EmployeeRanking[bosses]->sum() > 0 context Person inv: self.EmployeeRanking[employees]->sum() > 0 context Person inv: self.EmployeeRanking->sum() > 0 -- INVALID! context Person inv: self.Job[employer] That is, 'EmployeeRanking' is the name of the association shown in Fig 7.2 That figure does not have anything called 'employeeRanking' and it is misleading to suggest that in OCL the name of the association could be written with a lowercase initial letter when the name of the association itself has an initial capital letter. Since lexical names are case-sensitive in both UML and OCL, case-sensitivity should be respected to avoid creating confusion and potential ambiguity with other names that are lexically different only by their upper/lower case letter. and In particular, the text in clause 7.5.4 about using the name of an association class with a lowercase initial letter should be removed. That is, change the following, currently: To specify navigation to association classes (Job and Marriage in the example), OCL uses a dot and the name of the association class starting with a lowercase character: context Person inv: self.job The sub-expression self.job evaluates to a Set of all the jobs a person has with the companies that are his/her employer. In the case of an association class, there is no explicit rolename in the class diagram. The name job used in this navigation is the name of the association class starting with a lowercase character, similar to the way described in the sub clause “Missing AssociationEnd names” above. to: To specify navigation to association classes (Job and Marriage in the example), OCL uses a dot and the name of the association class: context Person inv: self.Job The sub-expression self.Job evaluates to a Set of all the jobs a person has with the companies that are his/her employer. In the case of an association class, there is no explicit rolename in the class diagram. The name Job used in this navigation is the name of the association class.
The summary summarises a thread discussion. Introduction of the new names in Figure 7.1 is not absolutely necessary, but it may prove helpful in discussions and related examples. CustomerAccount seems better than BankAccount since there is no possibility of 111 misinterpretation as a case conversion with respect to another name. The multiplicities in Figure 7.1 are surprising, but not actually wrong. The suggested replacements are better, although they do not accommodate a joint account. While aligning association names with UML, it seems appropriate to make the corresponding association end name alignment clearer.
I hope someone can explain to me why OCL does not have a reference to "super" (similar to the existing reference to "self"). Wouldn't you want to sometimes call the redefined version of an operation from an OCL exrpression, similar to how you can do that in Java? From my limited knowledge of ALF (the action language), I understand it supports the "super" reference, so this tells me there is no semantic restriction there?
I've seen, in the version 2.0, the existence of the keyword 'attr'. But then, in fact, there isn't any reference or explanation about the use of this keyword. I've seen that this keyword is not in the new versión 2.2. But, you use it in the page 25, ln 12.
The 'attr' is a relic of a former (pre OCL 2.0) syntax. The 'attr' should be omitted, and 'TupleType' should be 'Tuple'. [UML compliance, as observed in Issue 15235, requires 'Job' rather than 'job']. This issue is resolved as part Issue 12456. Disposition: Deferred NOTE: Initialdisposition: Merged with 12456. Issue is Deferred since votation did not pass. Reason: (missing merged resolution 12456)
The oclIsInState takes an OclState argument, which is referenced extensively in Annex A, although the OclState type is never defined in the main text and is not mentioned in the grammar as a reserved word. oclIsInState is misspelled as oclInState 7 times in Section 7.5.9 and once in A.2.6.
The intro to Section 8.2 states:
"OCL is a typed language. Each expression has a type that is either
explicitly declared or can be statically derived."
However OclMessage lacks type parameterisation and so the 7.7.2 example
context Subject::hasChanged()
post: let messages : Sequence(OclMessage) = observer^^update(? : Integer, ?
: Integer) in
messages->notEmpty() and
messages->exists( m | m.i > 0 and m.j >= m.i )
only works if the type analysis proceeds beyond "messages :
Sequence(OclMessage)" to
discover the initialiser with formal signature "Observer::update(i :
Integer, j : Integer)".
This will not in general be possible and so expressions such as "m.i > 0"
cannot be
statically checked, and cannot be dynamically expressed. Indeed since m is
an OclMessage,
"m.i" is not well-formed.
Suggest that OclMessage is redefined as:
OclMessage<OclOperation> or OclMessage<OclSignal>
requiring the type to be determinate or discovered by oclAsType.
symmetricDifference: is defined as (S1 u S2) - (S1 u S2), but this always yields the empty set. I believe the intended writing is (S1 u S2) - (S1 n S2).
Absolutely. This is another corruption resulting from the migration of the Latex Annex A of 03-10-14 (which is correct) to FrameMaker. Looking at Table A.4 suggests that all n have been converted to ?. The entire Annex must therefore be checked for every occurrence of ?.
The use of OclState in the specification is not defined in the normative part of the specification, where it appears solely as OclAny.oclIsInState(statespec : OclState). A corresponding StateExp exists to convey this as a referredState of type State. Surely the OclState type is redundant and it should be OclAny.oclIsInState(statespec : State)? The use of OclState in Annex A may be helpful, so perhaps an introduction to Annex A could explain the mappings between the names used for clarity in Annex A and those used in the normative specification. Aren't a StateValue and StateExpEval needed to define the semantics? Isn't a StateExpCS needed to define the abstract/concrete syntax? Perhaps this could merge with TypeExpCS, TypeLiteralExpCS as ModelElementLiteralCS.
Further to Bran Selic's observation on Issue 15357 that UML-specifics should not really impact the OCL core. This is easy for State via a ModelLiteralExp, but hard for Message which has associated concrete syntax.
The expression grammar could be made extensible to accommodate custom/orthogonal infix, prefix, suffix, precedence if an expression could be parsed by the generic:
expr ::= affixed (infix affixed)*
affixed ::= prefix* suffixed
suffixed ::= atom (suffix | '(' expr ')' | '[' expr ']' | '{' expr '}' )*
atom ::= '(' expr ')'
| name
| 'if' expr 'then' expr 'else' expr 'endif'
| 'let' expr 'in' expr 'endlet'
The major problem is the missing 'endlet', which makes accurate parsing difficult and complex expressions easy for humans to misinterpret too.
Suggest introduce the 'endlet' keyword.The text in the clause titled “Qualifying association ends with association names” points out that it is possible to qualify an accessed role name with the name of the association using the ‘::’ separator. (In the example: aC1.A1::c2.) There is no issue with this as a means to access the associated instance. However, in doing so, the clause misses the opportunity to also say that it is also possible to reference the same associated instance using the ‘.’ (dot) operator in place of the ‘..’ separator, (for example: aC1.A1.c2). While this was also true prior to OCL 2.2, only the later technique was referenced in OCL 2.0. Clarification is needed with respect to whether or not there are any semantic differences between the uses of these two techniques. Where the functionality overlaps, is there a preferred technique? Nit: the last sentence of the example: “If a C1 is aC1 access, aC1.c2 will not be valid since it is ambiguous, whereas aC1.A1::c2 or aC1.A2::c2 will be valid.” Should probably say: “If aC1 isa C1, then aC1.c2 will not be valid since it is ambiguous, whereas aC1.A1::c2 or aC1.A2::c2 will be valid.”
The AS is referred to in a number of places as an abstract syntax tree. This is a misnomer that causes confusion in some academic circles. The AS should always be referred to as a Graph.
OCL supports definition of constraints, but it is difficult for tools to offer better error messages to a user than 'Constraint <constraint-name> violated for <constrained-element-name>'.
It would be helpful if Constraints had an additional String-valued expression to be evaluated in the context of the error, so that tools could evaluate it and present the result to the user.
Suggest add an optional argument to the (not-optional) constraint name. e.g.
inv ConstraintName('Unable to find ' + self.target.name): ...
UML defines Enumeration.ownedLiteral as an ordered set. Surely allInstances() should therefore return an OrderedSet for an enumeration, and perhaps an ordinal property should be added by the Standard Library.
UML supports generics/templates. OCL doesn't. This is a UML alignment failure.
The OCL 2.2 specification refers to stereotypes in the UML 1.x sense. These need to be aligned with UML 2.x. Are they 'keyword' or 'Stereotype'? Is there an OCL Profile to be applied? NB. the sterotypes are of two forms: a) Constraint role: invaraint/precondition/... b) UML extension: OclHelper for a Complete OCL def (see 7.4.4.)
In A.2.1.2 Operations on p193, toLowerCase is referred to as toLower "case translations are possible with toUpper and toLower" and again in Table A.1 Also toUpperCase is referred to as toUpper in the same places
In section "11.4.3 String" on p145 toLowerCase() is declared as returning Integer, correct type is String
It is common in an iteration to require in iteration index. This can be achieved rather expensively by indexOf, or less expensively by iterating over an integer literal range. It would be easier to define e.g. forAllAt(index : Integer, i : T) etc so that an implementation can supply the index efficiently.
9.3.36 states "A variable declaration inside a let must have a declared type and an initial value." In the case of a Tuple literal assigned to a let variable, this requires that the tuple signature be entered twice. Suggest relaxing the requirement on a type to allow deduction from the initial value.
I am no longer happy with my resolution of 10439/13076 which provides a very high resolution LALR grammar. This is inefficient to emulate with LL and cannot provide the flexibility of configurable precedence. It will also be very difficult to accommodate a template parameter parse with similarly high precision. I now favour a low precision syntactic parse augmented by high precision disambiguation/semantic checks. If the high precision LALR grammar may need retraction, it seems undesirable to put it into 2.3 only to remove it in 2.4. Suggest retract the resolutions for OCL 2.3 and rewrite for OCL 2.4 once UML-alignment of templates has been accommodated
As suggested, exclude the LALR grammar from OCL 2.3, deferring resolution of issues 10439 and 13076 until UML-alignment issues such as templates (Issue 15425) have been accommodated in a practical grammar.
OCL supports a '*' value for UnlimitedNatural in order to accommodate the full range of UML multiplicities. UnlimitedNatural conforms to Integer and Real, so that any UnlimitedNatural conversion must perform a run-time check in order to convert '*' to invalid. This conversion cannot be replicated in the reverse direction. Suggest that '*' be aligned with the conventional IEEE math notion of infinity, so that * and -* are valid values for Integer and Real. UnlimitedNatural is then a simple restriction of Integer which is a simple restriction of Real.
UML-alignment of OCL type signatures -------------------------------------------------------- Following discussion in the "Vagueness about meaning of 0..1 multiplicity in OCL and UML" threads of the UML2 and OCL RTFs the following problems exist in alignment of the UML and OCL type systems. The OCL specification does not provide a clear description of the comparative semantics of for instance Integer[1] and Integer[0..1]. The Complete OCL syntax for an Operation Context Declaration uses OCL type decalarations and so fails to provide the same expressivity as a UML operation declaration with multiplicities. Suggest: a) a clear indication that An Integer[1] may have integer values, null or invalid, of which only integer values are well-formed. An Integer[0..1] may have integer values, null or invalid, of which integer values and null are well-formed. b) an enhancement to the type declaration syntax to allow Integer[0..1] or Integer[1] to indicate a nullable/non-nullable value. Set(Integer[1..7]) to capture the expressivity of a UML multiplicity
Dot and arrow navigation have implied definitions in the non-normative clause 7, but nothing in the normative clauses. Implicit collect is missing from clause 9, save for the throwaway final sentence "The mapping is not formally defined in this document but should be obvious." This mapping is far from obvious; if it was obvious it would be easy to define. In particular it is important to define that a static syntax determination is made to ensure that: anObject . feature => object navigation anObject -> feature => implicit collection (of anObject's static ordering/uniqueness) containing a non-null anObject aCollection -> feature (or iterator) => collection navigation aCollection . feature (or iterator) => implicit collect = aCollection -> collect(feature or iterator) (implicit source object implicit .) feature => object navigation (implicit source collection implicit ->) feature (or iterator) => collection navigation with the object/collection discrimination performed statically, so that the navigation algorithm is statically determinate; only the dynamic dispatch on self is subject to dynamic determination. The conformance of a collection to OclAny must never used to allow object navigation on a collection. This avoids a syntax ambiguity for "aCollection . name" between implicit collect and object navigation of a collection feature, or between implicit collect and object navigation of an object feature.
The descriptions of CollectionRange are generally vague leaving the end inclusivities unclear.
It is only the CollectionRangeEval::getRange that provides a solid definition of well-formedness
for e.g. Sequence{1..1} as equal to Sequence{1}.
Unfortunately the specification is undecided about Sequence{2..1} since the CollectionRangeEval::getRange
recursion never terminates.
Rather than impose a well-formedness constraint that Sequence{2..1} is invalid, perhaps it should be
made useful instead, by defining .. as operating in the direction of the last wrt the first so
Sequence{2..1} = Sequence{2,1} and Set{1..2} = Set{2..1} = Set{1,2}.
It would be usefuil to have iterations analoguous to isUnique that compute max or min of a user-defined expression body over a collection.
Nature of problem: Informal references to UML 1.4.1 and UML 1.5 are included as part ofexplanatory text in the OCL 2.2 spec which refers to UML 1.x to explain differences of this new version of OCL.. The ISO/IEC 10151 (UML 1.4.1) needs to be added as an informative reference, for use in these explanations. UML 1.4.1 needs to remain in force, because so many UML models in may standards throughout the world are specified using UML 1.x notation, which is not backwards compatible with the new notation in UML 2.x. Given the normative content of OCL 2.3 (after RTF completes) is aligned technically with UML 2.4 and MOF 2.4, its normative references should be updated before publication of the RTF output, so that the OMG spec cross references will remain appropriate.. The references, and their uses in the OCL 2.3spec, need to be updated to reflect these latest UML/MOF versions. In addition, the Output of the OCL 2.3 RTF should be labeled as OCL 2.4, to avoid clarify the technical alignment of OMG’s latest versions of UML and MOF. Proposed Changes: Change version in title to OCL 2.4. Change all self references in the text from “OCL version 2.2” to “this OMG Specification”. Change all references from UML 2.0 and MOF 2.0 to UML 2.4 and MOF 2.4. In Section 1 Scope Clause: Change: “ This specification defines the Object Constraint Language (OCL), version 2.3. OCL version 2.3 is the version of OCL that is aligned with UML 2.3 and MOF 2.0. “ to “ This specification defines the Object Constraint Language (OCL), version 2.4. OCL version 2.4 is the version of OCL that is aligned with UML 2.4 and MOF 2.4. “ Section 3 Normative References Change: “ 3 Normative References The following normative documents contain provisions which, through reference in this text, constitute provisions of this specification. For dated references, subsequent amendments to, or revisions of, any of these publications do not apply. • UML 2.0 Superstructure Specification • UML 2.0 Infrastructure Specification • MOF 2.0 Core Specification • UNICODE 5.1 Standard: http://www.unicode.org/versions/Unicode5.1.0/ « To : « 3 References 3.1 Normative References The following normative documents contain provisions which, through reference in this text, constitute provisions of this specification. For dated references, subsequent amendments to, or revisions of, any of these publications do not apply. • UML 2.4 Superstructure Specification <omg spec Ref URL> • UML 2.4 Infrastructure Specification <omg spec Ref URL> • MOF 2.4 Core Specification <omg spec Ref URL> • UNICODE 5.1 Standard: http://www.unicode.org/versions/Unicode5.1.0/ 3.2 Informative References The following specification is reference in explanatory text, which describes differences between this specification and the version of OCL included in the existing standard. Its provisions do not constitute provisions of this specification. • ISO/IEC 19501:2005 Information technology -- Open Distributed Processing -- Unified Modeling Language (UML) Version 1.4.2 , also <omg Spec Ref URL> “ Change all uses of the reference in the text From “ UML 1.x” or “UML 1.4.x” “ To: “ ISO/IEC 19501:2005 “ In Section 6.1 “Changes to Adopted OMG Specifications” Replace: “ This specification replaces the specification of OCL given in UML 1.4.1 and UML 1.5. “ With: “ This specification replaces the specification of OCL given in OCL 2.2. The version of OCL specified in ISO/IEC 19505:2005 is intended for use in models based on UML 1.4.1 and UML 1.5. However, use of the OCL specified by ISO/IEC 19505:2005 is not prescribed by this specification.
8.2 Does the lack of restriction on feature types for a TupleType extend to InvalidType and VoidType? With an InvalidType feature the tuple could only be 'well-formed' when containing an invalid value. Surely a tuple with an invalid value is itself invalid and not well-formed? 8.2.2 TupleType has some ASCII code corruptions in the OCL. 8.2.2 TupleType uses unqualified names for feature types allowing an ambiguity when package path is significant. 10.2 TupleValue surely values must not be invalid? 13 TupleLiteralExp has a TupleLiteralPart which has a Property, not accommodating the OclExpression of an initExpression provided by the concrete syntax. Surely a TupleLiteralPart is a derived VariableDeclaration adding an initExpression?
Regarding ptc/10-11-42 and pas/10-08-02,
It seems to be typo.
In ptc/10-11-42, 11.6.5, and
in pas/10-08-02, 11.5.5
Threre is
"A Sentence is not a subtype of Bag. The common supertype of Sentence and Bags is Collection."
^^^^^^^ ^^^^^^^^
These two "Sentence"s seem to be typo.
Substitute "Sequence" for "Sentence"."Reject" should be replaced with "collect" in the following line: "The value of the reject operation is the collection of the results of all the evaluations of expression-with-v."
OCL already has an implicit form of Lambda function in the intuitive declaration of collect(). This should be formalised and made more versatile. It doesn't seem to be possible to formulate a declaration for collect() without a Lambda Function: Sequence(T1)::collect(T2)(iterator : T1 | body : Lambda T1() : T2) : Sequence(T2) The mandatory collect body is a parameter-less Lambda function whose context-type is the class template parameter T1 and the return-type is the operation template parameter T2. For other iterators the declaration can be just OclExpression since the type is not exploited.
Three library operations do not appear to be declarable without intuitive typing semantics. Introduction of an OclSelf template parameter that is the statically determined type of self can solve the problem. OclSelf is a reserved spelling. Classifier::allInstances(OclSelf)() : Set(OclSelf) -- set of the derived classifier OclAny::oclType(OclSelf)() : OclSelf -- my own type as statically known OclAny::oclAsSet(OclSelf)() : Set(OclSelf) -- set of my own and derived types, declared as the statically known type [oclAsSet is the currently unspecified library operation used to realise implicit object-to-set conversion] Without an OclSelf, almost any usage of these library operations must be followed by an oclAsType to the already known type. e.g. with the OCL 2.3 type system the library function is Classifier::allInstances() : Set(Classifier) and so the usage is MyType.allInstances() -- is MyType instances as a Set(Classifier) MyType.allInstances().oclAsType(Set(MyType)) -- necessary cast to statically known type
If meta-models provide both 'B::x' and 'A::B::x', it is not possible to access 'B::x' from a context with 'A::B' since 9.4.1[4] searches from the current scope and so resolve 'B' in 'B::x' to 'A::B'. Suggest adoption of the C++ '::' global prefix so that '::B::x' can be used when 'A::B' occludes.
Since you are working on the StateMachines chapter, it may be worth considering after the first submission adding an explanation about oclIsInState(). This query operation is unfortunately mispelled as oclInState(), see: http://www.omg.org/issues/ocl2-rtf.open.html#Issue15257 This query operation is confusingly listed as a predefined property and explained as an operation in OCL2.2, clause 7.5.9: 7.5.9 Predefined properties on All Objects There are several properties that apply to all objects, and are predefined in OCL. These are: oclIsTypeOf (t : Classifier) : Boolean oclIsKindOf (t : Classifier) : Boolean oclInState (s : OclState) : Boolean oclIsNew () : Boolean oclAsType (t : Classifier) : instance of OclType .... The operation oclInState(s) results in true if the object is in the state s. Possible states for the operation oclInState(s) are all states of the statemachine that defines the classifier's behavior. For nested states the statenames can be combined using the double colon “::”.
A Collection containing both 'a', and {'b', 'c'} must be typed as a
Collection of OclAny since that is the only common type.
This is unhelpful for tree structures.
Suggest introduction of a pseudo-collection type Tree(T) to which
both T and Collection(Tree(T)) conform.
A String content tree then then be declared as a Tree(String).
The OMG OCL 2 Revision Task force has resolved a set of defect and clarification issues against the text in DIS 19507. (Preliminary Report http://doc.omg.org/ptc/10-12-01.pdf , Change Barred Spec http://doc.omg.org/ptc/10-11-41.pdf) It is important that the corrections resolving these defects be reflected in the published ISO/IEC Standard for OCL. The editing group for OCL 2 (DIS 19607) should consider all changes against the text of OCL 2.2, resulting from RTF defect resolutions in the latest minor revision to OCL 2, approved by the OMG PTC by the time of the ballot resolution.
The references need to include links to the formal OMG published specifications. The Scope clause refers to UML 2.2, however the reference is UML 2.0 Informal references to UML 1.4.1 and UML 1.5 are included as part of explanatory text in the OCL 2.2 spec which refers to UML 1.x to explain differences of this new version of OCL.. The ISO/IEC 10151 (UML 1.4.1) needs to be added as an informative reference, for use in these explanations. Change: “ 3 Normative References The following referenced documents are indispensable for the application of this document. For dated references, only the edition cited applies. For undated references, the latest edition of the referenced document (including any amendments) applies. • UML 2.0 Superstructure Specification • UML 2.0 Infrastructure Specification • MOF 2.0 Core Specification • UNICODE 5.1 Standard: http://www.unicode.org/versions/Unicode5.1.0/ « To : « 3 References 3.1 Normative References The following referenced documents are indispensable for the application of this document. For dated references, only the edition cited applies. For undated references, the latest edition of the referenced document (including any amendments) applies. • UML 2.2 Superstructure Specification <omg spec Ref URL> • UML 2.2 Infrastructure Specification <omg spec Ref URL> • MOF 2.0 Core Specification <omg spec Ref URL> • UNICODE 5.1 Standard: http://www.unicode.org/versions/Unicode5.1.0/ 3.2 Informative References The following specifications are referenced in informative text: • ISO/IEC 19501:2005 Information technology – Open Distributed Processing -- Unified Modeling Language (UML) Version 1.4.2 , also <omg Spec Ref URL> “ Change all uses of the informal UML 1.x references in the text From: “ UML 1.x” or “UML 1.4.x” “ To: “ ISO/IEC 19501:2005 “
Comment: References to UML and MOF need to be updated to most recent versions. Unnecessary references to UML 1.4 need to be removed or replaced by more neutral references (“UML” instead of “UML 1.4”). This concerns at least 6 locations in the spec, like in Section 7.3.3 Invariants and in Section 7.5.12 Collection of Collections.
The nature of the relationship between this specification and the OCL in UML 1.4 should be clarified in an informative manner. UML 1.4.1 needs to remain in force, because many UML models in many standards throughout the world are specified using UML 1.x notation, which is not backwards compatible with the notation in UML 2.x. Replace: “ This specification replaces the specification of OCL given in UML 1.4.1 and UML 1.5. “ With: “ This specification replaces the specification of OCL given in OCL 2.0. The version of OCL specified in ISO/IEC 19501:2005 is intended for use in models based on UML 1.4.1 and UML 1.5. However, use of the OCL specified by ISO/IEC 19501:2005 is not prescribed by this specification. The version of OCL specified in this International Standard is not directly applicable to models based on ISO/IEC 19501:2005. ”
Because the content of table 2.1 is empty, this table is meaningless. Fill the table.
The format of normative references doesn't meet ISO format.ISO/IEC 19505-1:2011 Information technology — OMG Unified Modeling Language (OMG UML) Version 2.1.2 Part 1: Infrastructure ISO/IEC 19505-2:2011 Information technology — OMG Unified Modeling Language (OMG UML) Version 2.1.2 Part 2: Superstructure ISO/IEC 19502:2005 Information technology -- Meta Object Facility (MOF) ISO/IEC 10646:2003 Information technology -- Universal Multiple-Octet Coded Character Set (UCS) If you want to refer OMG’s documents, see directive.
Usage of upper/lower case letter is inconsistent with UML. For example, “Invariant”, “Precondition”, “Postcondition”, etc, in the text should be lower case letter. However, there are UML metamodel elements, such as “Classifier”. Especially, “collection type” in function flatten, p158, is lower case letter. If this is designated in lower case letter, it is difficult to understand the meaning of sentence. What about “collection type” L1 on 11.2.1? It is confusing whether those are metamodel elements or not.) It is required to be consistent with convention of UML upper case letter, since this standard is a family of UML, that is, it is required to use upper case letter only for UML/OCL Metamodel element.
Initial Comment : It is required to be consistent with convention of UML upper case letter, since this standard is a family of UML, that is, it is required to use upper case letter only for UML/OCL Metamodel element. Comment: In general metaclass names start with upper letter whereas attributes and operations with lower letters. However within an explanatory text, to ease reading, we believe it make sense not always to use the capitalized form to refer to a metaclass concept, specially when the term has a meaning in natural language like “invariant”. Anyway, a more detailed check to the spec is needed to see if this issue requires any change. Disposition: Deferred
Many figures shown by UML are not unified in line color and hatching color. Unify them.
Initial Comment/Suggestion: Unify them. Comment: Figures in chapter 8 are all unified, but this is not the case for chapters 9 and 10 because they were constructed by different tools and people and not yet re-build since the FTF. Disposition: Deferred
Click here for this issue's archive. Nature: Issue from PAS Ballot comment for ISO/IEC DIS 19507 Severity: Summary: See comment JP 5 in “…_JISC.doc” file in http://www.omg.org/members/cgi-bin/doc?pas/11-03-03.zip Resolution:
There are same element names in both OCL and UML. Those are confusing. I wonder whether those are UML elements or OCL elements. Besides, it seems there is no clear distinction between UML/OCL (upper case letter) term and general term (lower case letter), since these are used in mixture. - It is confusing to distinguish OCL “Constraint” from UML “Constraint” in the text. Furthermore, there are some “constraint” s (in a lower case letter). The lower case letter/upper case letters for “constraint” are mixed. OCL “Constraint” should be distinguishable from UML “Constrain”.
See comment JP 6 in “…_JISC.doc” file in http://www.omg.org/members/cgi-bin/doc?pas/11-03-03.zip Initial Comment/Suggestion: : OCL “Constraint” should be distinguishable from UML “Constraint”. Comment: In fact OCL do not define the concept of Constraint since this concept is taken from UML. So there is no need to distinguish them since they are the same concept. A more detailed check to the spec is needed to see if this issue requires any change. Disposition: Deferred
Table 7.3 doesn’t understand easily, because “condition” column doesn’t give sufficient explanation. Write more explicit explanation
See comment JP 7 in “…_JISC.doc” file in http://www.omg.org/members/cgi-bin/doc?pas/11-03-03.zip
It is difficult to understand which “latter” indicates. Make clear which “latter” implies.
See comment JP 8 in “…_JISC.doc” file in http://www.omg.org/members/cgi-bin/doc?pas/11-03-03.zip
Whereas there are some infix operator definitions in later document, this list of infix operators isn’t described sufficient. For example, there is ‘->’ definition on 7.6.1. However, ‘->’ is not included in this list. Additionally, ‘=’ is defined on 11.6.1, 11.6.2, 11.6.4, 11.6.5. However, there isn’t ‘=’ on this list. By the way. ‘=’ is not defined for Integer, and Real. Is that no problem? Furthermore, “implies” definition could not be found. Add infix operator sufficiently. And, clarify the operator definition.
See comment JP 9 in “…_JISC.doc” file in http://www.omg.org/members/cgi-bin/doc?pas/11-03-03.zip
As keywords, it is necessary to include “forAll”, “exists”, “any”, “one”, collect”, “select”, “reject” etc., since there are definitions for these on p161 and other clause. This key word list is insufficient. Add “forAll”, “exists”, “any”, “one”, “collect”, “select”, “reject”.
See comment JP 10 in “…_JISC.doc” file in http://www.omg.org/members/cgi-bin/doc?pas/11-03-03.zip In OCL 2.3, 7.4.9 section, there is a statement which clarifies how this kind of operation names should be treated: "Note that operation names such as iterate, forAll, and oclType, are not reserved or restricted." Therefore, “forAll”, “exists”, “any”, etc are not keywords. Disposition: Closed
Typo. "This clause describes teh abstract syntax ...""This clause describes the abstract syntax ..."
See comment JP 11 in “…_JISC.doc” file in http://www.omg.org/members/cgi-bin/doc?pas/11-03-03.zip
There is no attribute designation of FeatureCallExp in Fig 8.2. However, in Attribute of FeatureCallExp class description (p43), isPre is described. Add isPre to Class “FeatureCallExp” on the class diagram (Fig. 8.2)
See comment JP 12 in “…_JISC.doc” file in http://www.omg.org/members/cgi-bin/doc?pas/11-03-03.zip. Initial comment/suggestion: Add isPre to Class “FeatureCallExp” on the class diagram Comment: Normally attributes should appear in all diagrams in chapter 8 (exactly as 'stringSymbol' in Fig 8.12). Hence an update of the diagram is needed. Revised Text: Change Diagrams 8.8, 8.9, 13.22 and 13.23 so that FeatureCallExp has the “isPre” attribute. Proposed Disposition: Resolved Disposition after 1st ballot: Deferred (Majority of YES not reached. Reason: The change should apply to Figures 8.8 and 8.9 but should not apply to figures 13.22 and 13.23 because isPre is not part of EssentialOCL).
Typo. contaxt, change to context
See comment JP 21 in “…_JISC.doc” file in http://www.omg.org/members/cgi-bin/doc?pas/11-03-03.zip
As class description, there is a AssociationClassCallExp. However, there is no Class on the class diagram in Fig.8.3.. Proposed change: Add Class “AssociationClassCallExp” on the class diagram in Fig. 8.3.
See comment JP 21 in “…_JISC.doc” file in http://www.omg.org/members/cgi-bin/doc?pas/11-03-03.zip
The class diagram on Fig8.6 & Fig8.7 and its class description is inconsistent. For example, there is TupleLIteralPart on the class diagram. However, there is no class description in p51. Additionally, as class description of CollectionLiteralPart, Associations describes “type”. Furthermore, PrimitiveLiteralExp doesn’t have any attributes on the class diagram (Fig 8.6). However, followed class description, p51, Attribute “symbol” is described. And, there is a referredEnumLiteral as class description. However, class diagram doesn’t have referredEnumLiteral on Fig. 8.6. PROPOSED RESOLUTION: Correct class diagram and its class description
See comment JP 21 in “…_JISC.doc” file in http://www.omg.org/members/cgi-bin/doc?pas/11-03-03.zip
Disambiguating rules. [1] [1] is redundant. Replace this with [1].
See comment JP 21 in “…_JISC.doc” file in http://www.omg.org/members/cgi-bin/doc?pas/11-03-03.zip
Abstract syntax mapping and Synthesized attributes (two places) Reference” simpleNameGr” is incorrect, Replace this with simpleNameCS
See comment JP 21 in “…_JISC.doc” file in http://www.omg.org/members/cgi-bin/doc?pas/11-03-03.zip
Section 9.3.18 BooleanLiteralExpCS, 9.3.19 CallExpCS, 9.3.24 TypeCS,, 9.3.37 OclMessageExpCS, 9.3.39 For instance in case of 9.3.18, numbered list are shown like below. “[2] [A] BooleanLiteralExpCS ::= ‘true’ [3] [B] BooleanLiteralExpCS ::= ‘false’” The numbering are not consistent with others. PROPOSED RESOLUTION: For instance, replace “[2] [A] BooleanLiteralExpCS ::= ‘true’ [3] [B] BooleanLiteralExpCS ::= ‘false’” with “[A] BooleanLiteralExpCS ::= ‘true’ [B] BooleanLiteralExpCS ::= ‘false’”. Apply the same type of modifications to all identified clauses.
See comment JP 21 in “…_JISC.doc” file in http://www.omg.org/members/cgi-bin/doc?pas/11-03-03.zip
Synthesized attributes, [B] The if-then-else-endif indentation of “The referred operation” part is not appropriate. Replace that part with the list below this table (Listing#1).
See comment JP 21 in “…_JISC.doc” file in http://www.omg.org/members/cgi-bin/doc?pas/11-03-03.zip
Synthesized attributes, [D], [F], [G] The meaning of “and” at the end of the line is not clear and seems inconsistent with other parts. Are these logical operations? Add text to clarify this
See comment JP 21 in “…_JISC.doc” file in http://www.omg.org/members/cgi-bin/doc?pas/11-03-03.zip
Synthesized attributes, [B] TBD should not be a part of International Standard. Modify the text as appropriate
See comment JP 21 in “…_JISC.doc” file in http://www.omg.org/members/cgi-bin/doc?pas/11-03-03.zip
Main text. TBD should not be a part of International Standard. Modify the text as appropriate.
Main text. References like [Kleppe2001] and [Clark2000] are not appropriate in the main text of International Standards. Modify the text as appropriate
See comment JP 23 in “…_JISC.doc” file in http://www.omg.org/members/cgi-bin/doc?pas/11-03-03.zip
1st paragraph: Single quote does not close in two places: ’The Expressions Package ’The Types Package Complete the quote like the following. ’The Expressions Package’ ’The Types Package’
See comment JP 24 in “…_JISC.doc” file in http://www.omg.org/members/cgi-bin/doc?pas/11-03-03.zip
The term “OMG 4-layered architecture” may need to be explained or used with proper references. Modify the text as appropriate.
See comment JP 25 in “…_JISC.doc” file in http://www.omg.org/members/cgi-bin/doc?pas/11-03-03.zip
UndefinedValue is explained in the text but is not included in any of the following diagrams. Add this element to the diagram.
See comment JP 26 in “…_JISC.doc” file in http://www.omg.org/members/cgi-bin/doc?pas/11-03-03.zip
Figure 10.3 Explanation of TupleValue (page 107) describes its association with element, but this association is not included in Figure 10.3. Add this association to Figure 10.3
See comment JP 27 in “…_JISC.doc” file in http://www.omg.org/members/cgi-bin/doc?pas/11-03-03.zip
ObjectValue [1] The text refers to name parameter of snapshot, but LocalSnapshot in Figure 10.2 does not have “name: String” Add name parameter to LocalSnapshot in Figure 10.2.
See comment JP 28 in “…_JISC.doc” file in http://www.omg.org/members/cgi-bin/doc?pas/11-03-03.zip
Figure 10.5 StringValue only appears here. No explanation was given before the diagram. Add definition or explanation of StringValue before this diagram
See comment JP 29 in “…_JISC.doc” file in http://www.omg.org/members/cgi-bin/doc?pas/11-03-03.zip
This paragraph is confusing. It starts with Figure 10.6 but talks about elements not included in Figure 10.6. In addition it talks about “OclEvaluation” twice, which do not appear in any of the following diagrams.Split the paragraph into two. Fist one should be just about summary of Figure 10.6, and the second one should introduce Figure 10.7with associated elements
See comment JP 30 in “…_JISC.doc” file in http://www.omg.org/members/cgi-bin/doc?pas/11-03-03.zip
OperationCallExp. This heading should read “OperationCallExpEval.”. Modify the heading as appropriate.
See comment JP 31 in “…_JISC.doc” file in http://www.omg.org/members/cgi-bin/doc?pas/11-03-03.zip
TupleLiteralExpPartEval is not included in Figure 10.11. Is VariableDeclEval the one? Add this element to Figure 10.11.
See comment JP 32 in “…_JISC.doc” file in http://www.omg.org/members/cgi-bin/doc?pas/11-03-03.zip
“ASCII or Unicode” is confusing. Use the same UML description
See comment JP 33 in “…_JISC.doc” file in http://www.omg.org/members/cgi-bin/doc?pas/11-03-03.zip
Same diagrams are duplicated. Remove either. The referred operation:
OperationCallExpCS.ast.referredOperation =
if OclExpressionCS.ast.type.oclIsKindOf(CollectionType)
then -- this is a collection operation called on a collection
OclExpressionCS.ast.type.lookupOperation(simpleNameCS.ast,
if (argumentsCS->notEmpty())
then argumentsCS.ast->collect(type)
else Sequence{} endif )
else -- this is a set operation called on an object => implicit Set with one element
SetType.allInstances()->any(st|st.elementType = OclExpressionCS.ast.type).lookupOperation(simpleNameCS.ast,
if (argumentsCS->notEmpty())
then argumentsCS.ast->collect(type)
else Sequence{} endif )
endif
See comment JP 34 in “…_JISC.doc” file in http://www.omg.org/members/cgi-bin/doc?pas/11-03-03.zip
The 'clarified' text in OCL 2.3 for missing association ends, is still unclear. Problem 1: if multiple association ends acquire the same name, what happens? Suggest: they all acquire the same name and the resulting lookup up finds multiple names which should be diagnosed as an ambiguity and consequently a semantic error. Problem 2: if a missing association end is recursive, a class acquires a property with the same name as the class. Consequently invocation of e.g X.allInstances() for class X may encounter an ambiguity while resolving X. Is it self.X or global X? Suggest: auto-generated missing names may only be invoked via a navigation operator. Problem 3: does a derived association end get a resolution for a missing name? if OCL is used to define a number of helper properties that all return the same type, then provision of the missing 'opposites' results in unhelpful clutter at best. Suggest: missing names are not provided for derived association ends.
a) an OrderedSet would be more appropriate b) enumeration literals are instances of EnumerationLiteral; they are not instances of an Enumeration cf. MyClass.allInstances() dynamically overloads Classifier.allInstances() to return all known instantiations of MyClass, rather than all features of MyClass. so why does MyEnumeration.allInstances() prevent me discovering all instantiations of MyEnumeration; Enumeration is a Classifier. The required functionality of MyEnumeration::allInstances() is available as MyEnumeration.ownedLiteral provided reflection is consistently defined. Suggest: remove the Enumeration.allInstances() overload.
I want to signal that the use of the word "meta" is confusing. Here is an example on page 47. *TypeExp* A TypeExp is an expression used to refer to an existing meta type within an expression. According to Merriam-Webster, "meta" is usually a prefix that could be added at the beginning of a word. This particle should be merged to the main word (like in metabasis) or attached using an hyphen (like meta-analysis). In consequence, we should read "metatype" which seems to hold the correct meaning. It is coherent with metaclass, for example. By the way, "metatype" is used at many places in the document. In some contexts and in the familiar language, you can use "meta" as a diminutive for something when its meaning is obvious. For example, "the meta is broken" when you mean the metacarpus. In a specification document and in a context where we have to differentiate many metaconcepts, it doesn't have its place. It is seen at many places in this document and may be other. In this one, we see "meta model" and "meta-model", while the word "metamodel" should be and is effectively used.
On page 153 oclIsInState(statespec : OclState) is used to check if an object is in a specified state. But in Section 7.5.9 on page 22 oclInState(statespec : OclState) is used for this purpose and examples are given. There is one more occurrence of oclIsInState on page 47 of Section 8.3.1, but this is talking about the abstract syntax, therefore it could be valid. But I think definitely not for the concrete syntax of the OCL. Strangely enough the Eclipse Interactive OCL Console implements oclIsInState() and not oclInState(). I would appreciate a clarification which statement to use very much!
The symbol ≺ is used in this page. According to Unicode definition, this symbol represents a mathematical symbol whose definition is "precedes". Here is the reference of that definition : http://unicode.org/cldr/utility/character.jsp?a=227A I'm not a mathematician and I don't know precisely what this symbol means for mathematicians, even if I searched in many books and on the Internet. However, I find very confusing to use a symbol that means "precedes" to means "is the child of". There is another symbol ≻ which means 'succeeds' that would be less confusing in the sense of "C1 succeeds C2" to means that C1 is the child of C2. As I'm not mathematician, I may be completely wrong and I would greatly appreciate a sound reference where this symbol is defined formally.
In the 3rd item of the definition A.12 (System State), the paragraph before the formula ends by : "whereas the function i(l) projects all but the ith component):" The function is exactly the same as the first function in the same sentence. It appears that a prime symbol is missing in the function. Indeed, a prime symbol appears in the formula.
The last formula in the definition A.12 has unbalanced parenthesis. The first parenthesis after the = sign seems in excess.
In the table A.1 (Schema for operations on basic types), the operations {<, >, <, >} are defined as applicable to {UnlimitedNatural, Integer, Real, String, Boolean}.
While the result is certainly Boolean, the parameters can't be Boolean in general, unless UML defined such operators for Booleans. According to section 11.5.4, there is no definition for the operators. Then Boolean should be removed in the set.At the top of the page, there is a formula to define the equal operator. The formula begins with I(=t). That t should be subscripted as we see in the sentence that precedes the formula.
collect and collectNested have irregular semantics that ignore the natural (outer) collection element type when used on nested collections:
i.e Set{Set{1.0}}->collect(toString()) is Set{Set{1.0}}->collect(s : String | s.toString())
so how might an iteration over the outer collection element type be performed?
Presumably, for homegeneous collections, by explicitly specifying the iterator type as Set{Set{1.0}}->collect(s : Set(String) | s->size())
Suggest: collect, collectNested specify that the implicit iterator type is the innermost collection type, and that an explicit type may
specify a collection type that successfully iterates when all leaves of the tree are uniquely contained in a corrsponding iteration element
of the iterator type, else the iteration is invalid.
Can't see a solution for heterogeneous solutionsAs part of the support for lambda expressions an ability to parse OCL from a string would be useful
Issue 12948 "Making OclAny denote any object" was resolved to allow Collection to conform to OclAny. A.2.6 still states "A simple set inclusion semantics for subtype relationships as described in the next sub section would not be possible due to cyclic domain definitions if OclAny were the supertype of Set(OclAny)." A premise for Annex A has therefore been violated requiring rework to consider at least a less simple set inclusion semantics.
The support for messages uniquely requires dedicated concrete syntax: ^, ^^, ? This makes provision of Essential OCL tooling without messages and Complete OCL tooling with messages hard. The operators are hard to remember and inconsistent with OCL where "forAll" is favoured over upside-down A. Suggest replace ^,^^,? by OclElement::hasSent(), OclElement::messages() and Message::Unspecified (possibly just null), so that Messages can be modularized as an Standard Library extension of additional types, operations and attributes only. No concrete syntax change.
Yet another query on an Eclipse newsgroup has asked how stereotypes/profiles work in a transformation language, so I've taken a brief look and it appears that UML 2.5 Section 12 appears gives the only clue as to how an OCL expression might navigate a Stereotype: self.base_Interface.ownedAttributes->size() = 0 This is a particularly unfortunate example since it uses reflection, or at least multiple meta-levels, which are not currently supported in OCL 2.x. Once OCL supports reflection and type literals, I would expect to see something more like Interface.ownedAttribute->size() = 0 The constraint presumably is that the stereotype has no attributes, regardless of the class to which it is applied. Reflective operation might do something like self.oclType().selectFragment(Interface).ownedAttribute->size() = 0 (if selectFragment is an OCL library operation that selects a type merge contribution). The utility of the meta-level traversing 'base_xxxx' and 'extension_xxxx' seems very suspect. Does any tool support them? I know Eclipse UML2 has at least a 'base_xxxx' name, but I doubt that it is reflective. It's sole purpose seems to be to give me trouble with validation errors. ----------------- It seems to me that in the same way that (for base classes): A class C (with property c) may have base classes B1 (with properties b, b1) and B2 (with property b, b2) allowing implicit access such as aC.c, aC.b1, aC.b2, but requiring qualification for aC.B1::b and allowing redundant qualification for aC.B1::b1. then (for stereotypes): A Class C may have stereotypes S1 (with properties s, s1) and S2 (with properties s, s2) allowing implicit access such as aC.s1, aC.s2, but requiring qualification for aC.S1::s and allowing redundant qualification for aC.S1::s1. The implicit access is only permissible when it is statically known that the Stereotype has been applied, i.e for an expression whose context is the Stereotype. In more general contexts the Stereotype qualification may need a run-time check and an invalid result if the Stereotype has not been applied. Thus: not aC.S1::s1.oclIsInvalid() implies some-expression-when-S1::s-exists If property overloading is forbidden, but operation overloading permitted, in the above adding a property C::b, or S1::c or S2::b2 would be a static error since the added property overloads a property name already present in the extended class. Note that this is not in accord with the current OCL specification that motivates the introduction of qualification to support access to hidden property names, which UML prohibits. adding any operation in a stereotype is valid; it is either a new or overloaded operation. However two stereotypes contributing the same operation signature is a static error to be detected by the attempt to apply both stereotypes. Since the WFRs for the above belong in UML, presumably the above should be in the UML specification, and the OCL specification should just map the alternate navigation syntaxes appearing in the UML specification to appropriate Concrete and Abstract Syntax Expression elements.
Issue 14197 finally resolved the semantiscs of OclInvalid, but the end result was that there is no OclInvalid section in 11.3. Add an 11.3.x for OclInvalid that enumerates all relevant OclInvalid behaviors; in particular = and <> return invalid for any invalid argument.
The description of String::indexOf() states "No string is a substring of the empty string.". This modifies the axiom that every string is a substring of itself. It would appear that the empty string has got confused with null. An extension of the library with startsWith and endsWith operations would require the modified axiom to be accommodated making corner cases equivalently strange. This modified axiom is not observed by other String libraries such as the java.lang.String. Suggest: Replace the text: "The empty string is considered to be a substring of every string but the empty string, at index 1. No string is a substring of the empty string." by "The empty string is a substring of every string at index 1 (and also at all other indexes)."
ISO 639 has been replaced by a six-part series. The new reference should be: ISO 639 (all parts) ISO 3166 has been replaced by a three part series. The new reference should be: ISO 3166 (all parts) ISO 10646 is new and this reference should be: ISO 10646:2011, Information technology - Universal Coded Character Set (UCS)
The navigation from Association Classes does not conform to UML 2.4.1 because of 7.3.4 AssociationClass on page 44 UML Superstructure Specification, v2.4.1. the kind of navigation allowed by OCL is not allowed by UML, i.e. the navigation from the association class to the ends of the association is explicitly not allowed by UML but allowed by OCL. I see here a contradiction. I checked UML 2.1.2 from 2007 and in that UML this navigation from the association class the ends of the association was still allowed. I think that OCL 2.3.1 is not compatible with UML 2.4.2 from this point of view. Please tell me if this opinion is correct. If this contradiction that I remarked really exists than what to expect from the future: OCL or UML point of view?
In http://www.linkedin.com/redirect?url=http%3A%2F%2Fwww%2Ebrucker%2Ech%2Fprojects%2Fhol-ocl%2FFeatherweight-OCL%2Foutline%2Epdf&urlhash=vacm&_t=tracking_anet Burkhart Wol ff argues that lopgical consistency requires that not(not(X)) is X. OCL 2.3.x does not satisfy this for 'null'. Similary null and true = null not invalid ...
The any() iteration is specified to return null in the event that no match is found. However null could also be the return of a successful match of null. e.g
Sequence{null}->any(s | s = null)
Suggest: change the match-not-found return to invalid.OCL 12.10 awaits alignment with the UML 2.0 metamodel. Consequently, the relationship between a result-valued OCL bodyExpression and a Boolean-valued UML bodyCondition is unspecified. A common pragmatic resolution has been to equate the two and ignore the Boolean-valued requirement of a UML Constraint. In order to accommodate prevailing practice and also support UML's multiple out/inouts, suggest: Reinterpret the grammar prePostOrBodyDeclCS ::= ‘body’ (simpleNameCS)? ‘:’ OclExpressionCS such that the simpleNameCS is the name of the return parameter with 'result' as the anonymous default OclExpressionCS is a result-valued bodyExpression if OclExpressionCS does not reference the simpleNameCS or its defgault. OclExpressionCS is a Boolean-valued bodyCondition if the return parameter is referenced. [Allow multiple body declarations.] Thus "body: ..." is a shortform of "body result: ..." which is a shortform for "body result: result = ..." and body: ... body A: ... body B: ... could be the specification of a UML operation f(out a : A, inout b : B, in c : C) : Z
OCL 9.4.5 gives no recommendation on how to handle the multiple out capability of UML. Suggest that the mapping of a UML operation with out or inout parameters to an OCL operation do the following: remove all 'out' parameters from the OCL parameter list so that the OCL parameter list contains only 'in' and 'inout' parameters with 'read-only' behavior change the return type to a Tuple whose part-names and types are determined by the conventional 'result' and the 'out' and 'inout' parameters. It is also desirable to relax the upper multiplicity bound to allow multiple bodyExpressions in Complete OCL, one bodyExpression per returning parameter.
post: (result = self) and result.oclIsTypeOf( t ) requires oclAsType to change the type of self. The constraint should be: post: (result = self) and result.oclIsKindOf(t) [Review all usage of oclIsType() since it's nearly always wrong to use oclIsType rather than oclIsKindOf.]
There is a contradiction between invalid conform to anything and invalid always propagates for e.g.
Sequence{}->first().oclIsKindOf(Class)
oclIsKindOf uses the invalid input to return true.
Invalid propagation should dominate giving invalid.
This requires OclInvalid::oclIsKindOf, oclIsTypeOf, oclType, oclAsType overloads to explicitly return invalid."The returned collection of the closure iteration is an accumulation of the source, and the collections resulting from ..." incorrectly includes the source. The algorithm in 11.9.1 correctly includes the source only if the source is reached by some traversal from the source.
Section 11.9.1.4 states that "there must be at least one element fulfilling body, otherwise the result of this IteratorExp is null." And defines source->any(iterator|body) = source->select(iterator | body)->asSequence()->first() However let seq:Sequence<T>=source->select(body)->asSequence() in source->any(body)=seq->at(1) >From section 11.7.5 context Sequence::first() : T post: result = self->at(1) context Sequence::at(i : Integer) : T pre : i >= 1 and i <= self->size() If there is no element fulfilling body, then seq is empty and the precondition of Sequence::at does not hold because 1 > seq->size(). Related to: Issue 18125 [OCL 2.4]
The accumulator in the definition of Collection::min and Collection::max is initialized as self.first(). post: result = self->iterate( elem; acc : T = self.first() | acc.min(elem) ) post: result = self->iterate( elem; acc : T = self.first() | acc.max(elem) ) The accumulator should be initialized as self.asSequence()->first(), because Collection::first() is undefined.
Languages such as Groovy have found it helpful to intrioduce the safe navigation operator ?: so that navigation over null yields null rather than a problem (invalid in OCL). In OCL it could be a pure syntax sugar: (x?.y) = (if x == null then null else x.y endif) or perhaps an additional PropertyCallExp operator
In order for a UML model to import some Complete OCL for use in the model's constraints, a Complete OCL document must be a (derived) Package. Any tool can therefore import Complete OCL using its conventional metamodel import syntax; just needs per-tool support. Complete OCL documents must not conflict. For instance if MM imports COD1 for its own purposes and then your usage imports MM (and COD1) and also COD2, the declarations in COD2 may not introduce anything that requires re-analysis of the OCL expressions in MM or COD1; the only change to MM+COD1 execution may arise through additional derived virtual functions. Avoiding conflicts requires some strong WFRs. Once conflicts are avoided, Complete OCL documents can be pre-compiled and loaded in compiled form.
A very common 'idiom' in OCL expressions is sources->select(oclIsKindOf(T))->collect(oclAsType(T))->asSet() to select the sub-set of type T. This involves four library calls and requires T to be typed twice. In practice sources->select(oclIsKindOf(T)).oclAsType(T) may save one operation call at the expense of the wrong collection type. Suggest introduce sources->selectByKind(T) sources->selectByType(T) to simplify this oclIsKindOf/oclIsTypeOf usage.