Akehurst, David H., Howells, Gareth, Zschaler, S (2008) OCL: Modularising the Language. Electronic Communications of the EASST, 9 . pp. 1-20. ISSN 1863-2122. (doi:10.14279/tuj.eceasst.9.100.95) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:15672)
The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided. | |
Official URL: http://dx.doi.org/10.14279/tuj.eceasst.9.100.95 |
Abstract
The Object Constraint Language (OCL) was originally designed as an 'add-on' to the Unified Modelling Language (UML) in order to facilitate writing textual constraints complementing the graphical specifications. Since its original standardisation many extensions have been added to the language and many more have been proposed. The original structure of the OCL definition has not been formed, however, with a view of extensibility. Still, OCL can be redesigned in such a manner that it becomes easy to extend the language. In this paper we present a modular redefinition of OCL and illustrate how it supports extension. This new approach to the design of OCL enables you to consistently extend or customise OCL to your own needs.
Item Type: | Article |
---|---|
DOI/Identification number: | 10.14279/tuj.eceasst.9.100.95 |
Additional information: | Online only |
Subjects: | T Technology > TK Electrical engineering. Electronics. Nuclear engineering > TK7800 Electronics > TK7880 Applications of electronics > TK7885 Computer engineering. Computer hardware |
Divisions: | Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Engineering and Digital Arts |
Depositing User: | J. Harries |
Date Deposited: | 20 Apr 2009 10:19 UTC |
Last Modified: | 05 Nov 2024 09:50 UTC |
Resource URI: | https://kar.kent.ac.uk/id/eprint/15672 (The current URI for this page, for reference purposes) |
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):