We show how real-time schedulability tests and program refinement rules can be integrated to create a formal development method of practical use to real-time programmers. A computational model for representing task scheduling is developed within a 'timed’ refinement calculus. Proven multi-tasking schedulability tests then become available as feasibility checks during system refinement
The real-time refinement calculus is a formal method for the systematic derivation of real-time prog...
AbstractThe refinement calculus is a well-established theory for translating specifications to progr...
The refinement calculus is a well-established theory for translating specifications to program code....
This paper shows how the feasibility of scheduling a real-time program consisting of a number of par...
This paper shows how the feasibility of scheduling a realtime program consisting of a number of para...
AbstractA real-time program can be developed by refining a specification into program code. Verifica...
A real-time program can be developed by refining a specification into program code. Verification of ...
The refinement calculus is a well-established theory for formal development of imperative program co...
The real-time refinement calculus is an extension of the standard refinement calculus in which progr...
We present several formal program refinement rules for designing multi-tasking programs with hard re...
When developing multitasking real-time systems, schedulability tests are used to formally prove that...
With increasing popularity and deployment of multi-core chips in embedded systems, a number of real-...
When developing multitasking real-time systems, schedulability tests are used to formally prove that...
The refinement calculus is a well-established theory for deriving program code from specifications. ...
AbstractThe real-time refinement calculus is a formal method for the systematic derivation of real-t...
The real-time refinement calculus is a formal method for the systematic derivation of real-time prog...
AbstractThe refinement calculus is a well-established theory for translating specifications to progr...
The refinement calculus is a well-established theory for translating specifications to program code....
This paper shows how the feasibility of scheduling a real-time program consisting of a number of par...
This paper shows how the feasibility of scheduling a realtime program consisting of a number of para...
AbstractA real-time program can be developed by refining a specification into program code. Verifica...
A real-time program can be developed by refining a specification into program code. Verification of ...
The refinement calculus is a well-established theory for formal development of imperative program co...
The real-time refinement calculus is an extension of the standard refinement calculus in which progr...
We present several formal program refinement rules for designing multi-tasking programs with hard re...
When developing multitasking real-time systems, schedulability tests are used to formally prove that...
With increasing popularity and deployment of multi-core chips in embedded systems, a number of real-...
When developing multitasking real-time systems, schedulability tests are used to formally prove that...
The refinement calculus is a well-established theory for deriving program code from specifications. ...
AbstractThe real-time refinement calculus is a formal method for the systematic derivation of real-t...
The real-time refinement calculus is a formal method for the systematic derivation of real-time prog...
AbstractThe refinement calculus is a well-established theory for translating specifications to progr...
The refinement calculus is a well-established theory for translating specifications to program code....