Integrating Real-Time Scheduling Theory and Program Refinement (1995)
| Venue: | FME'96: Industrial Benefit and Advances in Formal Methods, volume 1051 of Lecture Notes in Computer Science |
| Citations: | 18 - 7 self |
BibTeX
@INPROCEEDINGS{Fidge95integratingreal-time,
author = {C. Fidge and C. Fidge and M. Utting and M. Utting and P. Kearney and P. Kearney and I. Hayes and I. Hayes},
title = {Integrating Real-Time Scheduling Theory and Program Refinement},
booktitle = {FME'96: Industrial Benefit and Advances in Formal Methods, volume 1051 of Lecture Notes in Computer Science},
year = {1995},
pages = {327--346},
publisher = {Springer-Verlag}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
. 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. 1 Introduction There has long been a gulf between formal methods for specifying and developing real-time programs and the needs of real-time programmers `in the field'. ffl Formal methods for specifying concurrent real-time systems typically make unrealistic simplifying assumptions. In particular, `maximal parallelism' assumes that each task resides on its own processor and is thus never preempted. This is often justified by pointing to the ever-decreasing cost of hardware. ffl Embedded systems programmers, on the other hand, constrained by the realities of power, cost and space limitations, t...
