Please use this identifier to cite or link to this item:
|On the specification of full contracts
Pace, Gordon J.
Okika, Joseph C.
Ravn, Anders P.
|Electronic Notes in Theoretical Computer Science
|Fenech, S., Pace, G. J., Okika, J. C., Ravn, A. P., & Schneider, G. (2009). On the specification of full contracts. Electronic Notes in Theoretical Computer Science, 253(1), 39-55.
|Contracts specify properties of an interface to a software component. We consider the problem of defining a full contract that specifies not only the normal behaviour, but also special cases and tolerated exceptions. In this paper we focus on the behavioural properties of use cases taken from the Common Component Modelling Example (CoCoME), proposed as a benchmark to compare different component models. We first give the full specification of the use cases in the deontic-based specification language CL, and then we concentrate on three particular properties in order to compare deontic and operational specifications. We conjecture that operational specifications are well suited for normal cases, but are less easily extended for exceptional cases. This hypothesis is investigated by comparing specifications in CSP (operational) with specifications in CL. The outcome of the experiment supports the conjecture and demonstrates clear differences in the basic descriptive power of the formalisms.
|Appears in Collections:
|Scholarly Works - FacICTCS
Files in This Item:
Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.