Applying Unifying Theories Of Programming To Real-Time Programming
Alvaro E. Arenas, Juan Bicarregui · 2006
This paper introduces an approach to verify the correctness of the implementation of realtime languages. We apply the techniques presented in Hoare and He’s Unifying Theories of Programming to reason about the correctness of compilers and schedulers for realtime languages, using high-level abstractions such as algebraic laws. In the compilation process, the existence of unique fixed-points is exploited to verify the implementation of crucial real-time operators such as asynchronous input, delay and timeout. It is developed an abstract model for scheduling real-time programs into a uniprocessor machine. The applicability of the model is shown by instancing it with two types of schedulers: a round-robin scheduler, employed when the participating parallel processes do not include deadline constraints, and a priority-based scheduler, used when each participating process is periodic and possesses an associated deadline.