Interactive Execution Time Predictions using Reference Attributed Grammars
Författare
Summary, in English
A central problem for real-time scheduling is to acquire tight but conservative bounds on task execution times. We present a prototype for an environment where such bounds are interactively presented, in terms of source code constructs, to the programmer during development. The prototype is based on the language development tool APPLAB and uses an extended attribute grammar formalism, reference attributed grammars (RAGs), which overcomes some drawbacks of conventional attribute grammars in this context (e.g. description of non-local dependencies). In this paper we show how timing schemata can be implemented as RAGs. Our experience is that the RAG approach allows timing schemata to be implemented in a clear, concise, and modular manner.
Avdelning/ar
Publiceringsår
1999
Språk
Engelska
Sidor
173-184
Länkar
Dokumenttyp
Konferensbidrag
Ämne
- Computer Science
Conference name
Second Workshop on Attribute Grammars and their Applications (WAGA ’99)
Conference date
1999-03-26
Conference place
Netherlands
Status
Published