Abstract
UML static models are expressed using a mixture of class diagrams and OCL expressions. In a well formed static model, the OCL expressions and class diagrams are type consistent. Checking for type consistency of static models involves both inclusion and parametric polymorphism. This paper defines a semantics of type consistency in terms of a type theory for UML static models. The type theory is shown to be correct with respect to a value semantics for OCL. The existence of a consistency checking algorithm for UML static models is established.
Cite
CITATION STYLE
Clark, T. (1999). Typechecking UML static models. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1723, pp. 503–517). Springer Verlag. https://doi.org/10.1007/3-540-46852-8_36
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
