Skip to main content

A Circus semantics for Ravenscar protected objects

Atiya, Diyaa-Addein and King, Steven and Woodcock, Jim (2003) A Circus semantics for Ravenscar protected objects. In: Araki, Keijiro and Gnesi, Stefania and Mandrioli, Dion, eds. FME 2003: Formal Methods International Symposium of Formal Methods Europe. Lecture Notes in Computer Science . Springer, Berlin, Germany, pp. 617-635. ISBN 978-3-540-40828-4. E-ISBN 978-3-540-45236-2. (doi:10.1007/978-3-540-45236-2_34) (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)

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. (Contact us about this Publication)
Official URL
http://dx.doi.org/10.1007/978-3-540-45236-2_34

Abstract

The Ravenscar profile is a subset of the Ada 95 tasking model: it is certifiable, deterministic, supports schedulability analysis, and meets tight memory constraints and performance requirements. A central feature of Ravenscar is the use of protected objects to ensure mutually exclusive access to shared data. We give a semantics to protected objects using Circus, a combination of Z and CSP, and prove several important properties; this is the first time that these properties have been verified. Interestingly, all the proofs are conducted in Z, even the ones concerning reactive behaviour.

Item Type: Book section
DOI/Identification number: 10.1007/978-3-540-45236-2_34
Uncontrolled keywords: Ravenscar, Ada Protected Objects, Formal Semantics, Z, Circus
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Faculties > Sciences > School of Computing > Systems Architecture Group
Depositing User: Mark Wheadon
Date Deposited: 24 Nov 2008 18:00 UTC
Last Modified: 30 May 2019 10:22 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/13836 (The current URI for this page, for reference purposes)
  • Depositors only (login required):