Advanced

Interactive Execution Time Predictions using Reference Attributed Grammars

Persson, Patrik LU and Hedin, Görel LU (1999) Second Workshop on Attribute Grammars and their Applications (WAGA ’99) p.173-184
Abstract
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.
Please use this url to cite or link to this publication:
author
organization
publishing date
type
Contribution to conference
publication status
published
subject
pages
12 pages
conference name
Second Workshop on Attribute Grammars and their Applications (WAGA ’99)
language
English
LU publication?
yes
id
f0fad638-2bc7-4efb-9e4e-8c83c36e56c2 (old id 4731684)
alternative location
http://www-sop.inria.fr/members/Didier.Parigot/WAGA99/proceedings/persson/persson.pdf
date added to LUP
2014-10-29 11:23:20
date last changed
2016-04-16 11:58:34
@misc{f0fad638-2bc7-4efb-9e4e-8c83c36e56c2,
  abstract     = {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.},
  author       = {Persson, Patrik and Hedin, Görel},
  language     = {eng},
  pages        = {173--184},
  title        = {Interactive Execution Time Predictions using Reference Attributed Grammars},
  year         = {1999},
}