Refinement and verification of concurrent systems specified in Object-Z and CSP

Smith, G. and Derrick, J. (1997) Refinement and verification of concurrent systems specified in Object-Z and CSP. In: Hinchey, M. and Liu, S., eds. ICFEM. IEEE Computer Society, Hiroshima, Japan pp. 293-302. ISBN 0-8186-8002-4 . (Full text available)

PDF
Download (271kB)
[img]
Preview

Abstract

The formal development of large or complex systems can often be facilitated by the use of more than one formal specification language. Such a combination of languages is particularly suited to the specification of concurrent or distributed systems, where both the modelling of processes and state is necessary. This paper presents an approach to refinement and verification of specifications written using a combination of Object-Z and CSP. A common semantic basis for the two languages enables a unified method of refinement to be used, based upon CSP refinement. To enable state-based techniques to be used for the Object-Z components of a specification we develop state-based refinement relations which are sound and complete with respect to CSP refinement. In addition, a verification method for static and dynamic properties is presented. The method allows us to verify properties of the CSP system specification in terms of its component Object-Z classes by using the laws of the CSP operators together with the logic for Object-Z.

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
Depositing User: Mark Wheadon
Date Deposited: 02 Aug 2009 21:22
Last Modified: 12 Jun 2012 12:52
Resource URI: http://kar.kent.ac.uk/id/eprint/21436 (The current URI for this page, for reference purposes)
  • Depositors only (login required):

Downloads

Downloads per month over past year