Static worst-case timing analysis of Ada

Authors:
Roderick Chapman;Alan Burns;Andy Wellings
Affiliations:
The BAe Dependable Computing Systems Centre, Department of Computer Science, University of York, Heslington, York YO1 5DD. UK.;The BAe Dependable Computing Systems Centre, Department of Computer Science, University of York, Heslington, York YO1 5DD. UK.;The BAe Dependable Computing Systems Centre, Department of Computer Science, University of York, Heslington, York YO1 5DD. UK.
Venue:
ACM SIGAda Ada Letters
Year:
1994

Citing 4
Cited 0

Calculating the maximum, execution time of real-time programs

Real-Time Systems
Experiments with a Program Timing Tool Based on Source-Level Timing Schema

Computer - Special issue on real-time systems
Analyzing Hard-Real-Time Programs for Guaranteed Schedulability

IEEE Transactions on Software Engineering
Predicting program execution times by analyzing static and dynamic program paths

Real-Time Systems - Special issue: Real-time languages and language-level timing tools and analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes recent work on static timing analysis of Ada. Previous work on static timing analysis has not considered Ada, so one goal of this paper is to raise awareness of the topic within the Ada community. We believe the technology is now sufficiently well-understood that commercial tools for a small subset are within reach. We first consider timing analysis in general, and then look at the particular features of Ada in this light. The technical detail of one recently developed tool is then covered. Finally, we consider the impact of Ada9X and some open issues raised by our research.