Schedulability, Program Transformations and Real-Time Programming

We consider polynomial-time static semantics-preserving transformations of real-time programs. Used in in conjunction with schedulability analysis, the transformations significantly increase the class of real-time programs that may be analyzed efficiently for guaranteed schedulability at compile-tim...

Full description

Saved in:
Bibliographic Details
Published inIFAC Proceedings Volumes Vol. 24; no. 2; pp. 33 - 38
Main Authors Stoyenko, A.D., Marlowe, T.J.
Format Journal Article
LanguageEnglish
Published 01.05.1991
Subjects
Compiler optimization
dynamic programming
programming languages
real time computer systems
schedulability analysis
static analysis
Compiler optimization
dynamic programming
static analysis
programming languages
schedulability analysis
real time computer systems
Online AccessGet full text

Cover

More Information
Summary:We consider polynomial-time static semantics-preserving transformations of real-time programs. Used in in conjunction with schedulability analysis, the transformations significantly increase the class of real-time programs that may be analyzed efficiently for guaranteed schedulability at compile-time.
ISSN:1474-6670
DOI:10.1016/S1474-6670(17)51265-3