Specification and verification of fault-tolerance, timing, and scheduling
ACM Transactions on Programming Languages and Systems (TOPLAS)
| Hi-index | 0.00 |
Assume that a real-time program PT consisting of a number of parallel processes is executed on a system with a set Pr of processors. This paper considers how it can be proved that PT will meet its timing deadlines when the processors are shared between the processes by a real-time scheduler ST. We show that such an implementation of PT can be represented as a transformation SCH(ST, PT, Pr) and that the deadlines of PT will be met if they are satisfied by the timing properties of the transformed program. The scheduler ST can be specified generically and applied to different programs, making it unnecessary to introduce low-level operations such as scheduling primitives into the programming language. The approach has the advantage of considering realtime program specification and schedulability in the same framework and provides a way to determine at the level of the specification the timing properties of a program implementation. By separating the specification of the scheduler from that of the program we can prove the feasibility of an implementation by considering a scheduling policy rather than its implementation details.