Results 1  10
of
10
A SetTheoretic Model for RealTime Specification and Reasoning
 IN MATHEMATICS OF PROGRAM CONSTRUCTION
, 1999
"... Timedtrace formalisms have emerged as a powerful method for specifying and reasoning about concurrent realtime systems. We present a simple variant which builds methodically on set theory, and is thus suitable for use by programmers with little formal methods experience. ..."
Abstract

Cited by 25 (7 self)
 Add to MetaCart
Timedtrace formalisms have emerged as a powerful method for specifying and reasoning about concurrent realtime systems. We present a simple variant which builds methodically on set theory, and is thus suitable for use by programmers with little formal methods experience.
Integrating RealTime Scheduling Theory and Program Refinement
 FME'96: INDUSTRIAL BENEFIT AND ADVANCES IN FORMAL METHODS, VOLUME 1051 OF LECTURE NOTES IN COMPUTER SCIENCE
, 1995
"... We show how realtime schedulability tests and program refinement rules can be integrated to create a formal development method of practical use to realtime programmers. A computational model for representing task scheduling is developed within a `timed' refinement calculus. Proven multitasking s ..."
Abstract

Cited by 18 (7 self)
 Add to MetaCart
We show how realtime schedulability tests and program refinement rules can be integrated to create a formal development method of practical use to realtime programmers. A computational model for representing task scheduling is developed within a `timed' refinement calculus. Proven multitasking schedulability tests then become available as feasibility checks during system refinement.
Towards RealTime ObjectZ
 IFM'99
, 1999
"... This paper presents a method of formally specifying systems involving continuous variables and realtime constraints using the objectoriented statebased specification language ObjectZ together with the timed trace notation of the timed refinement calculus. The basis of this integration is a ..."
Abstract

Cited by 10 (3 self)
 Add to MetaCart
This paper presents a method of formally specifying systems involving continuous variables and realtime constraints using the objectoriented statebased specification language ObjectZ together with the timed trace notation of the timed refinement calculus. The basis of this integration is a mapping of the existing ObjectZ history semantics to timed traces.
Compilation as Refinement
 IN PROC. FME ’93, LNCS 670
, 1997
"... Program refinement usually translates an abstract specification to a highlevel language program. However, this process can be taken further by refining a highlevel language `specification' to an assembler code `implementation'. It is shown how this can be done in the familiar refinement calculus f ..."
Abstract

Cited by 10 (4 self)
 Add to MetaCart
Program refinement usually translates an abstract specification to a highlevel language program. However, this process can be taken further by refining a highlevel language `specification' to an assembler code `implementation'. It is shown how this can be done in the familiar refinement calculus framework. Several derived refinement rules for modelling program compilation are presented.
Networks of Predicate Transformers
 Software Verification Research Centre
, 1995
"... A predicate transformer model for network composition of dataflow processes is developed. This model for network composition is shown to support a powerful decomposition rule which allows the arbitrary decomposition of network (liveness, safety, and timing) properties over subcomponents. The rule al ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
A predicate transformer model for network composition of dataflow processes is developed. This model for network composition is shown to support a powerful decomposition rule which allows the arbitrary decomposition of network (liveness, safety, and timing) properties over subcomponents. The rule allows the utilisation of properties of siblings in the development of individual components through their introduction as specification assumptions. An example implementation language of synchronous dataflow machines is considered and the network composition operator specialised so as to support, within the refinement calculus, a compositional development method for this language. 1 Introduction The separation of formal specifications into assumptions about the environment of a process and effects required of the process has a venerable formal methods pedigree, stretching back through Hoare's axioms [5] to the germination of the idea in work by Floyd and even Turing [6]. The adoption of what...
Applying the Cogito Program Development Environment to RealTime System Design
, 1998
"... . We show how a formal program development environment, previously used for sequential, nonrealtime applications only, can be exploited for parallel, realtime system design. A pragmatic approach is adopted, making best use of existing technologies, in order to quickly achieve useful results. ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
. We show how a formal program development environment, previously used for sequential, nonrealtime applications only, can be exploited for parallel, realtime system design. A pragmatic approach is adopted, making best use of existing technologies, in order to quickly achieve useful results. 1 Introduction After an intense period of research, formal program development environments are now maturing. Tools to support specification, refinement, verification and analysis are becoming powerful enough for industrial applications [Hart et al., 1996], although much work remains. Not surprisingly, contemporary environments and tools emphasise wellestablished concepts, such as sequential state machines [Abrial, 1996; Cant et al., 1996]. Nevertheless, there is an increasingly urgent demand for practical techniques that can be used in more challenging application domains, especially realtime systems. Unfortunately, this is an area where there is still considerable disagreement about f...
ComputerAided Development of a RealTime Program
, 1999
"... The refinement calculus is a wellestablished theory for formal development of imperative program code and is supported by a number of automated tools. Via a detailed case study, this article shows how refinement theory and tool support can be extended for a program with realtime constraints. The a ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
The refinement calculus is a wellestablished theory for formal development of imperative program code and is supported by a number of automated tools. Via a detailed case study, this article shows how refinement theory and tool support can be extended for a program with realtime constraints. The approach adapts a timed variant of the refinement calculus and makes corresponding enhancements to a theoremprover based refinement tool.
Modelling RealTime MultiTasking Systems With Timed Traces
 In Proc. Third Australasian Conference on Parallel and RealTime Systems
, 1998
"... We formalise the behaviour of nonpreemptive, realtime, multitasking systems by expressing the computational components assumed by realtime scheduling theory in a tracebased notation. The model is suitable as a target implementation domain for dataflow refinements, amenable to formal schedula ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
We formalise the behaviour of nonpreemptive, realtime, multitasking systems by expressing the computational components assumed by realtime scheduling theory in a tracebased notation. The model is suitable as a target implementation domain for dataflow refinements, amenable to formal schedulability analysis, and implementable in a concurrent realtime programming language. 1 Introduction We present a formal model of realtime, staticpriority, nonpreemptive process scheduling. The model ffl is tracebased, making it a suitable target domain for formal `dataflow' refinements [9], ffl is expressed using the computational components assumed by realtime scheduling theory, making it amenable to analysis via an alreadyproven realtime schedulability test [1], ffl has a direct implementation in the Ada 95 programming language [3], and ffl is sufficiently simple to have a good chance of acceptance in safetycritical applications [2]. 2 Background 2.1 Scheduling theory terminolo...
Introducing Parallel Composition to the Timed Refinement Calculus
 2000: Proceedings of the 7th Australasian Conference on Parallel and RealTime Systems
, 2000
"... The timed refinement calculus is a predicatetransformerbased formalism for the specification and refinement of realtime, reactive systems. Although it has been successfully applied to a number of case studies, its scalability and ability to e#ectively model concurrent and distributed realtime ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
The timed refinement calculus is a predicatetransformerbased formalism for the specification and refinement of realtime, reactive systems. Although it has been successfully applied to a number of case studies, its scalability and ability to e#ectively model concurrent and distributed realtime systems is inhibited by its lack of a suitable parallel composition operator. In particular, previous definitions of parallel composition for the formalism lack associativity or do not behave correctly when one of the components aborts. In this paper, we provide a new definition which is wellbehaved under certain restrictions.
An Introduction to RealTime ObjectZ
 Machine SUIF
, 2002
"... This paper presents RealTime ObjectZ: an integration of the objectoriented, statebased specification language ObjectZ with the timed trace notation of the timed refinement calculus. This integration provides a method of formally specifying and refining systems involving continuous variables and ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This paper presents RealTime ObjectZ: an integration of the objectoriented, statebased specification language ObjectZ with the timed trace notation of the timed refinement calculus. This integration provides a method of formally specifying and refining systems involving continuous variables and realtime constraints. The basis of the integration is a mapping of the existing ObjectZ history semantics to timed traces.