Smith, G. and Derrick, J. (2002) Abstract Specification in Object-Z and CSP. In: George, C. and Miao, H., eds. Formal Methods and Software Engineering: 4th International Conference on Formal Engineering Methods, Icfem 2002 Shanghai, China, October 21-25, 2002. Lecture Notes in Computer Science, 2495. Springer, Berlin pp. 108-119. ISBN 3-540-00029-1.
|The full text of this publication is not available from this repository. (Contact us about this Publication)|
A number of integrations of the state-based specification language Object-Z and the process algebra CSP have been proposed in recent years. In developing such integrations, a number of semantic decisions have to be made. In particular, what happens when an operation's precondition is not satisfied? Is the operation blocked, i.e., prevented from occurring, or can it occur with an undefined result? Also, are outputs from operations angelic, satisfying the environment's constraints on them, or are the demonic and not influenced by the environment at all? In this paper we discuss the differences between the models, and show that by adopting a blocking model of preconditions together with an angelic model of outputs one can specify systems at higher levels of abstraction.
|Item Type:||Conference or workshop item (Paper)|
|Subjects:||Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,|
|Divisions:||Faculties > Science Technology and Medical Studies > School of Computing > Theoretical Computing Group|
|Depositing User:||Mark Wheadon|
|Date Deposited:||24 Nov 2008 17:59|
|Last Modified:||12 Jun 2012 12:58|
|Resource URI:||http://kar.kent.ac.uk/id/eprint/13698 (The current URI for this page, for reference purposes)|
- Depositors only (login required):