The Need for Compositional Proof Systems: A Survey
COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
Compositional Verification of Real-Time Applications
COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
Timed-event abstraction and timing constraints in distributed real-time programming
WORDS '97 Proceedings of the 3rd Workshop on Object-Oriented Real-Time Dependable Systems - (WORDS '97)
Process-Oriented Development of Embedded Systems: Modeling Behavior and Dependability
WORDS '97 Proceedings of the 3rd Workshop on Object-Oriented Real-Time Dependable Systems - (WORDS '97)
| Hi-index | 0.00 |
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. Here 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.