In practice, time critical portions of hard real-time systems are still implemented in low-level programming languages and manually tuned to meet all the timing requirements. Without a real-time language that supports an appropriate way of specifying timing constraints for a generic hard real-time systems, and high precision timing analysis that is transparent to users, the users will ever suffer from the complex coding and analysis, particularly for systems requiring fast turnaround responses. In this paper, we propose novel language constructs that can be added to any imperative programming language so that the extended language provides users a way to specify relative timing constraints between arbitrary operations at instruction-level. The compilation techniques unique to transformation of the proposed language are also presented as a part of CHARTS, the Compiler for Hard Real-Time Systems, which generates a valid instruction sequence for a target execution model.
|Number of pages||9|
|State||Published - Nov 1 1995|
|Event||1995 ACM SIGPLAN Workshop on Languages, Compilers, and Tools for Real-Time Systems, LCTES 1995 - San Diego, United States|
Duration: Jun 21 1995 → Jun 22 1995
|Conference||1995 ACM SIGPLAN Workshop on Languages, Compilers, and Tools for Real-Time Systems, LCTES 1995|
|Period||6/21/95 → 6/22/95|
Bibliographical noteFunding Information:
AcknowledgemenTt his work is supportedb y the Office of Naval Research( ONR) under grant number N00014-91-J-4013.
- Hard Real-Time
- Real-Time Language
- Timing Constraint
ASJC Scopus subject areas