Platform-independent verification of real-time programs

To include the specification of timing properties in distributed programs, we propose a method to extend existing programming languages with timing annotations. These annotations provide a similar abstraction from the execution platform as is normal for non-real-time languages. Hence they enable the construction of (hard) real-time programs which can be proved correct independently of any underlying execution platform. The realization of programs on a particular platform is considered as a separate phase where, e.g., scheduling is important. We illustrate the method by means of a simple programming language which is extended with timing annotations. A formal, axiomatic, semantics of the language constructs is defined. It is used to prove the correctness of a small example program